Theorems · Theorem · combinatorics
Configuration.HasPoints.lineCount_le_pointCount
∀ {P : Type u_1} {L : Type u_2} [inst : Membership P L] [Configuration.HasPoints P L] {p : P} {l : L},
p ∉ l → ∀ [hf : Finite { p // p ∈ l }], Configuration.lineCount L p ≤ Configuration.pointCount P l- Defined in
- Mathlib.Combinatorics.Configuration
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 95 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finitestatement and proof · cited by 3,029
- Configuration.lineCountstatement · cited by 11
- Configuration.pointCountstatement · cited by 11
- Configuration.HasPointsstatement and proof · cited by 5
- Configuration.HasLines.pointCount_le_lineCountproof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.