[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 2 from proof size-in (
previous step
)
a ∈ st ⊦ # st[a, d] = # st
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 3
:
⊦ a ∈ st ↔ st = (st -- a)[a, st[a]]
Proof step 4
:
st = (st -- a)[a, st[a]] ⊦ # st[a, d] = # st
Rule argument
spec: store inst: name: indef-01 seq: ⊦ a ∈ st ↔ st = (st -- a)[a, st[a]] subst: [st, a] → [st, a] flags: rewrite, current
Additional information
Used terms: st, a