[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 less-add-cancel-l
⊦ r + r0 < r + r1 ↔ r0 < r1
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
add-in
,
ls
,
ls-02
,
lsls-add-noteq
,
lsls-add-notgr
,
lsnum-add1
,
lsnum-add4
,
lsnum-addboth1
,
lsnum-addboth2
,
lst-01
,
lst-02
,
lst-03
,
lst-04
,
lst-05
,
mone-03
,
negl-ls
,
negladd-ls
,
negradd-ls
,
neq-01
,
nls
,
not-zero-pos
,
pls
,
plst
,
plst-01
,
ttwo
,
Used by units in proved state:
real-limit
,
real-multdiv
,
real-min-max
,
real-abs
,
real-floor-ceil
,
Proof exists?: No