[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-append1
⊦ mon<(⌜nl⌝ + ⌜nl0⌝ ) → (¬ mon<(⌜nl⌝ ) ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp, simp,
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: 4
Proof steps: 8
Used lemmas:
monls-def
,
Used spec theorems:
list-del
/natstream/
get-append-less
Used simplifier rules:
list-data
/natstream/
l
nat
/
lels
stream
/natstream/
sel-fin
nat-inf
/
ls-natinf-to-nat-2-1
stream
/natstream/
get-append2-fin
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-inf
/
ls-natinf-to-nat-2-2
stream
/natstream/
append-assoc
stream
/natstream/
size-fin
stream
/natstream/
size-append
nat
/
fle
nat-basic1
/
f
list-del
/natstream/
get-append-less
nat-basic2
/
l-08
nat-basic1
/
ref-1
list-del
/natstream/
get-append-grt
list
/natstream/
a
nat-basic2
/
nls-fst
nat-basic2
/
a
nat-basic2
/
c