[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 two-le
⊦ 2.r * r + r0 ≤ 2.r * (r + r1) ↔ r0 ≤ 2.r * r1
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: 2
Used lemmas:
mult-com
,
mult-ass
,
mult-zero
,
num-distr-addboth-le1
,
distr
,
Used spec theorems:
Used simplifier rules:
real-basic
/
add-comm
real-basic
/
add-assoc
real-basic
/
add-zero