let v1, v2 be Element of V; :: thesis: ( ex f being sequence of V st ( v1 = f .(len F) & f .0=0. V & ( for j being Nat for v being Element of V st j <len F & v = F .(j + 1) holds f .(j + 1)=(f . j)+ v ) ) & ex f being sequence of V st ( v2 = f .(len F) & f .0=0. V & ( for j being Nat for v being Element of V st j <len F & v = F .(j + 1) holds f .(j + 1)=(f . j)+ v ) ) implies v1 = v2 ) given f being sequence of V such that A27:
v1 = f .(len F)and A28:
f .0=0. V
and A29:
for j being Nat for v being Element of V st j <len F & v = F .(j + 1) holds f .(j + 1)=(f . j)+ v
; :: thesis: ( for f being sequence of V holds ( not v2 = f .(len F) or not f .0=0. V or ex j being Nat ex v being Element of V st ( j <len F & v = F .(j + 1) & not f .(j + 1)=(f . j)+ v ) ) or v1 = v2 ) given f9 being sequence of V such that A30:
v2 = f9 .(len F)and A31:
f9 .0=0. V
and A32:
for j being Nat for v being Element of V st j <len F & v = F .(j + 1) holds f9 .(j + 1)=(f9 . j)+ v
; :: thesis: v1 = v2 defpred S1[ Nat] means ( $1 <=len F implies f . $1 = f9 . $1 );