[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 add-def-any
⊦ mkDecimal(i, j) + mkDecimal(i0, j0) = mkDecimal(i * 10 ^ abs(j0) + i0 * 10 ^ abs(j), abs(j) + abs(j0))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
add-a
,
add-same
,
ls-add
,
ls-add-01
,
mult-dist
,
sub-add
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 22
Proof steps: 38
Used lemmas:
add-c
,
add-zero-01
,
add-def
,
Used spec theorems:
decimal
/
intvalue-base
decimal
/
scale-base
int-div
/
modex
int-pot
/
Pot-pos
decimal
/
mkDecimal-rec
decimal
/
mkDecimal-enlarge
Used simplifier rules:
int-abs
/
sub-pred
int-mult
/
eq-dist
int-abs
/
abs-add-zero
int-abs
/
abs-abs-01
int-mult
/
one
int-div
/
div-mult-num
int-div
/
mod-zero-num
int-abs
/
abs-abs
int-basic2
/
add-zero
int-mult
/
Mult-zero
nat-basic2
/
c
nat-basic2
/
a
int-mult
/
le-same-04
int-abs
/
lels
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
abs-eqall
intnat
/
labs
nat-basic2
/
l
int-abs
/
sub-add-01
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
sub-le-01
int-abs
/
leone
int-abs
/
abs-06