[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 6 from proof exputin (
previous step
)
st[a, d] = st0[a, d0] ⊦ st0[a, d] = st0[a, d0], a ∈ st0
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 7
:
⊦ d ≠ d0 → st[a, d] ≠ st0[a, d0]
Rule argument
spec: store inst: name: put-neq seq: ⊦ d ≠ d0 → st[a, d] ≠ st0[a, d0] subst: [d0, st0, d, a, st] → [d0, st0, d, a, st] flags: rewrite, current
Additional information
Used terms: d0, st0, d, a, st