Proving the Assertions (5)
Induction Step: Assume it is true for an
arbitrary time; show it is true the next
time (if there is a next time).
Assume the assertion is true now.
Suppose there is a next time the program gets
to that point.


In between those two times:
It was established that a[i] != v and i < a.length
then i became the value i +1.
Thus (("k < i) a[k] != v ô i < a.length) still holds!!
(("k < i) a[k] != v ô i < a.length)