[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
,
Proof step 5 from proof multi-in-other (
previous step
)
⊦ 0 ≤ i2 → i→n(1 + (i2 + 1) * countrefs(ints)) = 1 + i→n(i2 + 1) * i→n(countrefs(ints))
Lemma
countrefs-i2n