Theorems · Theorem · combinatorics
Configuration.HasLines.lineCount_eq_pointCount
∀ {P : Type u_1} {L : Type u_2} [inst : Membership P L] [Configuration.HasLines P L] [inst_2 : Fintype P]
[inst_3 : Fintype L],
Fintype.card P = Fintype.card L →
∀ {p : P} {l : L}, p ∉ l → Configuration.lineCount L p = Configuration.pointCount P l- Defined in
- Mathlib.Combinatorics.Configuration
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 96 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites30
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetproof · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- Set.ofPredproof · cited by 6,101
- Finset.sumproof · cited by 5,195
- Finset.univproof · cited by 3,473
- Compl.complproof · cited by 2,925
- Finset.sum_congrproof · cited by 2,323
- SProd.sprodproof · cited by 1,750
- Fintype.cardstatement and proof · cited by 1,386
- Function.Bijectiveproof · cited by 863
- Finset.sum_constproof · cited by 254
- Set.toFinsetproof · cited by 217
Cited by3
Results whose statement or proof uses this declaration.
- Configuration.ProjectivePlane.lineCount_eq_lineCountproof · cited by 3
- Configuration.ProjectivePlane.lineCount_eq_pointCountproof · cited by 1
- Configuration.HasPoints.lineCount_eq_pointCountproof · cited by 0