Theorems · Inductive type · combinatorics
Configuration.HasLines
(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 points has a line through them.
- Defined in
- Mathlib.Combinatorics.Configuration
- Cited by
- 6 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 by15
Results whose statement or proof uses this declaration.
- Configuration.HasLines.pointCount_le_lineCountstatement and proof · cited by 4
- Configuration.HasLines.lineCount_eq_pointCountstatement and proof · cited by 3
- Configuration.HasLines.mkLinestatement and proof · cited by 3
- Configuration.HasLines.card_lestatement and proof · cited by 2
- Configuration.HasLines.mkLine_axstatement and proof · cited by 2
- Configuration.HasLines.exists_bijective_of_card_eqstatement and proof · cited by 1
- Configuration.HasLines.mk.noConfusionstatement · cited by 0
- Configuration.HasLines.casesOnstatement and proof · cited by 0
- Configuration.HasLines.ctorIdxstatement and proof · cited by 0
- Configuration.HasLines.existsUnique_linestatement and proof · cited by 0
- Configuration.HasLines.hasPointsstatement and proof · cited by 0
- Configuration.HasLines.noConfusionstatement and proof · cited by 0