[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 27 from proof swap-from-to (
previous step
)
¬ #(σ from m) < ⌜n⌝ ⊦ ⌜n⌝ = #((σ to m + n) from m), # σ < ⌜m⌝ + ⌜n⌝
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 28
:
⊦ ⌜n⌝ = #((σ to m + n) from m), # σ < ⌜m⌝ + ⌜n⌝ , #(σ from m) < ⌜n⌝
Rule argument
Additional information