ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  toponsspwpwg Unicode version

Theorem toponsspwpwg 15123
Description: The set of topologies on a set is included in the double power set of that set. (Contributed by BJ, 29-Apr-2021.) (Revised by Jim Kingdon, 16-Jan-2023.)
Assertion
Ref Expression
toponsspwpwg  |-  ( A  e.  V  ->  (TopOn `  A )  C_  ~P ~P A )

Proof of Theorem toponsspwpwg
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 2833 . . 3  |-  ( A  e.  V  ->  A  e.  _V )
2 rabssab 3337 . . . . . 6  |-  { y  e.  Top  |  A  =  U. y }  C_  { y  |  A  = 
U. y }
3 eqcom 2240 . . . . . . 7  |-  ( A  =  U. y  <->  U. y  =  A )
43abbii 2354 . . . . . 6  |-  { y  |  A  =  U. y }  =  {
y  |  U. y  =  A }
52, 4sseqtri 3282 . . . . 5  |-  { y  e.  Top  |  A  =  U. y }  C_  { y  |  U. y  =  A }
6 pwpwssunieq 4101 . . . . 5  |-  { y  |  U. y  =  A }  C_  ~P ~P A
75, 6sstri 3257 . . . 4  |-  { y  e.  Top  |  A  =  U. y }  C_  ~P ~P A
8 pwexg 4317 . . . . 5  |-  ( A  e.  V  ->  ~P A  e.  _V )
98pwexd 4318 . . . 4  |-  ( A  e.  V  ->  ~P ~P A  e.  _V )
10 ssexg 4272 . . . 4  |-  ( ( { y  e.  Top  |  A  =  U. y }  C_  ~P ~P A  /\  ~P ~P A  e. 
_V )  ->  { y  e.  Top  |  A  =  U. y }  e.  _V )
117, 9, 10sylancr 418 . . 3  |-  ( A  e.  V  ->  { y  e.  Top  |  A  =  U. y }  e.  _V )
12 eqeq1 2245 . . . . 5  |-  ( x  =  A  ->  (
x  =  U. y  <->  A  =  U. y ) )
1312rabbidv 2810 . . . 4  |-  ( x  =  A  ->  { y  e.  Top  |  x  =  U. y }  =  { y  e. 
Top  |  A  =  U. y } )
14 df-topon 15112 . . . 4  |- TopOn  =  ( x  e.  _V  |->  { y  e.  Top  |  x  =  U. y } )
1513, 14fvmptg 5781 . . 3  |-  ( ( A  e.  _V  /\  { y  e.  Top  |  A  =  U. y }  e.  _V )  ->  (TopOn `  A )  =  { y  e.  Top  |  A  =  U. y } )
161, 11, 15syl2anc 415 . 2  |-  ( A  e.  V  ->  (TopOn `  A )  =  {
y  e.  Top  |  A  =  U. y } )
1716, 7eqsstrdi 3300 1  |-  ( A  e.  V  ->  (TopOn `  A )  C_  ~P ~P A )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209   {cab 2224   {crab 2532   _Vcvv 2821    C_ wss 3220   ~Pcpw 3688   U.cuni 3935   ` cfv 5377   Topctop 15098  TopOnctopon 15111
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-topon 15112
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator