[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 bufs-eq (
previous step
)
⊦ (σ to n).buf = (σ to m).buf ↔ n = m, # σ < ⌜m⌝ , # σ < ⌜n⌝
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
(σ to n).buf = (σ to m).buf ⊦ n = m, # σ < ⌜n⌝ , # σ < ⌜m⌝
Rule argument
Additional information