Theorems · Theorem · combinatorics
Fintype.exists_pair_of_one_lt_card
∀ {α : Type u_1} [inst : Fintype α], 1 < Fintype.card α → ∃ a b, a ≠ b- Defined in
- Mathlib.Data.Fintype.EquivFin
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 84 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.
Cites3
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
- exists_pair_neproof · cited by 32
Cited by2
Results whose statement or proof uses this declaration.
- Equiv.Perm.card_le_of_centralizer_le_alternatingproof · cited by 1
- LieAlgebra.SpecialLinear.sl_non_abelianproof · cited by 0