[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-divtwo
⊦ i→n(2 * i) / 2 = i→n(i)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 11
Used lemmas:
n2n
,
abs-neg
,
n2i-mult
,
n2i-add
,
num-i2n-eq-01
,
num-i2n-eq
,
Used spec theorems:
nat-basic1
/
twols-01
Used simplifier rules:
nat-div
/
div-elim
nat-basic1
/
f
int-abs
/
forward-le-02
int-abs
/
lels-01
int-abs
/
lels
int-abs
/
lels-03
int-abs
/
zero-gels-01
int-mult
/
zero-ls
int-mult
/
dist-rmerge
int-abs
/
numadd-01
int-mult
/
eq-one-neg
int-mult
/
two-zero
int-abs
/
negeq
int-abs
/
neg-03
int-abs
/
forward-le-01
int-mult
/
zero-ge
nat-basic2
/
c
nat-basic2
/
a
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-basic1
/
twols-01
int-basic2
/
add-zero
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
eq-pos
int-mult
/
associativity
int-mult
/
commutativity
int-mult
/
odd-even