:: CONNSP_2 semantic presentation

definition
let c1 be non empty TopSpace;
let c2 be Point of c1;
mode a_neighborhood of c2 -> Subset of a1 means :Def1: :: CONNSP_2:def 1
a2 in Int a3;
existence
ex b1 being Subset of c1 st c2 in Int b1
proof end;
end;

:: deftheorem Def1 defines a_neighborhood CONNSP_2:def 1 :
for b1 being non empty TopSpace
for b2 being Point of b1
for b3 being Subset of b1 holds
( b3 is a_neighborhood of b2 iff b2 in Int b3 );

definition
let c1 be TopSpace;
let c2 be Subset of c1;
mode a_neighborhood of c2 -> Subset of a1 means :Def2: :: CONNSP_2:def 2
a2 c= Int a3;
existence
ex b1 being Subset of c1 st c2 c= Int b1
proof end;
end;

:: deftheorem Def2 defines a_neighborhood CONNSP_2:def 2 :
for b1 being TopSpace
for b2, b3 being Subset of b1 holds
( b3 is a_neighborhood of b2 iff b2 c= Int b3 );

theorem Th1: :: CONNSP_2:1
canceled;

theorem Th2: :: CONNSP_2:2
canceled;

theorem Th3: :: CONNSP_2:3
for b1 being non empty TopSpace
for b2 being Point of b1
for b3, b4 being Subset of b1 st b3 is a_neighborhood of b2 & b4 is a_neighborhood of b2 holds
b3 \/ b4 is a_neighborhood of b2
proof end;

theorem Th4: :: CONNSP_2:4
for b1 being non empty TopSpace
for b2 being Point of b1
for b3, b4 being Subset of b1 holds
( ( b3 is a_neighborhood of b2 & b4 is a_neighborhood of b2 ) iff b3 /\ b4 is a_neighborhood of b2 )
proof end;

theorem Th5: :: CONNSP_2:5
for b1 being non empty TopSpace
for b2 being Subset of b1
for b3 being Point of b1 st b2 is open & b3 in b2 holds
b2 is a_neighborhood of b3
proof end;

theorem Th6: :: CONNSP_2:6
for b1 being non empty TopSpace
for b2 being Subset of b1
for b3 being Point of b1 st b2 is a_neighborhood of b3 holds
b3 in b2
proof end;

theorem Th7: :: CONNSP_2:7
for b1 being non empty TopSpace
for b2 being Point of b1
for b3 being Subset of b1 st b3 is a_neighborhood of b2 holds
ex b4 being non empty Subset of b1 st
( b4 is a_neighborhood of b2 & b4 is open & b4 c= b3 )
proof end;

theorem Th8: :: CONNSP_2:8
for b1 being non empty TopSpace
for b2 being Point of b1
for b3 being Subset of b1 holds
( b3 is a_neighborhood of b2 iff ex b4 being Subset of b1 st
( b4 is open & b4 c= b3 & b2 in b4 ) )
proof end;

theorem Th9: :: CONNSP_2:9
for b1 being non empty TopSpace
for b2 being Subset of b1 holds
( b2 is open iff for b3 being Point of b1 st b3 in b2 holds
ex b4 being Subset of b1 st
( b4 is a_neighborhood of b3 & b4 c= b2 ) )
proof end;

theorem Th10: :: CONNSP_2:10
for b1 being non empty TopSpace
for b2 being Point of b1
for b3 being Subset of b1 holds
( b3 is a_neighborhood of {b2} iff b3 is a_neighborhood of b2 )
proof end;

theorem Th11: :: CONNSP_2:11
for b1 being non empty TopSpace
for b2 being non empty Subset of b1
for b3 being Point of (b1 | b2)
for b4 being Subset of (b1 | b2)
for b5 being Subset of b1
for b6 being Point of b1 st b2 is open & b4 is a_neighborhood of b3 & b4 = b5 & b3 = b6 holds
b5 is a_neighborhood of b6
proof end;

