[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 refsize-cons-crash (previous step)

(∅)[n] = groupblock(gndx0, lax0, m), dom gstore0 ∪ elems nx = dom gstore ∪ ginval, n ∈ ginval, n ∈ crash(gstore, gstore0, ginval, nx), fi.lebs ⊆ dom gstore0 ⊦ # ginval = 0, ginval = ∅, m = 0, n ∈ gstore0, n ∈ nx

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 15:
⊦ n ∈ crash(gstore, gstore0, ginval, nx) ↔ n ∈ gstore ∨ n ∈ ginval
Proof step 16:
(∅)[n] = groupblock(gndx0, lax0, m), dom gstore0 ∪ elems nx = dom gstore ∪ ginval, n ∈ ginval, fi.lebs ⊆ dom gstore0, n ∈ gstore ∨ n ∈ ginval ⊦ # ginval = 0, ginval = ∅, m = 0, n ∈ nx, n ∈ gstore0

Rule argument

spec: apersistence-base name: crash-group-in seq: ⊦ n ∈ crash(gstore, gstore0, ginval, nx) ↔ n ∈ gstore ∨ n ∈ ginval subst: [nx, ginval, gstore0, gstore, n] → [nx, ginval, gstore0, gstore, n] flags: <all paths>

Additional information

Used terms: nx, ginval, gstore0, gstore, n