[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 mkDecimal-reduce-int
⊦ mkDecimal(i, j).int = i / 10 ^ min(maxScale(i), abs(j))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 19
Used lemmas:
maxScale-not-negt
,
maxScale-rec
,
maxScale-base
,
maxScale-zero
,
maxScale-min
,
intvalue-base
,
intvalue-rec
,
Used spec theorems:
int-div
/
div-div
int-min
/
Min-left
int-pot
/
succ
int-min
/
Min-right
Used simplifier rules:
int-min
/
min-abs-zero
int-div
/
one
intnat
/
labs
int-div
/
abs
int-div
/
abs-div10-le
int-abs
/
abs-abs
int-abs
/
forward-le-02
int-basic2
/
lst-03
int-min
/
Min-right
int-abs
/
abs-10
int-abs
/
forward-le-01
int-pot
/
pot-zero-01
int-mult
/
commutativity
int-abs
/
Sub-def
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
sub-le-01
int-abs
/
leone
int-abs
/
abs-06
int-abs
/
sub-ls-01
int-abs
/
lels
int-min
/
min-right
int-min
/
min-a
int-min
/
min-c
int-min
/
Min-left