[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 abs-ls-one-multiple
⊦ abs(r) < r0 * abs(r) ↔ 1.r < r0 ∧ 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: 0
Proof steps: 7
Used lemmas:
le-same
,
le-same-03
,
ls-same-01
,
ls-same-02
,
minus-left
,
mult-com
,
mult-ass
,
mult-zero
,
abs-ite
,
Used spec theorems:
Used simplifier rules:
real-abs
/
lels
real-basic
/
ls-num
real-basic
/
blst-01
real-basic
/
bls-01
real-abs
/
lenls
real-basic
/
neg-01
real-abs
/
lels-03
real-abs
/
negle-13
real-abs
/
sub-le-01
real-basic
/
add-zero
real-basic
/
add-assoc
real-basic
/
add-comm