Theorems · Theorem · combinatorics
Fintype.card_congr
∀ {α : Type u_4} {β : Type u_5} [inst : Fintype α] [inst_1 : Fintype β] (f : α ≃ β), Fintype.card α = Fintype.card β- Defined in
- Mathlib.Data.Fintype.Card
- Cited by
- 67 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Equivstatement and proof · cited by 8,337
- Fintypestatement and proof · cited by 7,736
- Fintype.cardstatement and proof · cited by 1,386
- Fintype.ofEquiv_cardproof · cited by 16
- Fintype.ofEquivproof · cited by 15
Cited by67
Results whose statement or proof uses this declaration.
- Fintype.card_congr'proof · cited by 60
- Fintype.card_eqproof · cited by 19
- ZMod.card_units_eq_totientproof · cited by 15
- Equiv.Perm.IsCycle.orderOfproof · cited by 14
- orderOf_dvd_cardproof · cited by 9
- Set.card_range_of_injectiveproof · cited by 7
- addOrderOf_dvd_cardproof · cited by 5
- Nat.totient_mulproof · cited by 5
- IsPGroup.card_modEq_card_fixedPointsproof · cited by 4
- MulAction.card_orbit_mul_card_stabilizer_eq_card_groupproof · cited by 4
- Module.length_compositionSeriesproof · cited by 4
- linearIndependent_le_basisproof · cited by 4