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

Theorem metuex 14540
Description: Applying metUnif yields a set. (Contributed by Jim Kingdon, 28-Sep-2025.)
Assertion
Ref Expression
metuex  |-  ( A  e.  V  ->  (metUnif `  A )  e.  _V )

Proof of Theorem metuex
Dummy variables  d  a  x  w  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-fg 14534 . . . 4  |-  filGen  =  ( w  e.  _V ,  x  e.  ( fBas `  w )  |->  { y  e.  ~P w  |  ( x  i^i  ~P y )  =/=  (/) } )
2 vpwex 4264 . . . . 5  |-  ~P w  e.  _V
32rabex 4229 . . . 4  |-  { y  e.  ~P w  |  ( x  i^i  ~P y )  =/=  (/) }  e.  _V
4 vex 2802 . . . . . . 7  |-  d  e. 
_V
54dmex 4994 . . . . . 6  |-  dom  d  e.  _V
65dmex 4994 . . . . 5  |-  dom  dom  d  e.  _V
76, 6xpex 4837 . . . 4  |-  ( dom 
dom  d  X.  dom  dom  d )  e.  _V
8 reex 8149 . . . . . . 7  |-  RR  e.  _V
9 rpssre 9877 . . . . . . 7  |-  RR+  C_  RR
108, 9ssexi 4222 . . . . . 6  |-  RR+  e.  _V
1110mptex 5872 . . . . 5  |-  ( a  e.  RR+  |->  ( `' d " ( 0 [,) a ) ) )  e.  _V
1211rnex 4995 . . . 4  |-  ran  (
a  e.  RR+  |->  ( `' d " ( 0 [,) a ) ) )  e.  _V
131, 3, 7, 12mpofvexi 6363 . . 3  |-  ( ( dom  dom  d  X.  dom  dom  d ) filGen ran  ( a  e.  RR+  |->  ( `' d " (
0 [,) a ) ) ) )  e. 
_V
1413ax-gen 1495 . 2  |-  A. d
( ( dom  dom  d  X.  dom  dom  d
) filGen ran  ( a  e.  RR+  |->  ( `' d
" ( 0 [,) a ) ) ) )  e.  _V
15 df-metu 14535 . . 3  |- metUnif  =  ( d  e.  U. ran PsMet  |->  ( ( dom  dom  d  X.  dom  dom  d
) filGen ran  ( a  e.  RR+  |->  ( `' d
" ( 0 [,) a ) ) ) ) )
1615mptfvex 5725 . 2  |-  ( ( A. d ( ( dom  dom  d  X.  dom  dom  d ) filGen ran  ( a  e.  RR+  |->  ( `' d " (
0 [,) a ) ) ) )  e. 
_V  /\  A  e.  V )  ->  (metUnif `  A )  e.  _V )
1714, 16mpan 424 1  |-  ( A  e.  V  ->  (metUnif `  A )  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1393    e. wcel 2200    =/= wne 2400   {crab 2512   _Vcvv 2799    i^i cin 3196   (/)c0 3491   ~Pcpw 3649   U.cuni 3888    |-> cmpt 4145    X. cxp 4718   `'ccnv 4719   dom cdm 4720   ran crn 4721   "cima 4723   ` cfv 5321  (class class class)co 6010   RRcr 8014   0cc0 8015   RR+crp 9866   [,)cico 10103  PsMetcpsmet 14520   fBascfbas 14524   filGencfg 14525  metUnifcmetu 14527
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4259  ax-pr 4294  ax-un 4525  ax-cnex 8106  ax-resscn 8107
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4385  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-ima 4733  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-f1 5326  df-fo 5327  df-f1o 5328  df-fv 5329  df-ov 6013  df-oprab 6014  df-mpo 6015  df-1st 6295  df-2nd 6296  df-rp 9867  df-fg 14534  df-metu 14535
This theorem is referenced by:  cnfldstr  14543
  Copyright terms: Public domain W3C validator