Theorems · Definition · combinatorics
Configuration.HasLines.hasPoints
{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 → Configuration.HasPoints P LIf a nondegenerate configuration has a unique line through any two points, and if |P| = |L|,
then there is a unique point on any two lines.
- Defined in
- Mathlib.Combinatorics.Configuration
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 99 from the axioms · uses propext, Classical.choice, Quot.sound
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
- Configuration.HasLinesstatement and proof · cited by 6
- Configuration.HasPointsstatement · cited by 5
Cited by1
Results whose statement or proof uses this declaration.
- Configuration.HasPoints.hasLinesproof · cited by 0