[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 11 from proof reachable-modbehind (previous step)

(H[r].nxt ' + x0).last ∈ H, reachable((H[r].nxt ' + x0).last, r1, H), path(H[r].nxt ' + x0, H), r ∈ H, r1 ∈ H, r ∈ H[r1, ce], ∀ r2, H0, r3, ce0. path(r2 ' + x0, H0) ∧ reachable((r2 ' + x0).last, r3, H0) → reachable(r3, (r2 ' + x0).last, H0) ∨ path(r2 ' + x0, H0[r3, ce0]) ⊦ r = null, reachable(r1, (H[r].nxt ' + x0).last, H), path(H[r1, ce][r].nxt ' + x0, H[r1, ce]) ∧ H[r1, ce][r].nxt = H[r].nxt

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 12:
⊦ r ≠ r0 → H[r0, ce][r] = H[r]
Proof step 13:
¬ r ≠ r1, (H[r].nxt ' + x0).last ∈ H, reachable((H[r].nxt ' + x0).last, r1, H), path(H[r].nxt ' + x0, H), r ∈ H, r1 ∈ H, r ∈ H[r1, ce], ∀ r2, H0, r3, ce0. path(r2 ' + x0, H0) ∧ reachable((r2 ' + x0).last, r3, H0) → reachable(r3, (r2 ' + x0).last, H0) ∨ path(r2 ' + x0, H0[r3, ce0]) ⊦ r = null, reachable(r1, (H[r].nxt ' + x0).last, H), path(H[r1, ce][r].nxt ' + x0, H[r1, ce]) ∧ H[r1, ce][r].nxt = H[r].nxt
Proof step 17:
r ≠ r1, (H[r].nxt ' + x0).last ∈ H, reachable((H[r].nxt ' + x0).last, r1, H), path(H[r].nxt ' + x0, H), r ∈ H, r1 ∈ H, r ∈ H[r1, ce], ∀ r2, H0, r3, ce0. path(r2 ' + x0, H0) ∧ reachable((r2 ' + x0).last, r3, H0) → reachable(r3, (r2 ' + x0).last, H0) ∨ path(r2 ' + x0, H0[r3, ce0]) ⊦ r = null, reachable(r1, (H[r].nxt ' + x0).last, H), path(H[r].nxt ' + x0, H[r1, ce]) ∧ H[r].nxt = H[r].nxt

Rule argument

spec: store inst: linheap name: At-other seq: ⊦ r ≠ r0 → H[r0, ce][r] = H[r] subst: [r, ce, r0, H] → [r, ce, r1, H] flags: rewrite

Additional information

Used terms: r, ce, r1, H