[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
,
Theorem monls-def
⊦ mon<(nσ) ↔ (∀ n. ⌜n⌝ + ⌜1⌝ < # nσ → nσ[n] < nσ[n + 1])
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
min-empty
,
min-skolemf
,
monls-append1
,
monls-append2
,
monls-from
,
monls-ls
,
monls-mon-implies-monls
,
monls-notsmall
,
monls-to
,
rem-preserves-monls
,
stutf-invmonls
,
Used by units in proved state:
Proof exists?: No