reserve x,y for set,
  n,m for Nat,
  r,s for Real;

theorem
  for R1,R2 be non-increasing real-valued FinSequence st
  R1,R2 are_fiberwise_equipotent holds R1 = R2
proof
  let g1,g2 be non-increasing real-valued FinSequence;
A1: len g1 = len g1;
  assume g1,g2 are_fiberwise_equipotent;
  hence thesis by A1,Lm7;
end;
