[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 32 from proof remove-refsize0-refsize-cons (previous step)

# x = # lax, st[m] = mkblock(x, lax, 0), @(m, m0, 0) ∈ as, m ∈ st, @(m0, 0) ∈ lax, as ⊆ dom nodes(st), ∀ n. n < # lax → lax[n].size = x[n].flashsize ⊦ # as = 0, as = ∅, dups(lax), dom nodes(st) ⊆ dom nodes(remove-refsize0(st))

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 33:
⊦ ladr ∈ lax ↔ (∃ lax0, lax1. lax = lax0 + (ladr + lax1))
Proof step 34:
# x = # lax, st[m] = mkblock(x, lax, 0), m ∈ st, @(m, m0, 0) ∈ as, as ⊆ dom nodes(st), ∀ n. n < # lax → lax[n].size = x[n].flashsize, ∃ lax0, lax1. lax = lax0 + (@(m0, 0) + lax1) ⊦ # as = 0, as = ∅, dups(lax), dom nodes(st) ⊆ dom nodes(remove-refsize0(st))

Rule argument

spec: list, inst: laddress-list name: in-def seq: ⊦ ladr ∈ lax ↔ (∃ lax0, lax1. lax = lax0 + (ladr + lax1)) subst: [lax, ladr] → [lax, @(m0, 0)] flags: <all paths>

Additional information

Used terms: lax, @(m0, 0)