Theorems · Theorem · combinatorics
Finset.card_eq_of_equiv_fintype
∀ {α : Type u_1} {β : Type u_2} {s : Finset α} [inst : Fintype β] (i : ↥s ≃ β), s.card = Fintype.card β- Defined in
- Mathlib.Data.Fintype.EquivFin
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 65 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.
Cites8
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
- Equivstatement and proof · cited by 8,337
- Fintypestatement and proof · cited by 7,736
- Finset.cardstatement · cited by 2,327
- Fintype.cardstatement · cited by 1,386
- Equiv.transproof · cited by 337
- Fintype.equivFinproof · cited by 51
- Finset.card_eq_of_equiv_finproof · cited by 2
Cited by4
Results whose statement or proof uses this declaration.
- Finset.card_eq_of_equivproof · cited by 3
- SimpleGraph.card_neighborSet_toSubgraphproof · cited by 1
- Finset.card_finsuppAntidiag_nat_eq_multichooseproof · cited by 0
- Finset.card_finsuppAntidiag_nat_eq_chooseproof · cited by 0