Theorems · Theorem · order theory
IsCompl.left_le_iff
∀ {α : Type u_1} [inst : DistribLattice α] [inst_1 : BoundedOrder α] {x y z : α}, IsCompl x y → (x ≤ z ↔ Codisjoint z y)- Defined in
- Mathlib.Order.Disjoint
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 21 from the axioms · uses propext, Quot.sound
- Assumes
- DistribLatticeBoundedOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- IsComplstatement and proof · cited by 351
- BoundedOrderstatement and proof · cited by 270
- Codisjointstatement · cited by 197
- DistribLatticestatement and proof · cited by 150
- IsCompl.dualproof · cited by 6
- IsCompl.le_left_iffproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- IsCompl.right_le_iffproof · cited by 1