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

〈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) ⊦

Heuristic symbolic execution applied rule vardecls left

And obtained the following new goals

Proof step 34:
〈RED1(t; tn0): kappa0 〉〈if tn0 ≠ none then RED(tn0 .t; t0): kappa0 else t0 := t〉 t0 = t1, ∀ t0, t2. ¬ 〈RED(t0; t'): kappa0 〉 t' = t2 ∨ t0 =>* t2 ∧ irred(t2), ¬ t =>* t1 ∨ ¬ irred(t1), tn0 = none ⊦

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ()]]