[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 invmult-le-pos-add
0.r < r ⊦ r.^-1 * r1 + r2 ≤ r0 ↔ r1 + r2 * r ≤ r * 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: 4
Proof steps: 5
Used lemmas:
invmult-gr-pos-add
,
mult-com
,
mult-ass
,
minus-left
,
distr
,
invmult-le-pos
,
Used spec theorems:
real-abs
/
sub-le-01
Used simplifier rules:
real-abs
/
sub-le-01
real-abs
/
le-def
real-abs
/
lels
real-abs
/
lels-03
real-abs
/
lenls
real-basic
/
add-assoc
real-basic
/
add-comm