Theorems · Theorem · order theory
IsModularLattice.exists_inf_eq_and_sup_eq
∀ {α : Type u_1} [inst : Lattice α] [IsModularLattice α] {a b c : α} [inst_2 : BoundedOrder α] [ComplementedLattice α],
a ≤ b → b ≤ c → ∃ b', b ⊓ b' = a ∧ b ⊔ b' = c- Defined in
- Mathlib.Order.ModularLattice
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites17
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LE.le.transproof · cited by 3,151
- Disjointproof · cited by 2,201
- Latticestatement and proof · cited by 916
- IsComplproof · cited by 351
- BoundedOrderstatement and proof · cited by 270
- sup_of_le_leftproof · cited by 218
- Codisjointproof · cited by 197
- sup_of_le_rightproof · cited by 143
- inf_of_le_rightproof · cited by 128
- IsModularLatticestatement and proof · cited by 86
- Disjoint.eq_botproof · cited by 52
- ComplementedLatticestatement and proof · cited by 30
Cited by2
Results whose statement or proof uses this declaration.
- IsModularLattice.exists_disjoint_and_sup_eqproof · cited by 0
- IsModularLattice.exists_inf_eq_and_codisjointproof · cited by 0