[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 two-loup-04
⊦ m < n ∧ m + 1 ≠ n → ¬ n < (m + n) / 2 - 1
Type: A user defined theorem
Validity: The proof is valid.
Features: simp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 8
Used lemmas:
div-elim
,
zero-01
,
le-div-to-mult
,
Used spec theorems:
nat
/
pls
Used simplifier rules:
nat
/
ls
nat-basic2
/
nls-fst
nat-basic1
/
one-01
nat-basic1
/
zero
nat-basic1
/
one
nat-basic1
/
lf-01
nat-basic2
/
twols
nat
/
lels-01
nat-basic2
/
succ-03
nat
/
elim-pred-c
nat-basic2
/
succ
nat-basic1
/
trans-1
nat-basic1
/
lf
nat-basic2
/
l-08
nat
/
l-num-02
nat-basic2
/
oz
nat-mult
/
rsucc-02
nat-basic1
/
f
nat-basic1
/
lf-02
nat-mult
/
zero-06
nat-basic2
/
l-02
nat
/
lels
nat-mult
/
two-02
nat-basic2
/
a
nat-basic2
/
c
nat-basic2
/
l
nat-mult
/
two-ls-01
nat-basic1
/
ls-02
nat-mult
/
mult-a
nat-mult
/
mult-c