arend-lib
arend-lib copied to clipboard
This is [Topology.Locale/pullback_sdense](https://github.com/JetBrains/arend-lib/blob/4ea97da483c5bb2e6a22c8d09c03becf17756c7e/src/Topology/Locale.ard#L1182). A proof of this lemma can be found in A constructive “Closed subgroup theorem” for localic groups and groupoids, Peter T. Johnstone, 1989, Lemma 1.9.
This is [Topology.Locale/pullback_open](https://github.com/JetBrains/arend-lib/blob/4ea97da483c5bb2e6a22c8d09c03becf17756c7e/src/Topology/Locale.ard#L1178). A proof of this theorem can be found in Handbook of Categorical Algebra: Volume 3, Francis Borceux, 1994 (Chapter 1), Theorem 1.6.4.
This is [Category.Subobj/pullback_regularSubobj-isMeet](https://github.com/JetBrains/arend-lib/blob/4ea97da483c5bb2e6a22c8d09c03becf17756c7e/src/Category/Subobj.ard#L42).
This is [Category.Limit/regularMono_pullback](https://github.com/JetBrains/arend-lib/blob/4ea97da483c5bb2e6a22c8d09c03becf17756c7e/src/Category/Limit.ard#L591). This should be straightforward.
This is [Algebra.Ring.Category/CRingBicat.createsLimits](https://github.com/JetBrains/arend-lib/blob/4ea97da483c5bb2e6a22c8d09c03becf17756c7e/src/Algebra/Ring/Category.ard#L210). It is probably better to show that the forgetful functor from any algebraic category to sets creates limits and then transfer this result to rings.
A common pattern in Arend proofs (apart from `==< equalities >==`) is a sequential invocation of functions and metas. A `run` meta makes these chains comprehensible as can be seen...
`Subset`s are currently only defined for `Monoid`s: https://github.com/JetBrains/arend-lib/blob/6be71a0b2477906448d873f07277ec3289b31796/src/Algebra/Ring/Localization.ard#L23-L32 while they can be defined for `BaseSet`s. It goes without saying that this is useful in general.
An expression of the form `equation a b c d` has 3 omitted proofs (namely, `a = b`, `b = c`, and `c = d`). The context will be computed...
This is just a show-case of the feature. It's not like I want to merge this -- this is for review & reference only.