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

Theorem topnvalg 13333
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 2814 . . 3  |-  ( W  e.  V  ->  W  e.  _V )
2 restfn 13325 . . . 4  |-t  Fn  ( _V  X.  _V )
3 topnval.2 . . . . 5  |-  J  =  (TopSet `  W )
4 tsetslid 13270 . . . . . 6  |-  (TopSet  = Slot  (TopSet `  ndx )  /\  (TopSet `  ndx )  e.  NN )
54slotex 13108 . . . . 5  |-  ( W  e.  V  ->  (TopSet `  W )  e.  _V )
63, 5eqeltrid 2318 . . . 4  |-  ( W  e.  V  ->  J  e.  _V )
7 topnval.1 . . . . 5  |-  B  =  ( Base `  W
)
8 baseslid 13139 . . . . . 6  |-  ( Base 
= Slot  ( Base `  ndx )  /\  ( Base `  ndx )  e.  NN )
98slotex 13108 . . . . 5  |-  ( W  e.  V  ->  ( Base `  W )  e. 
_V )
107, 9eqeltrid 2318 . . . 4  |-  ( W  e.  V  ->  B  e.  _V )
11 fnovex 6050 . . . 4  |-  ( (t  Fn  ( _V  X.  _V )  /\  J  e.  _V  /\  B  e.  _V )  ->  ( Jt  B )  e.  _V )
122, 6, 10, 11mp3an2i 1378 . . 3  |-  ( W  e.  V  ->  ( Jt  B )  e.  _V )
13 fveq2 5639 . . . . . 6  |-  ( w  =  W  ->  (TopSet `  w )  =  (TopSet `  W ) )
1413, 3eqtr4di 2282 . . . . 5  |-  ( w  =  W  ->  (TopSet `  w )  =  J )
15 fveq2 5639 . . . . . 6  |-  ( w  =  W  ->  ( Base `  w )  =  ( Base `  W
) )
1615, 7eqtr4di 2282 . . . . 5  |-  ( w  =  W  ->  ( Base `  w )  =  B )
1714, 16oveq12d 6035 . . . 4  |-  ( w  =  W  ->  (
(TopSet `  w )t  ( Base `  w ) )  =  ( Jt  B ) )
18 df-topn 13324 . . . 4  |-  TopOpen  =  ( w  e.  _V  |->  ( (TopSet `  w )t  ( Base `  w ) ) )
1917, 18fvmptg 5722 . . 3  |-  ( ( W  e.  _V  /\  ( Jt  B )  e.  _V )  ->  ( TopOpen `  W
)  =  ( Jt  B ) )
201, 12, 19syl2anc 411 . 2  |-  ( W  e.  V  ->  ( TopOpen
`  W )  =  ( Jt  B ) )
2120eqcomd 2237 1  |-  ( W  e.  V  ->  ( Jt  B )  =  (
TopOpen `  W ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1397    e. wcel 2202   _Vcvv 2802    X. cxp 4723    Fn wfn 5321   ` cfv 5326  (class class class)co 6017   Basecbs 13081  TopSetcts 13165   ↾t crest 13321   TopOpenctopn 13322
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-cnex 8122  ax-resscn 8123  ax-1re 8125  ax-addrcl 8128
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-inn 9143  df-2 9201  df-3 9202  df-4 9203  df-5 9204  df-6 9205  df-7 9206  df-8 9207  df-9 9208  df-ndx 13084  df-slot 13085  df-base 13087  df-tset 13178  df-rest 13323  df-topn 13324
This theorem is referenced by:  topnidg  13334  topnpropgd  13335  mgptopng  13941
  Copyright terms: Public domain W3C validator