[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 31 from proof RED-complete (previous step)

∀ n0, t', t. n0 < m + 1 → (irred(t') ∧ (=> ^ n0)(t, t') → 〈RED(t; t0)〉 t0 = t'), irred(t'), t => t0, (=> ^ m)(t0, t') ⊦ 〈RED(t; t0)〉 t0 = t'

User applied rule call right

And obtained the following new goals

Proof step 14:
⊦
Proof step 30:
∀ n0, t', t. n0 < m + 1 → (irred(t') ∧ (=> ^ n0)(t, t') → 〈RED(t; t0)〉 t0 = t'), irred(t'), t => t0, (=> ^ m)(t0, t') ⊦ 〈let tn = none in { RED1(t; tn) ; if tn ≠ none then RED(tn .t; t1) else t1 := t }〉 t1 = t'

Rule argument

[fmapos-arg: pos: right 1]

Additional information

[[CONCRETESIMPRULES : ()]]