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

〈RED1(ks(n0); tn)〉 tn = tn0, tn0 = none → n0 ≤ 1, tn0 ≠ none → ¬ n0 ≤ 1 ∧ tn0 = some(ks(n0 - 2)) ⊦ 〈RED1(ks(n0) _ K; tn)〉 ((tn = none → n0 = 0) ∧ (tn ≠ none → n0 ≠ 0 ∧ tn = some(ks(n0 + 1 - 2))))

User applied rule call right

And obtained the following new goals

Proof step 12:
⊦
Proof step 82:
〈RED1(ks(n0); tn)〉 tn = tn0, tn0 = none → n0 ≤ 1, tn0 ≠ none → ¬ n0 ≤ 1 ∧ tn0 = some(ks(n0 - 2)) ⊦ 〈TOPRED(ks(n0) _ K; tn0)〉〈if tn0 = none ∧ ap(ks(n0) _ K) then { RED1((ks(n0) _ K) .1; tn0) ; if tn0 ≠ none then tn0 := some(tn0 .t _ (ks(n0) _ K) .2) else if value((ks(n0) _ K) .1) then { RED1((ks(n0) _ K) .2; tn0) ; if tn0 ≠ none then tn0 := some((ks(n0) _ K) .1 _ tn0 .t) } }〉 ((tn0 = none → n0 = 0) ∧ (tn0 ≠ none → n0 ≠ 0 ∧ tn0 = some(ks(n0 + 1 - 2))))

Rule argument

[fmapos-arg: pos: right 1]

Additional information

[[CONCRETESIMPRULES : ()]]