[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 28 from proof prefix-set-flags (previous step)

st0[n1] = mkblock(x0, lax0, m0), st[n] = mkblock(x, lax, m), st[n1] = mkblock(x1, lax1, m1), n ∈ st, n1 ∈ st0, n1 ∈ st, dom st0 ⊆ dom st, lax0 ⊑ lax1, x0 ⊑ x1, ∀ n. n ∈ st0 ∧ n ∈ st → st0[n].list ⊑ st[n].list ∧ st0[n].ladrlist ⊑ st[n].ladrlist ∧ # st0[n].list = # st0[n].ladrlist ∧ # st[n].list = # st[n].ladrlist ⊦ n1 = n, # x0 = # lax0 ∧ # x1 = # lax1

Heuristic cut applied rule cut formula

And obtained the following new goals

Proof step 29:
# x0 = # lax0, st[n1] = mkblock(x1, lax1, m1), st[n] = mkblock(x, lax, m), st0[n1] = mkblock(x0, lax0, m0), n1 ∈ st, n1 ∈ st0, n ∈ st, dom st0 ⊆ dom st, x0 ⊑ x1, lax0 ⊑ lax1, ∀ n. n ∈ st0 ∧ n ∈ st → st0[n].list ⊑ st[n].list ∧ st0[n].ladrlist ⊑ st[n].ladrlist ∧ # st0[n].list = # st0[n].ladrlist ∧ # st[n].list = # st[n].ladrlist ⊦ n1 = n, # x0 = # lax0 ∧ # x1 = # lax1
Proof step 31:
st[n1] = mkblock(x1, lax1, m1), st[n] = mkblock(x, lax, m), st0[n1] = mkblock(x0, lax0, m0), n1 ∈ st, n1 ∈ st0, n ∈ st, dom st0 ⊆ dom st, x0 ⊑ x1, lax0 ⊑ lax1, ∀ n. n ∈ st0 ∧ n ∈ st → st0[n].list ⊑ st[n].list ∧ st0[n].ladrlist ⊑ st[n].ladrlist ∧ # st0[n].list = # st0[n].ladrlist ∧ # st[n].list = # st[n].ladrlist ⊦ # x0 = # lax0, n1 = n, # x0 = # lax0 ∧ # x1 = # lax1

Rule argument

fma: # x0 = # lax0

Additional information

Used formulas: # x0 = # lax0