Theorems · Inductive type · order theory
IsCompl
{α : Type u_1} → [inst : PartialOrder α] → [BoundedOrder α] → α → α → PropTwo elements x and y are complements of each other if x ⊔ y = ⊤ and x ⊓ y = ⊥.
- Defined in
- Mathlib.Order.Disjoint
- Cited by
- 351 results in Mathlib
- Foundations
- Depth 2 from the axioms, rests on 7 definitions · uses no axioms
- Assumes
- PartialOrderBoundedOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- PartialOrderstatement · cited by 6,410
- BoundedOrderstatement · cited by 270
Cited by391
Results whose statement or proof uses this declaration.
- Submodule.projectionOntostatement and proof · cited by 81
- IsCompl.symmstatement and proof · cited by 80
- Submodule.projectionstatement and proof · cited by 63
- Submodule.IsTopCompl.isComplstatement · cited by 44
- IsCompl.disjointstatement and proof · cited by 42
- Submodule.prodEquivOfIsComplstatement and proof · cited by 35
- IsCompl.codisjointstatement and proof · cited by 32
- Submodule.isCompl_orthogonalstatement · cited by 24
- Submodule.projectionOnto_apply_leftstatement and proof · cited by 23
- Submodule.quotientEquivOfIsComplstatement and proof · cited by 23
- IsComplementedproof · cited by 22
- isCompl_complstatement · cited by 21
Showing the 200 most cited of 391.