[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 65 from proof lift-unknown (previous step)

mk(rs1, f) = (∅ ++ r)[r, o], rs1 ∩ rs0 = ∅, R[rs0, f, g], ∀ r. r ∈ rs1 → g(r) = a ⊦ r = null, r ==>(o, a)(mk(rs1, f, g)), ∃ o, a. (r ==>(o, a) * R)[rs1 ∪ rs0, f, g]

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 66:
⊦ r ==>(o, a)(Ha) ↔ Ha = (∅ ++ r)[r, o, a] ∧ r ≠ null
Proof step 67:
mk(rs1, f) = (∅ ++ r)[r, o], rs1 ∩ rs0 = ∅, R[rs0, f, g], ∀ r. r ∈ rs1 → g(r) = a ⊦ r = null, ∃ o, a. (r ==>(o, a) * R)[rs1 ∪ rs0, f, g], mk(rs1, f, g) = (∅ ++ r)[r, o, a] ∧ r ≠ null

Rule argument

spec: maplet, inst: heap-aux name: maplet seq: ⊦ r ==>(o, a)(Ha) ↔ Ha = (∅ ++ r)[r, o, a] ∧ r ≠ null subst: [Ha, a, o, r] → [mk(rs1, f, g), a, o, r] flags: <all paths>

Additional information

Used terms: mk(rs1, f, g), a, o, r