Theorems · Theorem · combinatorics
Fin.card_filter_univ_succ
∀ {n : ℕ} (p : Fin (n + 1) → Prop) [inst : DecidablePred p],
{x | p x}.card = if p 0 then {x | p x.succ}.card + 1 else {x | p x.succ}.card- Defined in
- Mathlib.Data.Fintype.Fin
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidablePred
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Finsetproof · cited by 13,712
- Finset.univstatement and proof · cited by 3,473
- Finset.cardstatement and proof · cited by 2,327
- Finset.filterstatement and proof · cited by 949
- Finset.mapproof · cited by 747
- Finset.consproof · cited by 221
- Finset.card_mapproof · cited by 114
- Function.mtproof · cited by 27
- Finset.mem_of_mem_filterproof · cited by 18
- Finset.card_consproof · cited by 16
- Fin.succ_injectiveproof · cited by 13
Cited by1
Results whose statement or proof uses this declaration.
- Fin.card_filter_univ_succ'proof · cited by 1