
theorem
  for G being WGraph, W being Walk of G holds len W.weightSeq() = W .length()
proof
  let G be WGraph, W be Walk of G;
  thus len W.weightSeq() = len W.edgeSeq() by Def18
    .= W.length() by GLIB_001:def 18;
end;
