Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bj-uniexg Unicode version

Theorem bj-uniexg 16927
Description: uniexg 4583 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
Assertion
Ref Expression
bj-uniexg  |-  ( A  e.  V  ->  U. A  e.  _V )

Proof of Theorem bj-uniexg
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 unieq 3942 . . 3  |-  ( x  =  A  ->  U. x  =  U. A )
21eleq1d 2307 . 2  |-  ( x  =  A  ->  ( U. x  e.  _V  <->  U. A  e.  _V )
)
3 vex 2824 . . 3  |-  x  e. 
_V
43bj-uniex 16926 . 2  |-  U. x  e.  _V
52, 4vtoclg 2883 1  |-  ( A  e.  V  ->  U. A  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1402    e. wcel 2209   _Vcvv 2821   U.cuni 3933
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-un 4576  ax-bd0 16822  ax-bdex 16828  ax-bdel 16830  ax-bdsep 16893
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rex 2534  df-v 2823  df-uni 3934
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator