let R be Relation; :: thesis: for X being set st X = field (R |_2 X) holds
( ( R |_2 X is reflexive implies R is_reflexive_in X ) & ( R |_2 X is connected implies R is_connected_in X ) & ( R |_2 X is well_founded implies R is_well_founded_in X ) )

let X be set ; :: thesis: ( X = field (R |_2 X) implies ( ( R |_2 X is reflexive implies R is_reflexive_in X ) & ( R |_2 X is connected implies R is_connected_in X ) & ( R |_2 X is well_founded implies R is_well_founded_in X ) ) )
assume A1: X = field (R |_2 X) ; :: thesis: ( ( R |_2 X is reflexive implies R is_reflexive_in X ) & ( R |_2 X is connected implies R is_connected_in X ) & ( R |_2 X is well_founded implies R is_well_founded_in X ) )
set R2 = R |_2 X;
A2: R |_2 X = R /\ [:X,X:] by WELLORD1:def 6;
hereby :: thesis: ( ( R |_2 X is connected implies R is_connected_in X ) & ( R |_2 X is well_founded implies R is_well_founded_in X ) )
assume A3: R |_2 X is reflexive ; :: thesis: R is_reflexive_in X
now :: thesis: for x being object st x in X holds
[x,x] in R
let x be object ; :: thesis: ( x in X implies [x,x] in R )
assume x in X ; :: thesis: [x,x] in R
then [x,x] in R |_2 X by A1, A3, RELAT_2:def 9, RELAT_2:def 1;
hence [x,x] in R by A2, XBOOLE_0:def 4; :: thesis: verum
end;
hence R is_reflexive_in X by RELAT_2:def 1; :: thesis: verum
end;
hereby :: thesis: ( R |_2 X is well_founded implies R is_well_founded_in X )
assume A4: R |_2 X is connected ; :: thesis: R is_connected_in X
now :: thesis: for x, y being object st x in X & y in X & x <> y & not [x,y] in R holds
[y,x] in R
let x, y be object ; :: thesis: ( x in X & y in X & x <> y & not [x,y] in R implies [y,x] in R )
assume A5: ( x in X & y in X & x <> y ) ; :: thesis: ( [x,y] in R or [y,x] in R )
( [x,y] in R |_2 X or [y,x] in R |_2 X ) by A5, A1, A4, RELAT_2:def 14, RELAT_2:def 6;
hence ( [x,y] in R or [y,x] in R ) by A2, XBOOLE_0:def 4; :: thesis: verum
end;
hence R is_connected_in X by RELAT_2:def 6; :: thesis: verum
end;
assume A6: R |_2 X is well_founded ; :: thesis: R is_well_founded_in X
for Y being set st Y c= X & Y <> {} holds
ex a being object st
( a in Y & R -Seg a misses Y )
proof
let Y be set ; :: thesis: ( Y c= X & Y <> {} implies ex a being object st
( a in Y & R -Seg a misses Y ) )

assume A7: ( Y c= X & Y <> {} ) ; :: thesis: ex a being object st
( a in Y & R -Seg a misses Y )

consider a being object such that
A8: ( a in Y & (R |_2 X) -Seg a misses Y ) by A6, A7, A1, WELLORD1:3, WELLORD1:def 3;
take a ; :: thesis: ( a in Y & R -Seg a misses Y )
thus a in Y by A8; :: thesis: R -Seg a misses Y
assume R -Seg a meets Y ; :: thesis: contradiction
then consider b being object such that
A9: ( b in R -Seg a & b in Y ) by XBOOLE_0:3;
A10: ( b <> a & [b,a] in R ) by A9, WELLORD1:1;
[b,a] in [:X,X:] by A7, A8, A9, ZFMISC_1:87;
then [b,a] in R |_2 X by A2, A10, XBOOLE_0:def 4;
then b in (R |_2 X) -Seg a by A10, WELLORD1:1;
hence contradiction by A8, A9, XBOOLE_0:3; :: thesis: verum
end;
hence R is_well_founded_in X by WELLORD1:def 3; :: thesis: verum