Theorems · Inductive type · combinatorics
Configuration.Nondegenerate
(P : Type u_1) → (L : Type u_2) → [Membership P L] → Prop
A configuration is nondegenerate if: 1) there does not exist a line that passes through all of the points, 2) there does not exist a point that is on all of the lines, 3) there is at most one line through any two points, 4) any two lines have at most one intersection point. Conditions 3 and 4 are equivalent.
- Defined in
- Mathlib.Combinatorics.Configuration
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
- Assumes
- Membership
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by16
Results whose statement or proof uses this declaration.
- Configuration.Nondegenerate.eq_or_eqstatement and proof · cited by 5
- Configuration.Nondegenerate.exists_injective_of_card_lestatement and proof · cited by 2
- Configuration.Nondegenerate.exists_linestatement and proof · cited by 2
- Configuration.Nondegenerate.exists_pointstatement and proof · cited by 2
- Configuration.HasLines.mk.noConfusionstatement and proof · cited by 0
- Configuration.HasPoints.mk.noConfusionstatement and proof · cited by 0
- Configuration.HasPoints.noConfusionproof · cited by 0
- Configuration.HasPoints.noConfusionTypeproof · cited by 0
- Configuration.HasPoints.recOnstatement and proof · cited by 0
- Configuration.Nondegenerate.casesOnstatement and proof · cited by 0
- Configuration.Nondegenerate.recOnstatement and proof · cited by 0
- Configuration.HasLines.casesOnstatement and proof · cited by 0