let G1, G2 be WGraph; :: thesis: for W1 being Walk of G1
for W2 being Walk of G2 st W1 = W2 & the_Weight_of G1 = the_Weight_of G2 holds
W1 .weightSeq() = W2 .weightSeq()
let W1 be Walk of G1; :: thesis: for W2 being Walk of G2 st W1 = W2 & the_Weight_of G1 = the_Weight_of G2 holds
W1 .weightSeq() = W2 .weightSeq()
let W2 be Walk of G2; :: thesis: ( W1 = W2 & the_Weight_of G1 = the_Weight_of G2 implies W1 .weightSeq() = W2 .weightSeq() )
assume that
A1: W1 = W2 and
A2: the_Weight_of G1 = the_Weight_of G2 ; :: thesis: W1 .weightSeq() = W2 .weightSeq()
set WS1 = W1 .weightSeq() ;
set WS2 = W2 .weightSeq() ;
A3: W1 .edgeSeq() = W2 .edgeSeq() by A1, GLIB_001:86;

now :: thesis: ( len (W1 .weightSeq()) = len (W1 .weightSeq()) & len (W2 .weightSeq()) = len (W1 .weightSeq()) & ( for x being Nat st x in dom (W1 .weightSeq()) holds
(W2 .weightSeq()) . x = (W1 .weightSeq()) . x ) )

thus len (W1 .weightSeq()) = len (W1 .weightSeq()) ; :: thesis: ( len (W2 .weightSeq()) = len (W1 .weightSeq()) & ( for x being Nat st x in dom (W1 .weightSeq()) holds
(W2 .weightSeq()) . x = (W1 .weightSeq()) . x ) )
thus A4: len (W2 .weightSeq()) = len (W1 .edgeSeq()) by A3, Def18
.= len (W1 .weightSeq()) by Def18 ; :: thesis: for x being Nat st x in dom (W1 .weightSeq()) holds
(W2 .weightSeq()) . x = (W1 .weightSeq()) . x
let x be Nat; :: thesis: ( x in dom (W1 .weightSeq()) implies (W2 .weightSeq()) . x = (W1 .weightSeq()) . x )
assume A5: x in dom (W1 .weightSeq()) ; :: thesis: (W2 .weightSeq()) . x = (W1 .weightSeq()) . x
then A6: 1 <= x by FINSEQ_3:25;
A7: x <= len (W1 .weightSeq()) by A5, FINSEQ_3:25;
x <= len (W2 .weightSeq()) by A4, A5, FINSEQ_3:25;
hence (W2 .weightSeq()) . x = (the_Weight_of G2) . ((W2 .edgeSeq()) . x) by A6, Def18
.= (the_Weight_of G1) . ((W1 .edgeSeq()) . x) by A1, A2, GLIB_001:86
.= (W1 .weightSeq()) . x by A6, A7, Def18 ;
:: thesis: verum

end;

hence W1 .weightSeq() = W2 .weightSeq() by FINSEQ_2:9; :: thesis: verum