[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 1 from proof in-write-same (conclusion)
st[n].list = x, st[n].ladrlist = lax ⊦ n ∈ st → (adr ∈ st[n, mkblock(x, lax, m)] ↔ adr ∈ st)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
st[n].ladrlist = lax, st[n].list = x, n ∈ st ⊦ adr ∈ st[n, mkblock(x, lax, m)] ↔ adr ∈ st
Rule argument
Additional information