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

〈TOPRED(K _ t3 _ t1; tn)〉 tn = none, 〈RED1(t1; tn4)〉 tn4 = none, 〈RED1(K _ t3; tn2)〉 tn2 = none, ∀ n0, t, tn1, tn0. n0 < m + 1 → (〈RED1(t; tn3): n0 〉 tn3 = tn1 ∧ 〈RED1(t; tn3)〉 tn3 = tn0 ∧ tn0 ≠ tn1 → false), m ≠ 0, value(t3), value(t1) ⊦

Heuristic weak unfold applied rule call left

And obtained the following new goals

Proof step 193:
⊦
Proof step 195:
〈if ap(K _ t3 _ t1) ∧ ap((K _ t3 _ t1) .1) ∧ (K _ t3 _ t1) .1 .1 = K ∧ value((K _ t3 _ t1) .1 .2) ∧ value((K _ t3 _ t1) .2) then tn0 := some((K _ t3 _ t1) .1 .2) else if ap(K _ t3 _ t1) ∧ ap((K _ t3 _ t1) .1) ∧ ap((K _ t3 _ t1) .1 .1) ∧ (K _ t3 _ t1) .1 .1 .1 = S then let v1 = (K _ t3 _ t1) .1 .1 .2, v2 = (K _ t3 _ t1) .1 .2, v3 = (K _ t3 _ t1) .2 in if value(v1) ∧ value(v2) ∧ value(v3) then tn0 := some(v1 _ v3 _ (v2 _ v3)) else tn0 := none else tn0 := none〉 tn0 = none, 〈RED1(t1; tn4)〉 tn4 = none, 〈RED1(K _ t3; tn2)〉 tn2 = none, ∀ n0, t, tn1, tn0. n0 < m + 1 → (〈RED1(t; tn3): n0 〉 tn3 = tn1 ∧ 〈RED1(t; tn3)〉 tn3 = tn0 ∧ tn0 ≠ tn1 → false), m ≠ 0, value(t3), value(t1) ⊦

Rule argument

[fmapos-arg: pos: left 1]

Additional information

[[CONCRETESIMPRULES : ()]]