[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
⊦ ~ mkDecimal(i, j).int = mkDecimal(~ i, j).int
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
getint-neg-01
,
Used by units in proved state:
decimal-simple-ops
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 11
Used lemmas:
intvalue-base
,
intvalue-zero
,
intvalue-rec
,
Used spec theorems:
Used simplifier rules:
int-abs
/
neg-03
int-basic2
/
add-a
int-basic2
/
add-c
int-div
/
neg-01
int-abs
/
neg-10
int-div
/
mod-neg-01
int-abs
/
negeq
intnat
/
labs
int-div
/
abs
int-abs
/
lels
int-div
/
abs-div10-le