Theorems · Theorem · order theory
GaloisInsertion.l_u_eq
∀ {α : Type u} {β : Type v} {l : α → β} {u : β → α} [inst : Preorder α] [inst_1 : PartialOrder β]
(gi : GaloisInsertion l u) (b : β), l (u b) = b- Defined in
- Mathlib.Order.GaloisConnection.Defs
- Cited by
- 37 results in Mathlib
- Foundations
- Depth 6 from the axioms · uses no axioms
- Assumes
- PreorderPartialOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement and proof · cited by 7,952
- PartialOrderstatement and proof · cited by 6,410
- LE.le.antisymmproof · cited by 507
- GaloisInsertion.gcproof · cited by 137
- GaloisConnection.l_u_leproof · cited by 36
- GaloisInsertionstatement and proof · cited by 35
- GaloisInsertion.le_l_uproof · cited by 5
Cited by37
Results whose statement or proof uses this declaration.
- CategoryTheory.Sieve.generate_sieveproof · cited by 19
- Submonoid.closure_eqproof · cited by 13
- GaloisInsertion.l_iSup_uproof · cited by 12
- GaloisInsertion.l_sup_uproof · cited by 11
- AddSubmonoid.closure_eqproof · cited by 10
- GaloisInsertion.l_iInf_uproof · cited by 10
- Subgroup.closure_eqproof · cited by 9
- GaloisInsertion.l_inf_uproof · cited by 9
- Submodule.map_comap_eq_of_surjectiveproof · cited by 8
- FirstOrder.Language.Substructure.closure_eqproof · cited by 7
- AddSubgroup.closure_eqproof · cited by 7
- Subfield.closure_eqproof · cited by 4