Theorems · Theorem · order theory
Finset.insert_compl_self
∀ {α : Type u_1} [inst : Fintype α] [inst_1 : DecidableEq α] (x : α), insert x {x}ᶜ = Finset.univ- Defined in
- Mathlib.Data.Finset.BooleanAlgebra
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 66 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.
Cites7
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
- Finset.univstatement and proof · cited by 3,473
- Compl.complstatement and proof · cited by 2,925
- Finset.erase_singletonproof · cited by 6
- Finset.compl_emptyproof · cited by 5
- Finset.compl_eraseproof · cited by 2
Cited by3
Results whose statement or proof uses this declaration.
- Fin.univ_succproof · cited by 3
- Fin.univ_succAboveproof · cited by 2
- Fin.univ_castSuccEmbproof · cited by 1