Theorems · Theorem · combinatorics
Fintype.card_fun
∀ {α : Type u_1} {β : Type u_2} [inst : DecidableEq α] [inst_1 : Fintype α] [inst_2 : Fintype β],
Fintype.card (α → β) = Fintype.card β ^ Fintype.card α- Defined in
- Mathlib.Data.Fintype.BigOperators
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 72 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqFintypeFintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Fintypestatement and proof · cited by 7,736
- Fintype.cardstatement and proof · cited by 1,386
- Finset.prod_constproof · cited by 154
- Fintype.card_piproof · cited by 12
Cited by3
Results whose statement or proof uses this declaration.
- Dynamics.IsDynCoverOf.iterate_le_powproof · cited by 2
- TruncatedWittVector.cardproof · cited by 1
- SimpleGraph.card_topEdgeLabelingproof · cited by 0