let S be Surreal-Sequence; :: thesis: ( S is decreasing_infinitely implies S is one-to-one )
assume A1: S is decreasing_infinitely ; :: thesis: S is one-to-one
let x1, x2 be object ; :: according to FUNCT_1:def 4 :: thesis: ( not x1 in dom S or not x2 in dom S or not S . x1 = S . x2 or 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 Ordinal by A2;
A3: ( S . x1 = S .. x1 & S . x2 = S .. x2 ) by A2, Def5;
per cases ( x1 in x2 or x2 in x1 ) by A2, ORDINAL1:14;
end;