Mathlib Map

Theorems · Theorem · computer science

ContextFreeRule.Rewrites.brecOn

∀ {T : Type u_1} {N : Type u_2} {r : ContextFreeRule T N}
  {motive : (a a_1 : List (Symbol T N)) → r.Rewrites a a_1 → Prop} {a a_1 : List (Symbol T N)} (t : r.Rewrites a a_1),
  (∀ (a a_2 : List (Symbol T N)) (t : r.Rewrites a a_2), ContextFreeRule.Rewrites.below t → motive a a_2 t) →
    motive a a_1 t
Defined in
Mathlib.Computability.ContextFreeGrammar
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.

ContextFreeRule.Rewrites.reverse · cited by 1Rewrites.reverseSymbol · cited by 47SymbolContextFreeRule · cited by 33ContextFreeRuleContextFreeRule.Rewrites · cited by 16ContextFreeRule.RewritesContextFreeRule.Rewrites.below · cited by 2Rewrites.belowRewrites.brecOnCITED BYCITES

Cites4

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.