[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 38 from proof RED1-lem (previous step)

〈TOPRED(t; tn)〉 (tn = none ⊃ ¬ (∃ t0. t =>top t0); t =>top tn .t), ∀ t0. #(t0) < #(t) → (true → 〈RED1(t0; tn)〉 (tn = none ⊃ irred(t0); t0 => tn .t)) ⊦ 〈TOPRED(t; tn0)〉〈if tn0 = none ∧ ap(t) then { RED1(t .1; tn0) ; if tn0 ≠ none then tn0 := some(tn0 .t _ t .2) else if value(t .1) then { RED1(t .2; tn0) ; if tn0 ≠ none then tn0 := some(t .1 _ tn0 .t) } }〉 (tn0 = none ⊃ irred(t); t => tn0 .t)

Heuristic contract and execute applied rule execute call

And obtained the following new goals

Proof step 37:
〈TOPRED(t; tn)〉 tn = tn1, ∀ t0. #(t0) < #(t) → (true → 〈RED1(t0; tn)〉 (tn = none ⊃ irred(t0); t0 => tn .t)), tn1 = none ⊃ ¬ (∃ t0. t =>top t0) ; t =>top tn1 .t ⊦ 〈if tn1 = none ∧ ap(t) then { RED1(t .1; tn1) ; if tn1 ≠ none then tn1 := some(tn1 .t _ t .2) else if value(t .1) then { RED1(t .2; tn1) ; if tn1 ≠ none then tn1 := some(t .1 _ tn1 .t) } }〉 (tn1 = none ⊃ irred(t); t => tn1 .t)

Rule argument

[fmaposlist-arg: (pos: left 1, pos: right 1)]

Additional information

[[CONCRETESIMPRULES : ()]]