Lemma8: for b1 being non empty TopSpace
for b2 being SubSpace of b1
for b3 being Subset of b1
for b4 being Subset of b2 st b3 = b4 holds
(Int b3) /\ ([#] b2) c= Int b4
proof end;

theorem Th12: :: CONNSP_2:12
for b1 being non empty TopSpace
for b2 being non empty Subset of b1
for b3 being Point of (b1 | b2)
for b4 being Subset of (b1 | b2)
for b5 being Subset of b1
for b6 being Point of b1 st b5 is a_neighborhood of b6 & b4 = b5 & b3 = b6 holds
b4 is a_neighborhood of b3
proof end;

theorem Th13: :: CONNSP_2:13
for b1 being non empty TopSpace
for b2, b3 being Subset of b1 st b2 is_a_component_of b1 & b2 c= b3 holds
b2 is_a_component_of b3
proof end;

theorem Th14: :: CONNSP_2:14
for b1 being non empty TopSpace
for b2 being non empty SubSpace of b1
for b3 being Point of b1
for b4 being Point of b2 st b3 = b4 holds
skl b4 c= skl b3
proof end;

definition
let c1 be non empty TopSpace;
let c2 be Point of c1;
pred c1 is_locally_connected_in c2 means :Def3: :: CONNSP_2:def 3
for b1 being Subset of a1 st b1 is a_neighborhood of a2 holds
ex b2 being Subset of a1 st
( b2 is a_neighborhood of a2 & b2 is connected & b2 c= b1 );
end;

:: deftheorem Def3 defines is_locally_connected_in CONNSP_2:def 3 :
for b1 being non empty TopSpace
for b2 being Point of b1 holds
( b1 is_locally_connected_in b2 iff for b3 being Subset of b1 st b3 is a_neighborhood of b2 holds
ex b4 being Subset of b1 st
( b4 is a_neighborhood of b2 & b4 is connected & b4 c= b3 ) );

definition
let c1 be non empty TopSpace;
attr a1 is locally_connected means :Def4: :: CONNSP_2:def 4
for b1 being Point of a1 holds a1 is_locally_connected_in b1;
end;

:: deftheorem Def4 defines locally_connected CONNSP_2:def 4 :
for b1 being non empty TopSpace holds
( b1 is locally_connected iff for b2 being Point of b1 holds b1 is_locally_connected_in b2 );

definition
let c1 be non empty TopSpace;
let c2 be Subset of c1;
let c3 be Point of c1;
pred c2 is_locally_connected_in c3 means :Def5: :: CONNSP_2:def 5
for b1 being non empty Subset of a1 st a2 = b1 holds
ex b2 being Point of (a1 | b1) st
( b2 = a3 & a1 | b1 is_locally_connected_in b2 );
end;

:: deftheorem Def5 defines is_locally_connected_in CONNSP_2:def 5 :
for b1 being non empty TopSpace
for b2 being Subset of b1
for b3 being Point of b1 holds
( b2 is_locally_connected_in b3 iff for b4 being non empty Subset of b1 st b2 = b4 holds
ex b5 being Point of (b1 | b4) st
( b5 = b3 & b1 | b4 is_locally_connected_in b5 ) );

definition
let c1 be non empty TopSpace;
let c2 be non empty Subset of c1;
attr a2 is locally_connected means :Def6: :: CONNSP_2:def 6
a1 | a2 is locally_connected;
end;

:: deftheorem Def6 defines locally_connected CONNSP_2:def 6 :
for b1 being non empty TopSpace
for b2 being non empty Subset of b1 holds
( b2 is locally_connected iff b1 | b2 is locally_connected );

theorem Th15: :: CONNSP_2:15
canceled;

theorem Th16: :: CONNSP_2:16
canceled;

theorem Th17: :: CONNSP_2:17
canceled;

theorem Th18: :: CONNSP_2:18
canceled;

theorem Th19: :: CONNSP_2:19
for b1 being non empty TopSpace
for b2 being Point of b1 holds
( b1 is_locally_connected_in b2 iff for b3, b4 being Subset of b1 st b3 is a_neighborhood of b2 & b4 is_a_component_of b3 & b2 in b4 holds
b4 is a_neighborhood of b2 )
proof end;

theorem Th20: :: CONNSP_2:20
for b1 being non empty TopSpace
for b2 being Point of b1 holds
( b1 is_locally_connected_in b2 iff for b3 being non empty Subset of b1 st b3 is open & b2 in b3 holds
ex b4 being Point of (b1 | b3) st
( b4 = b2 & b2 in Int (skl b4) ) )
proof end;

theorem Th21: :: CONNSP_2:21
for b1 being non empty TopSpace st b1 is locally_connected holds
for b2 being Subset of b1 st b2 is_a_component_of b1 holds
b2 is open
proof end;

theorem Th22: :: CONNSP_2:22
for b1 being non empty TopSpace
for b2 being Point of b1 st b1 is_locally_connected_in b2 holds
for b3 being non empty Subset of b1 st b3 is open & b2 in b3 holds
b3 is_locally_connected_in b2
proof end;

theorem Th23: :: CONNSP_2:23
for b1 being non empty TopSpace st b1 is locally_connected holds
for b2 being non empty Subset of b1 st b2 is open holds
b2 is locally_connected
proof end;

theorem Th24: :: CONNSP_2:24
for b1 being non empty TopSpace holds
( b1 is locally_connected iff for b2 being non empty Subset of b1
for b3 being Subset of b1 st b2 is open & b3 is_a_component_of b2 holds
b3 is open )
proof end;

theorem Th25: :: CONNSP_2:25
for b1 being non empty TopSpace st b1 is locally_connected holds
for b2 being non empty Subset of b1
for b3 being non empty Subset of (b1 | b2) st b3 is connected & b3 is open holds
ex b4 being Subset of b1 st
( b4 is open & b4 is connected & b3 = b2 /\ b4 )
proof end;

theorem Th26: :: CONNSP_2:26
for b1 being non empty TopSpace holds
( b1 is_T4 iff for b2, b3 being Subset of b1 st b2 <> {} & b3 <> [#] b1 & b2 c= b3 & b2 is closed & b3 is open holds
ex b4 being Subset of b1 st
( b4 is open & b2 c= b4 & Cl b4 c= b3 ) )
proof end;

theorem Th27: :: CONNSP_2:27
for b1 being non empty TopSpace st b1 is locally_connected & b1 is_T4 holds
for b2, b3 being Subset of b1 st b2 <> {} & b3 <> {} & b2 is closed & b3 is closed & b2 misses b3 & b2 is connected & b3 is connected holds
ex b4, b5 being Subset of b1 st
( b4 is connected & b5 is connected & b4 is open & b5 is open & b2 c= b4 & b3 c= b5 & b4 misses b5 )
proof end;

theorem Th28: :: CONNSP_2:28
for b1 being non empty TopSpace
for b2 being Point of b1
for b3 being Subset-Family of b1 st ( for b4 being Subset of b1 holds
( b4 in b3 iff ( b4 is open & b4 is closed & b2 in b4 ) ) ) holds
b3 <> {}
proof end;

definition
let c1 be non empty TopSpace;
let c2 be Point of c1;
func qskl c2 -> Subset of a1 means :Def7: :: CONNSP_2:def 7
ex b1 being Subset-Family of a1 st
( ( for b2 being Subset of a1 holds
( b2 in b1 iff ( b2 is open & b2 is closed & a2 in b2 ) ) ) & meet b1 = a3 );
existence
ex b1 being Subset of c1ex b2 being Subset-Family of c1 st
( ( for b3 being Subset of c1 holds
( b3 in b2 iff ( b3 is open & b3 is closed & c2 in b3 ) ) ) & meet b2 = b1 )
proof end;
uniqueness
for b1, b2 being Subset of c1 st ex b3 being Subset-Family of c1 st
( ( for b4 being Subset of c1 holds
( b4 in b3 iff ( b4 is open & b4 is closed & c2 in b4 ) ) ) & meet b3 = b1 ) & ex b3 being Subset-Family of c1 st
( ( for b4 being Subset of c1 holds
( b4 in b3 iff ( b4 is open & b4 is closed & c2 in b4 ) ) ) & meet b3 = b2 ) holds
b1 = b2
proof end;
end;

:: deftheorem Def7 defines qskl CONNSP_2:def 7 :
for b1 being non empty TopSpace
for b2 being Point of b1
for b3 being Subset of b1 holds
( b3 = qskl b2 iff ex b4 being Subset-Family of b1 st
( ( for b5 being Subset of b1 holds
( b5 in b4 iff ( b5 is open & b5 is closed & b2 in b5 ) ) ) & meet b4 = b3 ) );

theorem Th29: :: CONNSP_2:29
canceled;

theorem Th30: :: CONNSP_2:30
for b1 being non empty TopSpace
for b2 being Point of b1 holds b2 in qskl b2
proof end;

theorem Th31: :: CONNSP_2:31
for b1 being non empty TopSpace
for b2 being Point of b1
for b3 being Subset of b1 st b3 is open & b3 is closed & b2 in b3 & b3 c= qskl b2 holds
b3 = qskl b2
proof end;

theorem Th32: :: CONNSP_2:32
for b1 being non empty TopSpace
for b2 being Point of b1 holds qskl b2 is closed
proof end;

theorem Th33: :: CONNSP_2:33
for b1 being non empty TopSpace
for b2 being Point of b1 holds skl b2 c= qskl b2
proof end;