[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-pos
⊦ 0 < mkDecimal(i, j).int ↔ 0 < i
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
getint-pos-01
,
Used by units in proved state:
decimal-simple-ops
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 7
Used lemmas:
intvalue-base
,
intvalue-zero
,
intvalue-rec
,
Used spec theorems:
Used simplifier rules:
int-basic1
/
lst-01
int-div
/
div-zero-ngr
int-abs
/
lels
int-div
/
div-lezero
int-div
/
mod-zero-08
intnat
/
labs
int-div
/
abs
int-div
/
abs-div10-le