Mathlib Map

Theorems · Definition · combinatorics

Configuration.HasPoints.recOn

{P : Type u_1} →
  {L : Type u_2} →
    [inst : Membership P L] →
      {motive : Configuration.HasPoints P L → Sort u} →
        (t : Configuration.HasPoints P L) →
          ([toNondegenerate : Configuration.Nondegenerate P L] →
              (mkPoint : {l₁ l₂ : L} → l₁ ≠ l₂ → P) →
                (mkPoint_ax : ∀ {l₁ l₂ : L} (h : l₁ ≠ l₂), mkPoint h ∈ l₁ ∧ mkPoint h ∈ l₂) →
                  motive { toNondegenerate := toNondegenerate, mkPoint := mkPoint, mkPoint_ax := mkPoint_ax }) →
            motive t
Defined in
Mathlib.Combinatorics.Configuration
Cited by
0 results in Mathlib
Foundations
Depth 5 from the axioms · uses no axioms
Assumes
Membership
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Configuration.HasPoints · cited by 5Configuration.HasPointsConfiguration.Nondegenerate · cited by 4Configuration.Nondegenera…HasPoints.recOnCITED BYCITES

Cites2

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

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.