[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 13 from proof multi-fieldin (
previous step
)
⊦ # refs2 = i→n(countrefs(i1 ' + ints1)) * i→n(i2) + i→n(countrefs(i1 ' + ints1)) ∧ lastn(i→n(countrefs(i1 ' + ints1)), r1 ' + refs2) = r0 ' + refs1 ∧ 0 ≤ i2 → ¬ # refs2 ≤ # refs1
Lemma
countrefs-lastn