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

gstore1 =○refsize gstore0 ⊦ nodes(gstore1 ↓, ginval) = nodes(gstore0 ↓, ginval)

User applied rule insert rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel> name: nodes-except-refsize seq: ⊦ gstore1 =○refsize gstore0 → nodes(gstore1, ginval) = nodes(gstore0, ginval) subst: [gstore0, ginval, gstore1] → [gstore0 ↓, ginval, gstore1 ↓] flags: <all paths>

Additional information

Used simplifier rules: down-except-refsize: ⊦ gstore1 =○refsize gstore0 → gstore1 ↓ =○refsize gstore0 ↓; Used terms: gstore0 ↓, ginval, gstore1 ↓