[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 n2i-mult
⊦ n→i(m * n) = n→i(m) * n→i(n)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
i2n-divtwo
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
inj
,
succ-01
,
n2i-add
,
Used spec theorems:
Used simplifier rules:
nat-mult
/
zero
int-mult
/
zero-left
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-basic2
/
c
nat-basic2
/
a
nat-mult
/
rsucc-02
nat-basic2
/
succ
int-mult
/
eq-dist
int-mult
/
one
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c