[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 14 from proof program+leftmost (previous step)

r0 ∈ H1, H[r0] = mknode(r2, a2, r4), H[r] = mknode(r0, a0, r1), H1 ≡ H[r, mknode(r4, a0, r1)], (r0 => mknode(null, a, r6) * tr(r1, t1) * tr(r6, t2) * r => mknode(r4, a0, r1) * P)(H1), r ∈ H, ¬ (tr(r, branch(t2, a0, t1)) * P * true)(H1) ∨ a2 ≠ a ⊦ H[r0] .right = H1[r0] .right ∧ H[r0] .val = H1[r0] .val, r0 = null

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 9:
⊦ H0 ≡ H1 ↔ H0 = H1
Proof step 13:
r0 ∈ H1, H[r0] = mknode(r2, a2, r4), H[r] = mknode(r0, a0, r1), H1 = H[r, mknode(r4, a0, r1)], (r0 => mknode(null, a, r6) * tr(r1, t1) * tr(r6, t2) * r => mknode(r4, a0, r1) * P)(H1), r ∈ H, ¬ (tr(r, branch(t2, a0, t1)) * P * true)(H1) ∨ a2 ≠ a ⊦ H[r0] .right = H1[r0] .right ∧ H[r0] .val = H1[r0] .val, r0 = null

Rule argument

[x0lemmaarg: spec-name: separation instance-name: node-heap lemma-name: eq antecedent: succedent: H0 ≡ H1 ↔ H0 = H1 substlist: [H1, H0] → [H[r, mknode(r4, a0, r1)], H1] add preconditions?: F is rewrite lemma?: T current spec?: F rotate lemma?: F replace all?: T paths: ((0, 0, 3)) dummy: () ]

Additional information

[[CONCRETESIMPRULES : ()], [EXTRATERMS : (H[r, mknode(r4, a0, r1)], H1)]]