[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-to
⊦ mon<(⌜nnf⌝ ) → (mon<(⌜nnf to n⌝ ) ↔ true)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
rem-preserves-monls
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 7
Used lemmas:
monls-def
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat
/
lels
stream
/
get-infto
nat
/
ls-le-simp
stream
/
sel-fin
nat-basic
/
c
nat-basic
/
a
nat-basic
/
l-02
nat
/
fle
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-inf
/
ls-natinf-to-nat-2-1
stream
/
inf-size-to
stream
/
sel-inf
nat-inf
/
disj-rqui-infty
nat-inf
/
addeqinf-cancel
nat-inf
/
inf-less
stream
/
size-inf