Theorems · Theorem · order theory
sdiff_compl
∀ {α : Type u} {x y : α} [inst : BooleanAlgebra α], x \ yᶜ = x ⊓ y- Defined in
- Mathlib.Order.BooleanAlgebra.Basic
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 55 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- BooleanAlgebra
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Compl.complstatement · cited by 2,925
- BooleanAlgebrastatement and proof · cited by 300
- compl_complproof · cited by 229
- sdiff_eqproof · cited by 18
Cited by8
Results whose statement or proof uses this declaration.
- Set.sdiff_complproof · cited by 8
- isDiscrete_of_codiscreteWithinproof · cited by 3
- compl_sdiff_complproof · cited by 3
- IsUpperSet.card_inter_le_finsetproof · cited by 2
- MeasureTheory.Measure.map_eq_comapproof · cited by 1
- Topology.IsConstructible.image_of_isClosedEmbeddingproof · cited by 1
- compl_singleton_mem_codiscreteWithinproof · cited by 0
- IsUpperSet.le_card_inter_finsetproof · cited by 0