[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 except-refsizeeq-trans (previous step)

st2[n] = mkblock(x0, lax0, m0), (∅)[n] = mkblock(x, lax, m), ∀ n. (n ∈ st1 ↔ n ∈ st2) ∧ st1[n].list = st2[n].list ∧ st1[n].ladrlist = st2[n].ladrlist, ∀ n. (n ∈ st0 ↔ n ∈ st1) ∧ st0[n].list = st1[n].list ∧ st0[n].ladrlist = st1[n].ladrlist ⊦ n ∈ st0, ¬ n ∈ st2 ∧ x = x0 ∧ lax = lax0

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 29:
(∅)[n] = mkblock(x, lax, m), st2[n] = mkblock(x0, lax0, m0), n ∈ st2, ∀ n. (n ∈ st0 ↔ n ∈ st1) ∧ st0[n].list = st1[n].list ∧ st0[n].ladrlist = st1[n].ladrlist, ∀ n. (n ∈ st1 ↔ n ∈ st2) ∧ st1[n].list = st2[n].list ∧ st1[n].ladrlist = st2[n].ladrlist ⊦ n ∈ st0, ¬ n ∈ st2 ∧ x = x0 ∧ lax = lax0

Rule argument

fma: n ∈ st2

Additional information

Used simplifier rules: ⊦ ¬ n ∈ st → st[n] = (∅)[n]; (s)%⊦ mkblock(x, lax, m) = mkblock(x0, lax0, m0) ↔ x = x0 ∧ lax = lax0 ∧ m = m0; (ws) Used formulas: n ∈ st2