let I be non empty set ; :: thesis: for J being non-Empty TopSpace-yielding ManySortedSet of
for i being Element of I
for F being Subset of (product_prebasis J) st ( for G being finite Subset of F holds not [#] (product J) c= union G ) holds
for xi being Element of (J . i)
for G being finite Subset of F st (proj J,i) " {xi} c= union G holds
ex Ai being Subset of (J . i) st
( Ai <> [#] (J . i) & xi in Ai & (proj J,i) " Ai in G & Ai is open )
let J be non-Empty TopSpace-yielding ManySortedSet of ; :: thesis: for i being Element of I
for F being Subset of (product_prebasis J) st ( for G being finite Subset of F holds not [#] (product J) c= union G ) holds
for xi being Element of (J . i)
for G being finite Subset of F st (proj J,i) " {xi} c= union G holds
ex Ai being Subset of (J . i) st
( Ai <> [#] (J . i) & xi in Ai & (proj J,i) " Ai in G & Ai is open )
let i be Element of I; :: thesis: for F being Subset of (product_prebasis J) st ( for G being finite Subset of F holds not [#] (product J) c= union G ) holds
for xi being Element of (J . i)
for G being finite Subset of F st (proj J,i) " {xi} c= union G holds
ex Ai being Subset of (J . i) st
( Ai <> [#] (J . i) & xi in Ai & (proj J,i) " Ai in G & Ai is open )
let F be Subset of (product_prebasis J); :: thesis: ( ( for G being finite Subset of F holds not [#] (product J) c= union G ) implies for xi being Element of (J . i)
for G being finite Subset of F st (proj J,i) " {xi} c= union G holds
ex Ai being Subset of (J . i) st
( Ai <> [#] (J . i) & xi in Ai & (proj J,i) " Ai in G & Ai is open ) )
assume A1:
for G being finite Subset of F holds not [#] (product J) c= union G
; :: thesis: for xi being Element of (J . i)
for G being finite Subset of F st (proj J,i) " {xi} c= union G holds
ex Ai being Subset of (J . i) st
( Ai <> [#] (J . i) & xi in Ai & (proj J,i) " Ai in G & Ai is open )
let xi be Element of (J . i); :: thesis: for G being finite Subset of F st (proj J,i) " {xi} c= union G holds
ex Ai being Subset of (J . i) st
( Ai <> [#] (J . i) & xi in Ai & (proj J,i) " Ai in G & Ai is open )
let G be finite Subset of F; :: thesis: ( (proj J,i) " {xi} c= union G implies ex Ai being Subset of (J . i) st
( Ai <> [#] (J . i) & xi in Ai & (proj J,i) " Ai in G & Ai is open ) )
assume
(proj J,i) " {xi} c= union G
; :: thesis: ex Ai being Subset of (J . i) st
( Ai <> [#] (J . i) & xi in Ai & (proj J,i) " Ai in G & Ai is open )
then consider A being set such that
A2:
A in product_prebasis J
and
A3:
A in G
and
A4:
(proj J,i) " {xi} c= A
by A1, Th21;
A <> [#] (product J)
then consider Ai being Subset of (J . i) such that
A6:
Ai <> [#] (J . i)
and
A7:
xi in Ai
and
A8:
Ai is open
and
A9:
A = (proj J,i) " Ai
by A2, A4, Th18;
take
Ai
; :: thesis: ( Ai <> [#] (J . i) & xi in Ai & (proj J,i) " Ai in G & Ai is open )
thus
Ai <> [#] (J . i)
by A6; :: thesis: ( xi in Ai & (proj J,i) " Ai in G & Ai is open )
thus
xi in Ai
by A7; :: thesis: ( (proj J,i) " Ai in G & Ai is open )
thus
(proj J,i) " Ai in G
by A3, A9; :: thesis: Ai is open
thus
Ai is open
by A8; :: thesis: verum