[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 nodes-append (previous step)

# x = # lax, st[n] = mkblock(x, lax, m0), inv-flashsize(x, lax), n ∈ st, @(n, m4, m5) ∈ st ⊦ @(n, m4, m5) = @(n, m, m2), (x + a ')[pos(@(m4, m5), lax + @(m, m2) ')] = x[pos(@(m4, m5), lax)], dups(lax), @(m, m2) ∈ lax

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 33:
⊦ ¬ ladr ∈ lax → pos(ladr, lax + lax0) = pos(ladr, lax0) + # lax
Proof step 34:
# x = # lax, st[n] = mkblock(x, lax, m0), inv-flashsize(x, lax), @(m4, m5) ∈ lax, @(n, m4, m5) ∈ st, n ∈ st ⊦ @(n, m4, m5) = @(n, m, m2), (x + a ')[pos(@(m4, m5), lax + @(m, m2) ')] = x[pos(@(m4, m5), lax)], dups(lax), @(m, m2) ∈ lax

Rule argument

spec: list-del, inst: laddress-list name: app-05-neg seq: ⊦ ¬ ladr ∈ lax → pos(ladr, lax + lax0) = pos(ladr, lax0) + # lax subst: [lax0, lax, ladr] → [@(m, m2) ', lax, @(m4, m5)] flags: <all paths>

Additional information

Used simplifier rules: ⊦ ¬ ladr ∈ lax → pos(ladr, lax) = # lax; (s)% ⊦ st[n] = mkblock(x, lax, m0) ∧ @(n, n0, n1) ∈ st → @(n0, n1) ∈ lax; (ss) Used terms: @(m, m2) ', lax, @(m4, m5)