Theorems · Theorem · combinatorics
Finset.card_eq_three
∀ {α : Type u_1} {s : Finset α} [inst : DecidableEq α], s.card = 3 ↔ ∃ x y z, x ≠ y ∧ x ≠ z ∧ y ≠ z ∧ s = {x, y, z}- Defined in
- Mathlib.Data.Finset.Card
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
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.
- Finsetstatement and proof · cited by 13,712
- Finset.cardstatement · cited by 2,327
- Finset.card_eq_succproof · cited by 7
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.EdgeDisjointTriangles.card_edgeFinset_leproof · cited by 1
- SimpleGraph.egirth_topproof · cited by 1
- SimpleGraph.is3Clique_iffproof · cited by 1
- SimpleGraph.cliqueFree_hasse_threeproof · cited by 0