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