[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 weakmon-lem
∀ n. ii(n) ≤ ii(n + 1) ⊦ (∀ n. ∃ m. ii(m) ≥ n) ∨ (∃ n. ∀ m. m ≥ n → ii(m) = ii(n))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
infinite-append
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 16
Proof steps: 37
Used lemmas:
Used spec theorems:
Used simplifier rules:
nat
/
ge
nat
/
lez-01
nat-basic
/
succ
nat
/
le-def
nat
/
les
nat-basic
/
a
nat-basic
/
c
nat-basic
/
f
nat-basic
/
lf-02
nat
/
lels-02
nat
/
ls-le-simp
nat
/
lez
nat
/
succ-01
nat
/
ls-02
nat-basic
/
one-01
nat
/
elim-pred-c
nat-basic
/
s-04
nat-basic
/
oz
nat
/
le-ls-simp
nat
/
lels
nat-basic
/
refl-nat
nat
/
let
nat
/
lels-03
nat
/
fle
nat
/
ler
nat
/
anti