Theorems · Inductive type · order theory
CompletelyDistribLattice
Type u → Type u
A completely distributive lattice is a complete lattice whose ⨅ and ⨆
distribute over each other.
- Defined in
- Mathlib.Order.CompleteBooleanAlgebra
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 0 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by23
Results whose statement or proof uses this declaration.
- CompletelyDistribLattice.toHImpstatement and proof · cited by 2
- CompletelyDistribLattice.toSDiffstatement and proof · cited by 2
- CompletelyDistribLattice.MinimalAxioms.ofstatement and proof · cited by 2
- CompletelyDistribLattice.iInf_iSup_eqstatement and proof · cited by 1
- CompletelyDistribLattice.toComplstatement and proof · cited by 1
- CompletelyDistribLattice.toHNotstatement and proof · cited by 1
- biSup_iInter_of_pairwise_disjointstatement and proof · cited by 1
- iInf_iSup_eqstatement and proof · cited by 1
- CompletelyDistribLattice.casesOnstatement and proof · cited by 0
- CompletelyDistribLattice.ctorIdxstatement and proof · cited by 0
- CompletelyDistribLattice.himp_botstatement and proof · cited by 0
- CompletelyDistribLattice.le_himp_iffstatement and proof · cited by 0