Theorems · Inductive type · combinatorics
Configuration.HasPoints
(P : Type u_1) → (L : Type u_2) → [Membership P L] → Type (max u_1 u_2)
A nondegenerate configuration in which every pair of lines has an intersection point.
- Defined in
- Mathlib.Combinatorics.Configuration
- Cited by
- 5 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 by19
Results whose statement or proof uses this declaration.
- Configuration.HasPoints.mkPointstatement and proof · cited by 3
- Configuration.HasPoints.mkPoint_axstatement and proof · cited by 2
- Configuration.HasPoints.card_lestatement and proof · cited by 1
- Configuration.HasPoints.existsUnique_pointstatement and proof · cited by 1
- Configuration.HasPoints.lineCount_le_pointCountstatement and proof · cited by 0
- Configuration.HasPoints.noConfusionstatement and proof · cited by 0
- Configuration.HasPoints.noConfusionTypestatement and proof · cited by 0
- Configuration.HasPoints.mk.noConfusionstatement · cited by 0
- Configuration.HasPoints.recOnstatement and proof · cited by 0
- Configuration.ProjectivePlane.mk.noConfusionstatement and proof · cited by 0
- Configuration.ProjectivePlane.casesOnstatement and proof · cited by 0
- Configuration.ProjectivePlane.noConfusionproof · cited by 0