let G be WGraph; :: thesis: for W being Walk of G holds (W .reverse()) .weightSeq() = Rev (W .weightSeq())
let W be Walk of G; :: thesis: (W .reverse()) .weightSeq() = Rev (W .weightSeq())
set W1 = (W .reverse()) .weightSeq() ;
set W2 = Rev (W .weightSeq());
len (W .reverse()) = len W by GLIB_001:21;
then (W .reverse()) .length() = W .length() by GLIB_001:113;
then len ((W .reverse()) .edgeSeq()) = W .length() by GLIB_001:def 18
.= len (W .edgeSeq()) by GLIB_001:def 18 ;
then A1: len ((W .reverse()) .weightSeq()) = len (W .edgeSeq()) by Def18;
A2: len (W .weightSeq()) = len (W .edgeSeq()) by Def18;
A3: now :: thesis: for n being Nat st 1 <= n & n <= len ((W .reverse()) .weightSeq()) holds
((W .reverse()) .weightSeq()) . n = (Rev (W .weightSeq())) . n
end;
len ((W .reverse()) .weightSeq()) = len (Rev (W .weightSeq())) by A1, A2, FINSEQ_5:def 3;
hence (W .reverse()) .weightSeq() = Rev (W .weightSeq()) by A3, FINSEQ_1:14; :: thesis: verum