[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 i2n
⊦ i→n(i) * i→n(j) = i→n(i * j)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
natpos
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 11
Used lemmas:
abs-neg
,
i2np
,
Used spec theorems:
Used simplifier rules:
int-abs
/
neg-02
int-mult
/
minus-left
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
negle-07
int-basic2
/
add-zero-rev
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
zero-gels-03
int-abs
/
forward-le-01
int-abs
/
lels
int-abs
/
zero-gels-01
int-abs
/
forward-le-02
int-abs
/
forward-lsle