[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 absa
⊦ r ≤ 0.r ∧ r0 ≤ 0.r → abs(r + r0) = abs(r) + abs(r0)
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: 5
Used lemmas:
abs-02
,
Abs-pos
,
abseq
,
Abs-neg
,
le-def
,
Used spec theorems:
Used simplifier rules:
real-basic
/
lf-08
real-basic
/
ls
real-basic
/
blst-02
real-basic
/
eqint-add
int-basic2
/
add-a
int-basic2
/
add-c
real-basic
/
add-assoc
real-basic
/
add-comm
real-basic
/
eqint-num
real-basic
/
negeq
real-basic
/
sub-eq
real-basic
/
neg-add
real-basic
/
lf-02
real-basic
/
add-zero
real-basic
/
sub-eq-01