Theorems · Theorem · combinatorics
Configuration.Nondegenerate.exists_injective_of_card_le
∀ {P : Type u_1} {L : Type u_2} [inst : Membership P L] [Configuration.Nondegenerate P L] [inst_2 : Fintype P]
[inst_3 : Fintype L], Fintype.card L ≤ Fintype.card P → ∃ f, Function.Injective f ∧ ∀ (l : L), f l ∉ lIf a nondegenerate configuration has at least as many points as lines, then there exists
an injective function f from lines to points, such that f l does not lie on l.
- Defined in
- Mathlib.Combinatorics.Configuration
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 88 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites35
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetproof · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- Set.ofPredproof · cited by 6,101
- Finset.univproof · cited by 3,473
- LE.le.transproof · cited by 3,151
- Compl.complproof · cited by 2,925
- Finset.cardproof · cited by 2,327
- Fintype.cardstatement and proof · cited by 1,386
- Finset.mem_univproof · cited by 361
- Finset.biUnionproof · cited by 217
- Set.toFinsetproof · cited by 217
- Finset.card_singletonproof · cited by 144
Cited by2
Results whose statement or proof uses this declaration.
- Configuration.HasLines.card_leproof · cited by 2
- Configuration.HasLines.exists_bijective_of_card_eqproof · cited by 1