Theorems · Theorem · order theory
compl_sdiff_compl
∀ {α : Type u} {x y : α} [inst : BooleanAlgebra α], xᶜ \ yᶜ = y \ x- Defined in
- Mathlib.Order.BooleanAlgebra.Basic
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 56 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.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Compl.complstatement and proof · cited by 2,925
- BooleanAlgebrastatement and proof · cited by 300
- inf_commproof · cited by 139
- sdiff_eqproof · cited by 18
- sdiff_complproof · cited by 8
Cited by3
Results whose statement or proof uses this declaration.
- compl_symmDiff_complproof · cited by 3
- PrimeSpectrum.exists_constructibleSetData_iffproof · cited by 2
- compl_himp_complproof · cited by 0