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

〈RED1(t; tn)〉 tn = tn0, 〈RED1(t; tn): n 〉 tn = tn1, ∀ n0, t, tn1, tn0. n0 < n → (〈RED1(t; tn): n0 〉 tn = tn1 ∧ 〈RED1(t; tn)〉 tn = tn0 ∧ tn0 ≠ tn1 → false), tn0 ≠ tn1 ⊦

User applied rule call left

And obtained the following new goals

Proof step 1:
⊦
Proof step 313:
〈tn0 := tn〉〈if n = 0 then abort else { TOPRED(t; tn0): n -1 ; if tn0 = none ∧ ap(t) then { RED1(t .1; tn0): n -1 ; if tn0 ≠ none then tn0 := some(tn0 .t _ t .2) else if value(t .1) then { RED1(t .2; tn0): n -1 ; if tn0 ≠ none then tn0 := some(t .1 _ tn0 .t) } } }〉 tn0 = tn1, 〈RED1(t; tn)〉 tn = tn0, ∀ n0, t, tn1, tn0. n0 < n → (〈RED1(t; tn): n0 〉 tn = tn1 ∧ 〈RED1(t; tn)〉 tn = tn0 ∧ tn0 ≠ tn1 → false), tn0 ≠ tn1 ⊦

Rule argument

[fmapos-arg: pos: left 2]

Additional information

[[CONCRETESIMPRULES : ()]]