[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 square-ls-04
⊦ 1.r ≤ r → ¬ r * (r + 1.r) < 2.r
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
square-ls-04a
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
square-ge-one
,
two-def
,
mult-com
,
mult-ass
,
mult-one
,
distr
,
Used spec theorems:
real-abs
/
lele-add-notgr
Used simplifier rules:
real-basic
/
add-comm
real-basic
/
add-assoc
real-basic
/
eqint-add
int-basic2
/
add-a
int-basic2
/
add-c