[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 iterate-subseq-leq
monotone(f), m ≤ n ⊦ ((f ^ m))(λ x. false) ⊆ ((f ^ n))(λ x. false)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
cont-iterate-fix
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 12
Used lemmas:
iterate-rec
,
iterate-base
,
Used spec theorems:
monotone-set-fixpoint
/
subseteq-def
monotone-set-fixpoint
/
monotone-def
Used simplifier rules:
nat
/
lez
nat-basic1
/
f
nat
/
succ-01
nat
/
lels
nat-basic2
/
s
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
nat-basic2
/
succ