[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 countrefs-i2n-01
⊦ 0 ≤ i → i→n(1 + countrefs(ints) * i) = 1 + i→n(countrefs(ints)) * i→n(i)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
addarrays-at-other
,
countrefs-i2n-02
,
multi-at-other
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
countrefs-not-zero
,
Used spec theorems:
intnat
/
add-01
intnat
/
i2n-mult
Used simplifier rules:
int-basic1
/
ls-01
int-abs
/
forward-le-05
int-abs
/
lels-02
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-mult
/
ax-03
int-mult
/
Mult-zero
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq-01
int-abs
/
forward-le-01
int-mult
/
zero-ge-02
int-abs
/
lels-01
int-mult
/
associativity
int-mult
/
commutativity