[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 getint-neg-02
⊦ mkDecimal(i, j).int < 0 ↔ i < 0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
decimal-simple-ops
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 9
Used lemmas:
getint-pos-01
,
intvalue-zero
,
intvalue-base
,
mkDecimal-rec
,
Used spec theorems:
int-div
/
mod-zero-05
Used simplifier rules:
intnat
/
labs
int-div
/
abs
int-div
/
abs-div10-le
int-abs
/
forward-le-02
int-abs
/
lels-01
int-abs
/
lenls
int-div
/
div-ngr-zero
int-abs
/
lels
int-abs
/
zero-gels-03
int-abs
/
zero-gels-01
int-abs
/
forward-le-03
int-abs
/
forward-le-04
int-abs
/
numle-03
int-div
/
div-ls-zero
int-abs
/
abs-08
int-abs
/
neg-13
int-abs
/
numls-02
int-abs
/
numlelsdel-01
int-basic2
/
add-a
int-basic2
/
add-c