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

Theorem topnvalg 13582
Description: Value of the topology extractor function. (Contributed by Mario Carneiro, 13-Aug-2015.) (Revised by Jim Kingdon, 11-Feb-2023.)
Hypotheses
Ref Expression
topnval.1  |-  B  =  ( Base `  W
)
topnval.2  |-  J  =  (TopSet `  W )
Assertion
Ref Expression
topnvalg  |-  ( W  e.  V  ->  ( Jt  B )  =  (
TopOpen `  W ) )

Proof of Theorem topnvalg
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 elex 2833 . . 3  |-  ( W  e.  V  ->  W  e.  _V )
2 restfn 13574 . . . 4  |-t  Fn  ( _V  X.  _V )
3 topnval.2 . . . . 5  |-  J  =  (TopSet `  W )
4 tsetslid 13519 . . . . . 6  |-  (TopSet  = Slot  (TopSet `  ndx )  /\  (TopSet `  ndx )  e.  NN )
54slotex 13357 . . . . 5  |-  ( W  e.  V  ->  (TopSet `  W )  e.  _V )
63, 5eqeltrid 2325 . . . 4  |-  ( W  e.  V  ->  J  e.  _V )
7 topnval.1 . . . . 5  |-  B  =  ( Base `  W
)
8 baseslid 13388 . . . . . 6  |-  ( Base 
= Slot  ( Base `  ndx )  /\  ( Base `  ndx )  e.  NN )
98slotex 13357 . . . . 5  |-  ( W  e.  V  ->  ( Base `  W )  e. 
_V )
107, 9eqeltrid 2325 . . . 4  |-  ( W  e.  V  ->  B  e.  _V )
11 fnovex 6108 . . . 4  |-  ( (t  Fn  ( _V  X.  _V )  /\  J  e.  _V  /\  B  e.  _V )  ->  ( Jt  B )  e.  _V )
122, 6, 10, 11mp3an2i 1383 . . 3  |-  ( W  e.  V  ->  ( Jt  B )  e.  _V )
13 fveq2 5690 . . . . . 6  |-  ( w  =  W  ->  (TopSet `  w )  =  (TopSet `  W ) )
1413, 3eqtr4di 2289 . . . . 5  |-  ( w  =  W  ->  (TopSet `  w )  =  J )
15 fveq2 5690 . . . . . 6  |-  ( w  =  W  ->  ( Base `  w )  =  ( Base `  W
) )
1615, 7eqtr4di 2289 . . . . 5  |-  ( w  =  W  ->  ( Base `  w )  =  B )
1714, 16oveq12d 6093 . . . 4  |-  ( w  =  W  ->  (
(TopSet `  w )t  ( Base `  w ) )  =  ( Jt  B ) )
18 df-topn 13573 . . . 4  |-  TopOpen  =  ( w  e.  _V  |->  ( (TopSet `  w )t  ( Base `  w ) ) )
1917, 18fvmptg 5775 . . 3  |-  ( ( W  e.  _V  /\  ( Jt  B )  e.  _V )  ->  ( TopOpen `  W
)  =  ( Jt  B ) )
201, 12, 19syl2anc 415 . 2  |-  ( W  e.  V  ->  ( TopOpen
`  W )  =  ( Jt  B ) )
2120eqcomd 2244 1  |-  ( W  e.  V  ->  ( Jt  B )  =  (
TopOpen `  W ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1402    e. wcel 2209   _Vcvv 2821    X. cxp 4767    Fn wfn 5367   ` cfv 5372  (class class class)co 6075   Basecbs 13330  TopSetcts 13414   ↾t crest 13570   TopOpenctopn 13571
This theorem was proved from 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-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-cnex 8260  ax-resscn 8261  ax-1re 8263  ax-addrcl 8266
This theorem 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-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-inn 9284  df-2 9342  df-3 9343  df-4 9344  df-5 9345  df-6 9346  df-7 9347  df-8 9348  df-9 9349  df-ndx 13333  df-slot 13334  df-base 13336  df-tset 13427  df-rest 13572  df-topn 13573
This theorem is referenced by:  topnidg  13583  topnpropgd  13584  mgptopng  14203
  Copyright terms: Public domain W3C validator