let R be Relation; 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 ; ( 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)
; ( ( 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 ( R |_2 X is well_founded implies R is_well_founded_in X )
assume A4:
R |_2 X is
connected
;
R is_connected_in Xnow for x, y being object st x in X & y in X & x <> y & not [x,y] in R holds
[y,x] in Rlet x,
y be
object ;
( 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 )
;
( [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;
verum end; hence
R is_connected_in X
by RELAT_2:def 6;
verum
end;
assume A6:
R |_2 X is well_founded
; 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 ;
( Y c= X & Y <> {} implies ex a being object st
( a in Y & R -Seg a misses Y ) )
assume A7:
(
Y c= X &
Y <> {} )
;
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
;
( a in Y & R -Seg a misses Y )
thus
a in Y
by A8;
R -Seg a misses Y
assume
R -Seg a meets Y
;
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;
verum
end;
hence
R is_well_founded_in X
by WELLORD1:def 3; verum