[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 1 from proof monls-mon-implies-monls (conclusion)
⊦ (∀ n. mon<(nσf(n))) ∧ mon(nσf) → (¬ mon<(lim(λ n. nσf(n))) ↔ false)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
mon(nσf), ∀ n. mon<(nσf(n)) ⊦ mon<(lim(nσf))
Rule argument
Additional information