Theorems · Theorem · order theory
Codisjoint.top_le
∀ {α : Type u_1} [inst : SemilatticeSup α] [inst_1 : OrderTop α] {a b : α}, Codisjoint a b → ⊤ ≤ a ⊔ b- Defined in
- Mathlib.Order.Disjoint
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 7 from the axioms · uses no axioms
- Assumes
- SemilatticeSupOrderTop
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.
- Top.topstatement · cited by 9,680
- SemilatticeSupstatement and proof · cited by 785
- OrderTopstatement and proof · cited by 493
- Codisjointstatement · cited by 197
- codisjoint_iff_le_supproof · cited by 15
Cited by9
Results whose statement or proof uses this declaration.
- Codisjoint.eq_topproof · cited by 22
- hnot_symmDiff_selfproof · cited by 3
- Codisjoint.map_orderIsoproof · cited by 2
- LinearMap.iInf_ker_proj_le_iSup_range_singleproof · cited by 2
- Finset.filter_union_filter_of_codisjointproof · cited by 1
- LinearMap.rank_diagonalproof · cited by 1
- Submodule.isHilbertSumOrthogonalproof · cited by 0
- codisjoint_sInf_leftproof · cited by 0
- codisjoint_sInf_rightproof · cited by 0