let f, h be BinOps of carr G; :: thesis: ( len f = len (carr G) & ( for j being Element of dom (carr G) holds f . j = the addF of (G . j) ) & len h = len (carr G) & ( for j being Element of dom (carr G) holds h . j = the addF of (G . j) ) implies f = h )
assume that
A2: len f = len (carr G) and
A3: for j being Element of dom (carr G) holds f . j = the addF of (G . j) and
A4: len h = len (carr G) and
A5: for j being Element of dom (carr G) holds h . j = the addF of (G . j) ; :: thesis: f = h
reconsider f' = f, h' = h as FinSequence ;

A6: now

let i be Nat; :: thesis: ( i in dom f' implies f' . i = h' . i )
assume i in dom f' ; :: thesis: f' . i = h' . i
then reconsider i' = i as Element of dom (carr G) by A2, FINSEQ_3:31;
f' . i = the addF of (G . i') by A3;
hence f' . i = h' . i by A5; :: thesis: verum

end;

( dom f' = Seg (len f') & dom h' = Seg (len h') ) by FINSEQ_1:def 3;
hence f = h by A2, A4, A6, FINSEQ_1:17; :: thesis: verum