Theorems · Theorem · order theory
IsComplemented.sup
∀ {α : Type u_1} [inst : DistribLattice α] [inst_1 : BoundedOrder α] {a b : α},
IsComplemented a → IsComplemented b → IsComplemented (a ⊔ b)- Defined in
- Mathlib.Order.Disjoint
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses propext
- Assumes
- DistribLatticeBoundedOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- IsComplproof · cited by 351
- BoundedOrderstatement and proof · cited by 270
- DistribLatticestatement and proof · cited by 150
- IsComplementedstatement and proof · cited by 22
- IsCompl.sup_infproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Complementeds.mk_sup_mkstatement · cited by 0