Theorems · Theorem · combinatorics

Configuration.HasPoints.lineCount_eq_pointCount

∀ {P : Type u_1} {L : Type u_2} [inst : Membership P L] [Configuration.HasPoints 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: 0 results in Mathlib
Foundations: Depth 97 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: Membership Configuration.HasPoints Fintype Fintype

Mathlib docs Source Loogle LeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites6

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Fintypestatement and proof · cited by 7,736
Fintype.cardstatement and proof · cited by 1,386
Configuration.lineCountstatement · cited by 11
Configuration.pointCountstatement · cited by 11
Configuration.HasPointsstatement and proof · cited by 5
Configuration.HasLines.lineCount_eq_pointCountproof · cited by 3

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.