[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 33 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

User applied rule insert proof lemma

And obtained the following new goals

Proof step 34:
gstore1 =○refsize gstore0, @(m, m0, m1) ∈ gstore0 ⊦ m ∈ ginval, @(m, m0, m1) ∈ gstore1

Rule argument

path: 1, 1, 2, 2, 1, 1, 2, 2, 3, 2, 2, 2 subst: [gstore1, gstore0, m, m0, m1, ginval] → [gstore0, gstore1, m, m0, m1, ginval]

Additional information

Used simplifier rules: ⊦ gstore =○refsize gstore0 → gstore0 =○refsize gstore; (ss)