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