Mathlib Map

Theorems · Theorem · combinatorics

Configuration.ProjectivePlane.Dual.order

∀ (P : Type u_1) (L : Type u_2) [inst : Membership P L] [inst_1 : Configuration.ProjectivePlane P L] [Finite P]
  [Finite L],
  Configuration.ProjectivePlane.order (Configuration.Dual L) (Configuration.Dual P) =
    Configuration.ProjectivePlane.order P L
Defined in
Mathlib.Combinatorics.Configuration
Cited by
2 results in Mathlib
Foundations
Depth 100 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
MembershipConfiguration.ProjectivePlaneFiniteFinite
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Configuration.ProjectivePlane.pointCount_eq · cited by 3ProjectivePlane.pointCoun…Configuration.ProjectivePlane.card_lines · cited by 0ProjectivePlane.card_linesFinite · cited by 3029FiniteConfiguration.ProjectivePlane · cited by 14Configuration.ProjectiveP…Configuration.ProjectivePlane.order · cited by 6ProjectivePlane.orderConfiguration.Dual · cited by 6Configuration.DualConfiguration.ProjectivePlane.exists_config · cited by 5ProjectivePlane.exists_co…Configuration.ProjectivePlane.lineCount_eq_pointCount · cited by 1ProjectivePlane.lineCount…Dual.orderCITED BYCITES

Cites6

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

Cited by2

Results whose statement or proof uses this declaration.