Theorems · Theorem · order theory
Disjoint.le_of_codisjoint
∀ {α : Type u_1} [inst : DistribLattice α] [inst_1 : BoundedOrder α] {a b c : α}, Disjoint a b → Codisjoint b c → a ≤ c- Defined in
- Mathlib.Order.Disjoint
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses propext
- Assumes
- DistribLatticeBoundedOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topproof · cited by 9,680
- Disjointstatement and proof · cited by 2,201
- BoundedOrderstatement and proof · cited by 270
- le_sup_leftproof · cited by 265
- Codisjointstatement and proof · cited by 197
- DistribLatticestatement and proof · cited by 150
- Disjoint.eq_botproof · cited by 52
- bot_sup_eqproof · cited by 32
- inf_top_eqproof · cited by 30
- inf_le_inf_rightproof · cited by 23
- Codisjoint.eq_topproof · cited by 22
- sup_inf_rightproof · cited by 22
Cited by3
Results whose statement or proof uses this declaration.
- IsCompl.compl_eqproof · cited by 16
- IsCompl.eq_complproof · cited by 4
- compl_le_hnotproof · cited by 0