Theorems · Theorem · order theory
Finset.compl_union
∀ {α : Type u_1} [inst : Fintype α] [inst_1 : DecidableEq α] (s t : Finset α), (s ∪ t)ᶜ = sᶜ ∩ tᶜ- Defined in
- Mathlib.Data.Finset.BooleanAlgebra
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FintypeDecidableEq
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.
- Finsetstatement and proof · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- Compl.complstatement · cited by 2,925
- compl_supproof · cited by 8
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.IsSRGWith.card_commonNeighbors_eq_of_adj_complproof · cited by 1
- SimpleGraph.IsSRGWith.card_commonNeighbors_eq_of_not_adj_complproof · cited by 1