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

〈if tn4 = none ∧ ap(t0 _ t1) then { RED1((t0 _ t1) .1; tn4) ; if tn4 ≠ none then tn4 := some(tn4 .t _ (t0 _ t1) .2) else if value((t0 _ t1) .1) then { RED1((t0 _ t1) .2; tn4) ; if tn4 ≠ none then tn4 := some((t0 _ t1) .1 _ tn4 .t) } }〉 tn4 = tn0, 〈TOPRED(t0 _ t1; tn)〉 tn = tn4, 〈RED1(t0; tn3): m 〉 tn3 = some(t2), 〈TOPRED(t0 _ t1; tn2): m 〉 tn2 = none, ∀ n0, t, tn1, tn0. n0 < m + 1 → (〈RED1(t; tn2): n0 〉 tn2 = tn1 ∧ 〈RED1(t; tn2)〉 tn2 = tn0 ∧ tn0 ≠ tn1 → false), tn0 ≠ some(t2 _ t1) ⊦

User applied rule insert lemma

And obtained the following new goals

Proof step 4:
〈TOPRED(t; tn)〉 tn = tn0, 〈TOPRED(t; tn): n 〉 tn = tn1 ⊦ tn0 = tn1
Proof step 8:
〈if tn4 = none ∧ ap(t0 _ t1) then { RED1((t0 _ t1) .1; tn4) ; if tn4 ≠ none then tn4 := some(tn4 .t _ (t0 _ t1) .2) else if value((t0 _ t1) .1) then { RED1((t0 _ t1) .2; tn4) ; if tn4 ≠ none then tn4 := some((t0 _ t1) .1 _ tn4 .t) } }〉 tn4 = tn0, 〈TOPRED(t0 _ t1; tn)〉 tn = tn4, 〈RED1(t0; tn3): m 〉 tn3 = some(t2), 〈TOPRED(t0 _ t1; tn2): m 〉 tn2 = none, ∀ n0, t, tn1, tn0. n0 < m + 1 → (〈RED1(t; tn2): n0 〉 tn2 = tn1 ∧ 〈RED1(t; tn2)〉 tn2 = tn0 ∧ tn0 ≠ tn1 → false), tn0 ≠ some(t2 _ t1) ⊦ 〈TOPRED(t0 _ t1; tn): m 〉 tn = none
Proof step 46:
〈if tn4 = none ∧ ap(t0 _ t1) then { RED1((t0 _ t1) .1; tn4) ; if tn4 ≠ none then tn4 := some(tn4 .t _ (t0 _ t1) .2) else if value((t0 _ t1) .1) then { RED1((t0 _ t1) .2; tn4) ; if tn4 ≠ none then tn4 := some((t0 _ t1) .1 _ tn4 .t) } }〉 tn4 = tn0, 〈TOPRED(t0 _ t1; tn)〉 tn = tn4, 〈RED1(t0; tn3): m 〉 tn3 = some(t2), 〈TOPRED(t0 _ t1; tn2): m 〉 tn2 = none, ∀ n0, t, tn1, tn0. n0 < m + 1 → (〈RED1(t; tn2): n0 〉 tn2 = tn1 ∧ 〈RED1(t; tn2)〉 tn2 = tn0 ∧ tn0 ≠ tn1 → false), tn0 ≠ some(t2 _ t1), tn4 = none ⊦

Rule argument

[x0lemmaarg: spec-name: instance-name: lemma-name: kappa-TOPRED antecedent: 〈TOPRED(t; tn)〉 tn = tn0, 〈TOPRED(t; tn): n 〉 tn = tn1 succedent: tn0 = tn1 substlist: [t, tn0, n, tn1] → [t0 _ t1, tn4, m, none] add preconditions?: F is rewrite lemma?: F current spec?: T rotate lemma?: F replace all?: F paths: () dummy: () ]

Additional information

[[CONCRETESIMPRULES : ()], [EXTRATERMS : (t0 _ t1, tn4, m, none)]]