Theorems · Theorem · combinatorics
Configuration.Nondegenerate.eq_or_eq
∀ {P : Type u_1} {L : Type u_2} {inst : Membership P L} [self : Configuration.Nondegenerate P L] {p₁ p₂ : P}
{l₁ l₂ : L}, p₁ ∈ l₁ → p₂ ∈ l₁ → p₁ ∈ l₂ → p₂ ∈ l₂ → p₁ = p₂ ∨ l₁ = l₂- Defined in
- Mathlib.Combinatorics.Configuration
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
- Assumes
- Configuration.Nondegenerate
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Configuration.Nondegeneratestatement and proof · cited by 4
Cited by5
Results whose statement or proof uses this declaration.
- Configuration.HasLines.pointCount_le_lineCountproof · cited by 4
- Configuration.ProjectivePlane.lineCount_eq_lineCountproof · cited by 3
- Configuration.Nondegenerate.exists_injective_of_card_leproof · cited by 2
- Configuration.ProjectivePlane.card_pointsproof · cited by 1
- Configuration.HasPoints.existsUnique_pointproof · cited by 1