Theorems · Theorem · computer science
ContextFreeRule.Rewrites.append_left
∀ {T : Type u_1} {N : Type u_2} {r : ContextFreeRule T N} {u v : List (Symbol T N)},
r.Rewrites u v → ∀ (p : List (Symbol T N)), r.Rewrites (p ++ u) (p ++ v)Add extra prefix to context-free rewriting.
- Defined in
- Mathlib.Computability.ContextFreeGrammar
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses propext
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.
- Symbolstatement and proof · cited by 47
- ContextFreeRulestatement and proof · cited by 33
- ContextFreeRule.Rewritesstatement and proof · cited by 16
- ContextFreeRule.inputproof · cited by 13
- ContextFreeRule.outputproof · cited by 10
- ContextFreeRule.rewrites_iffproof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- ContextFreeRule.Rewrites.reverseproof · cited by 1
- ContextFreeGrammar.Produces.append_leftproof · cited by 1