let X be surreal-membered set ; :: thesis: ( X is desc_ordering implies X is ==_distinct )
assume X is desc_ordering ; :: thesis: X is ==_distinct
then consider s being strictly_decreasing Surreal-Sequence such that
A1: rng s = X ;
let sa, sb be Surreal; :: according to SURREAL1:def 11 :: thesis: ( sa in X & sb in X & sa == sb implies sa = sb )
assume A2: ( sa in X & sb in X & sa == sb & sa <> sb ) ; :: thesis: contradiction
consider a being object such that
A3: ( a in dom s & s . a = sa ) by A1, A2, FUNCT_1:def 3;
consider b being object such that
A4: ( b in dom s & s . b = sb ) by A1, A2, FUNCT_1:def 3;
reconsider a = a, b = b as Ordinal by A3, A4;
( a in b or b in a ) by A2, A3, A4, ORDINAL1:14;
hence contradiction by A2, A3, A4, SURREALC:def 11; :: thesis: verum