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

〈RED1(t; tn3)〉 tn3 = tn0, ∀ n0, t, tn1, tn0. n0 < m + 1 → (〈RED1(t; tn3): n0 〉 tn3 = tn1 ∧ 〈RED1(t; tn3)〉 tn3 = tn0 ∧ tn0 ≠ tn1 → false), tn0 ≠ none, m ≠ 0, ¬ ap(t) ⊦

User applied rule call left

And obtained the following new goals

Proof step 288:
⊦
Proof step 297:
〈TOPRED(t; tn)〉〈if tn = none ∧ ap(t) then { RED1(t .1; tn) ; if tn ≠ none then tn := some(tn .t _ t .2) else if value(t .1) then { RED1(t .2; tn) ; if tn ≠ none then tn := some(t .1 _ tn .t) } }〉 tn = tn0, ∀ n0, t, tn1, tn0. n0 < m + 1 → (〈RED1(t; tn3): n0 〉 tn3 = tn1 ∧ 〈RED1(t; tn3)〉 tn3 = tn0 ∧ tn0 ≠ tn1 → false), tn0 ≠ none, m ≠ 0, ¬ ap(t) ⊦

Rule argument

[fmapos-arg: pos: left 1]

Additional information

[[CONCRETESIMPRULES : ()]]