[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 negint-ls-ceil
⊦ 0 < i + ⌈r⌉ ↔ 0.r < i.r + r
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: 1
Proof steps: 2
Used lemmas:
floor-ls-int
,
ceil-is-neg-floor-neg
,
int-ls-ceil
,
Used spec theorems:
Used simplifier rules:
int-abs
/
neg-01
int-abs
/
neg-15
int-abs
/
sub-ls-01
int-basic2
/
add-zero-rev
int-basic2
/
add-a
int-basic2
/
add-c
real-basic
/
negl-ls