Theorems · Theorem · combinatorics
Configuration.HasLines.exists_bijective_of_card_eq
∀ {P : Type u_1} {L : Type u_2} [inst : Membership P L] [Configuration.HasLines P L] [inst_2 : Fintype P]
[inst_3 : Fintype L],
Fintype.card P = Fintype.card L →
∃ f, Function.Bijective f ∧ ∀ (l : L), Configuration.pointCount P l = Configuration.lineCount L (f l)- Defined in
- Mathlib.Combinatorics.Configuration
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 95 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
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
- Finset.univproof · cited by 3,473
- Fintype.cardstatement and proof · cited by 1,386
- Function.Bijectivestatement and proof · cited by 863
- Finset.mem_univproof · cited by 361
- ge_of_eqproof · cited by 67
- Configuration.lineCountstatement and proof · cited by 11
- Configuration.pointCountstatement · cited by 11
- Fintype.bijective_iff_injective_and_cardproof · cited by 11
- Function.Bijective.sum_compproof · cited by 8
- Configuration.HasLinesstatement and proof · cited by 6
- Configuration.HasLines.pointCount_le_lineCountproof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- Configuration.HasLines.lineCount_eq_pointCountproof · cited by 3