[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 mon-below
ii(0) = 0, ∀ n. ii(n) ≤ ii(n + 1), m < ii(n0) ⊦ ∃ n1. n1 < n0 ∧ ii(n1) ≤ m ∧ m < ii(n1 + 1)
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: 3
Proof steps: 10
Used lemmas:
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
nat-basic
/
succ
nat
/
fle-01
nat
/
lels
nat-basic
/
refl-nat
nat-basic
/
ls-02