Theorems · Theorem · order theory
Set.card_insert
∀ {α : Type u} {a : α} (s : Set α) [inst : Fintype ↑s],
a ∉ s → ∀ {d : Fintype ↑(insert a s)}, Fintype.card ↑(insert a s) = Fintype.card ↑s + 1- Defined in
- Mathlib.Data.Set.Finite.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Fintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Fintypestatement and proof · cited by 7,736
- Set.Elemstatement and proof · cited by 7,166
- Fintype.cardstatement and proof · cited by 1,386
- Fintype.card_congr'proof · cited by 60
- Set.card_fintypeInsertOfNotMemproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.