let S be surreal-membered ==_distinct set ; for A being Subset of (RevSurrStr S) st A is well_founded holds
A is well-ordering
set R = RevSurrStr S;
set I = the InternalRel of (RevSurrStr S);
let A be Subset of (RevSurrStr S); ( A is well_founded implies A is well-ordering )
assume A1:
A is well_founded
; A is well-ordering
A2:
field the InternalRel of (RevSurrStr S) = S
by Th41;
A3:
the carrier of (RevSurrStr S) = S
by Def10;
the InternalRel of (RevSurrStr S) is_connected_in S
proof
let x,
y be
object ;
RELAT_2:def 6 ( not x in S or not y in S or x = y or [x,y] in the InternalRel of (RevSurrStr S) or [y,x] in the InternalRel of (RevSurrStr S) )
assume A4:
(
x in S &
y in S &
x <> y )
;
( [x,y] in the InternalRel of (RevSurrStr S) or [y,x] in the InternalRel of (RevSurrStr S) )
reconsider a =
x,
b =
y as
Surreal by A4, SURREAL0:def 16;
(
a <= b or
b <= a )
;
hence
(
[x,y] in the
InternalRel of
(RevSurrStr S) or
[y,x] in the
InternalRel of
(RevSurrStr S) )
by A4, Def10;
verum
end;
then
( the InternalRel of (RevSurrStr S) is_reflexive_in A & the InternalRel of (RevSurrStr S) is_transitive_in A & the InternalRel of (RevSurrStr S) is_antisymmetric_in A & the InternalRel of (RevSurrStr S) is_connected_in A )
by A3, ORDERS_1:8, ORDERS_1:9, ORDERS_1:10, ORDERS_1:76, A2, RELAT_2:def 9, RELAT_2:def 12, RELAT_2:def 16;
hence
A is well-ordering
by A1, WELLFND1:def 3, WELLORD1:def 5; verum