[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 30 from proof nodes-except-refsize (previous step)

gstore1[@(m, m0, m1)] = mkgnode(nd, m2, boolvar, boolvar0), gstore1 =○refsize gstore0, @(m, m0, m1) ∈ gstore1 ⊦ m ∈ ginval, @(m, m0, m1) ∈ gstore0 ∧ nd = nodes(gstore0, ginval)[@(m, m0, m1)]

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 31:
⊦ adr ∈ nodes(gstore, ginval) → nodes(gstore, ginval)[adr] = gstore[adr].nd
Proof step 32:
gstore1[@(m, m0, m1)] = mkgnode(nd, m2, boolvar, boolvar0), gstore1 =○refsize gstore0, @(m, m0, m1) ∈ gstore1 ⊦ m ∈ ginval, @(m, m0, m1) ∈ nodes(gstore0, ginval), @(m, m0, m1) ∈ gstore0 ∧ nd = nodes(gstore0, ginval)[@(m, m0, m1)]
Proof step 35:
gstore1[@(m, m0, m1)] = mkgnode(nd, m2, boolvar, boolvar0), gstore1 =○refsize gstore0, @(m, m0, m1) ∈ gstore1, @(m, m0, m1) ∈ nodes(gstore0, ginval) ⊦ m ∈ ginval, @(m, m0, m1) ∈ gstore0 ∧ nd = gstore0[@(m, m0, m1)].nd

Rule argument

spec: <toplevel> name: nodes-gstore-at seq: ⊦ adr ∈ nodes(gstore, ginval) → nodes(gstore, ginval)[adr] = gstore[adr].nd subst: [adr, ginval, gstore] → [@(m, m0, m1), ginval, gstore0] flags: <all paths>

Additional information

Used terms: @(m, m0, m1), ginval, gstore0