[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 eqle-one
⊦ m = n + 1 ∧ n < n0 → m ≤ n0
Type: A user defined theorem
Validity: The proof is valid.
Features: forward, localforward,
Comment:
Used by:
le-add-02
,
Used by units in proved state:
list-last
,
list-del
,
string-less
,
stream
,
nat-div
,
string-less-new
,
stut-mon
,
nat-pot
,
intnat
,
nat-mult
,
infinite-append
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 1
Used lemmas:
ls-le-simp
,
lels
,
succ-01
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
c
nat-basic2
/
a