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