let R be Relation; ( R is strongly_connected iff [:(field R),(field R):] = R \/ (R ~) )
A1:
now assume
R is
strongly_connected
;
[:(field R),(field R):] = R \/ (R ~)then A2:
R is_strongly_connected_in field R
by Def15;
now let x be
set ;
( x in [:(field R),(field R):] iff x in R \/ (R ~) )A3:
now assume A4:
x in R \/ (R ~)
;
x in [:(field R),(field R):]then consider y,
z being
set such that A5:
x = [y,z]
by RELAT_1:def 1;
(
[y,z] in R or
[y,z] in R ~ )
by A4, A5, XBOOLE_0:def 3;
then
(
[y,z] in R or
[z,y] in R )
by RELAT_1:def 7;
then
(
y in field R &
z in field R )
by RELAT_1:15;
hence
x in [:(field R),(field R):]
by A5, ZFMISC_1:87;
verum end; now assume
x in [:(field R),(field R):]
;
x in R \/ (R ~)then consider y,
z being
set such that A6:
(
y in field R &
z in field R )
and A7:
x = [y,z]
by ZFMISC_1:def 2;
(
[y,z] in R or
[z,y] in R )
by A2, A6, Def7;
then
(
[y,z] in R or
[y,z] in R ~ )
by RELAT_1:def 7;
hence
x in R \/ (R ~)
by A7, XBOOLE_0:def 3;
verum end; hence
(
x in [:(field R),(field R):] iff
x in R \/ (R ~) )
by A3;
verum end; hence
[:(field R),(field R):] = R \/ (R ~)
by TARSKI:1;
verum end;
hence
( R is strongly_connected iff [:(field R),(field R):] = R \/ (R ~) )
by A1; verum