Theorems · Inductive type · order theory
IsModularLattice
(α : Type u_2) → [Lattice α] → Prop
A modular lattice is one with a limited associativity between ⊓ and ⊔.
- Defined in
- Mathlib.Order.ModularLattice
- Cited by
- 86 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
- Assumes
- Lattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Latticestatement · cited by 916
Cited by96
Results whose statement or proof uses this declaration.
- infIccOrderIsoIccSupstatement and proof · cited by 6
- Finpartition.bindstatement and proof · cited by 5
- Finpartition.extendstatement and proof · cited by 5
- sup_inf_assoc_of_lestatement and proof · cited by 5
- infIooOrderIsoIooSupstatement and proof · cited by 4
- Finpartition.combinestatement and proof · cited by 4
- Finset.SupIndep.biUnionstatement and proof · cited by 4
- complementedLattice_of_sSup_atoms_eq_topstatement and proof · cited by 3
- IsModularLattice.inf_sup_inf_assocstatement and proof · cited by 3
- inf_sup_assoc_of_lestatement and proof · cited by 3
- Disjoint.disjoint_sup_left_of_disjoint_sup_rightstatement and proof · cited by 3
- Disjoint.disjoint_sup_right_of_disjoint_sup_leftstatement and proof · cited by 3