let S be sequence of R; :: thesis: ( S is descending implies S is one-to-one )
assume A1: S is descending ; :: thesis: S is one-to-one
for x1, x2 being object st x1 in dom S & x2 in dom S & S . x1 = S . x2 holds
x1 = x2
proof
let x1, x2 be object ; :: thesis: ( x1 in dom S & x2 in dom S & S . x1 = S . x2 implies x1 = x2 )
assume A2: ( x1 in dom S & x2 in dom S & S . x1 = S . x2 & x1 <> x2 ) ; :: thesis: contradiction
reconsider x1 = x1, x2 = x2 as Nat by A2;
( x1 < x2 or x2 < x1 ) by A2, XXREAL_0:1;
hence contradiction by A2, A1, BAGORDER:8; :: thesis: verum
end;
hence S is one-to-one by FUNCT_1:def 4; :: thesis: verum