Mathlib Map

Theorems · Theorem · order theory

Prod.GameAdd.recursion_eq

∀ {α : Type u_1} {β : Type u_2} {rα : α → α → Prop} {rβ : β → β → Prop} {C : α → β → Sort u_3} (hα : WellFounded rα)
  (hβ : WellFounded rβ)
  (IH : (a₁ : α) → (b₁ : β) → ((a₂ : α) → (b₂ : β) → Prod.GameAdd rα rβ (a₂, b₂) (a₁, b₁) → C a₂ b₂) → C a₁ b₁) (a : α)
  (b : β), Prod.GameAdd.recursion hα hβ IH a b = IH a b fun a' b' x => Prod.GameAdd.recursion hα hβ IH a' b'
Defined in
Mathlib.Order.GameAdd
Cited by
1 results in Mathlib
Foundations
Depth 10 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Prod.GameAdd.fix_eq · cited by 0GameAdd.fix_eqProd.GameAdd · cited by 18Prod.GameAddProd.GameAdd.recursion · cited by 3GameAdd.recursionWellFounded.prod_gameAdd · cited by 1WellFounded.prod_gameAddGameAdd.recursion_eqCITED BYCITES

Cites3

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

Cited by1

Results whose statement or proof uses this declaration.