[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 36 from proof RED-correct (previous step)

〈RED(t; t'): kappa0 + 1 〉 t' = t1, ∀ t0, t2. ¬ 〈RED(t0; t'): kappa0 〉 t' = t2 ∨ t0 =>* t2 ∧ irred(t2), ¬ t =>* t1 ∨ ¬ irred(t1) ⊦

User applied rule call left

And obtained the following new goals

Proof step 4:
⊦
Proof step 35:
〈let tn = none in { RED1(t; tn): kappa0 ; if tn ≠ none then RED(tn .t; t0): kappa0 else t0 := t }〉 t0 = t1, ∀ t0, t2. ¬ 〈RED(t0; t'): kappa0 〉 t' = t2 ∨ t0 =>* t2 ∧ irred(t2), ¬ t =>* t1 ∨ ¬ irred(t1) ⊦

Rule argument

[fmapos-arg: pos: left 1]

Additional information

[[CONCRETESIMPRULES : ()]]