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

∀ t0. #(t0) < #(t) → (¬ hasS(t0) → 〈RED(t0; t')〉 true), ¬ hasS(t) ⊦ 〈let tn = none in { RED1(t; tn) ; if tn ≠ none then RED(tn .t; t0) else t0 := t }〉 true

Heuristic symbolic execution applied rule vardecls right

And obtained the following new goals

Proof step 12:
∀ t0. #(t0) < #(t) → (¬ hasS(t0) → 〈RED(t0; t')〉 true), ¬ hasS(t), tn0 = none ⊦ 〈RED1(t; tn0)〉〈if tn0 ≠ none then RED(tn0 .t; t0) else t0 := t〉 true

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ()]]