[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-zero-01a
⊦ 0.r ≤ r → ¬ (r + 1.r) * (r + 1.r + 1.r) ≤ 0.r
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
mult-com
,
mult-ass
,
zero-ls-02
,
mult-zero
,
num-distr-addboth-ls1
,
distr
,
mult-one
,
square-ls-02
,
Used spec theorems:
Used simplifier rules:
real-basic
/
less-add-cancel-l
real-basic
/
ls-02
real-abs
/
lep-01
real-abs
/
le-def
real-abs
/
forward-lsle
real-basic
/
ls-num
real-abs
/
forward-lels
real-abs
/
forward-lele
real-basic
/
eqint-add
int-basic2
/
add-a
int-basic2
/
add-c
real-basic
/
ls
real-abs
/
lenls
real-basic
/
add-assoc
real-basic
/
add-comm