[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 le-posint
⊦ i > 0 → (i.r * r0 ≤ i.r * r2 ↔ r0 ≤ r2)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
square-interval
,
two-le-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
le-pos
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
gr-def
real-basic
/
ls-num
int-abs
/
lels
int-abs
/
lels-03