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

∀ t0. #(t0) < #(t) → (¬ hasS(t0) → 〈RED(t0; t')〉 true), ¬ hasS(t) ⊦ 〈RED(t; t')〉 true

User applied rule call right

And obtained the following new goals

Proof step 1:
⊦
Proof step 13:
∀ 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

Rule argument

[fmapos-arg: pos: right 1]

Additional information

[[CONCRETESIMPRULES : ()]]