[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 stutf-slowincrease
⊦ stutf(nσ) ∧ ⌜m⌝ + ⌜n⌝ < # nσ → nσ[m + n] ≤ nσ[m] + n
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
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:
stutf-def
,
Used spec theorems:
Used simplifier rules:
nat
/
lels-01
nat-basic2
/
add-base
nat-basic1
/
ref-1
nat-basic2
/
succ
nat
/
lels
nat-inf
/
ls-natinf-to-nat-2-1
nat-inf
/
add-ls-cancel-01
nat-inf
/
lsle-trans
nat-inf
/
add-fin
nat-basic2
/
a
nat-basic2
/
c
nat-inf
/
add-assoc
nat-inf
/
add-comm
nat-basic1
/
lf-01
nat-basic2
/
l
nat
/
le-ls-simp
nat
/
fle
nat-basic1
/
f
nat-basic2
/
eq
nat-basic2
/
l-02