let FT be non empty RelStr ; for A being non empty Subset of FT holds
( A is connected iff FT | A is connected )
let A be non empty Subset of FT; ( A is connected iff FT | A is connected )
A1:
[#] (FT | A) = A
by Def3;
thus
( A is connected implies FT | A is connected )
( FT | A is connected implies A is connected )
assume
FT | A is connected
; A is connected
then A5:
[#] (FT | A) is connected
by Def1;
let B, C be Subset of FT; FIN_TOPO:def 18 ( not A = B \/ C or B = {} or C = {} or not B misses C or not B ^b misses C )
assume that
A6:
A = B \/ C
and
A7:
( B <> {} & C <> {} & B misses C )
; not B ^b misses C
A8:
[#] (FT | A) = A
by Def3;
then reconsider B2 = B as Subset of (FT | A) by A6, XBOOLE_1:7;
reconsider C2 = C as Subset of (FT | A) by A6, A8, XBOOLE_1:7;
( ([#] (FT | A)) /\ C2 = C2 & B2 ^b = (B ^b ) /\ ([#] (FT | A)) )
by Th13, XBOOLE_1:28;
then A9:
(B ^b ) /\ C = (B2 ^b ) /\ C2
by XBOOLE_1:16;
B2 ^b meets C2
by A5, A6, A7, A8, FIN_TOPO:def 18;
hence
(B ^b ) /\ C <> {}
by A9, XBOOLE_0:def 7; XBOOLE_0:def 7 verum