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

Theorem bj-uniex 10708
Description: uniex 4192 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
Hypothesis
Ref Expression
bj-uniex.1  |-  A  e. 
_V
Assertion
Ref Expression
bj-uniex  |-  U. A  e.  _V

Proof of Theorem bj-uniex
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 bj-uniex.1 . 2  |-  A  e. 
_V
2 unieq 3610 . . 3  |-  ( x  =  A  ->  U. x  =  U. A )
32eleq1d 2147 . 2  |-  ( x  =  A  ->  ( U. x  e.  _V  <->  U. A  e.  _V )
)
4 bj-uniex2 10707 . . 3  |-  E. y 
y  =  U. x
54issetri 2608 . 2  |-  U. x  e.  _V
61, 3, 5vtocl 2653 1  |-  U. A  e.  _V
Colors of variables: wff set class
Syntax hints:    = wceq 1284    e. wcel 1433   _Vcvv 2601   U.cuni 3601
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-un 4188  ax-bd0 10604  ax-bdex 10610  ax-bdel 10612  ax-bdsb 10613  ax-bdsep 10675
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-rex 2354  df-v 2603  df-uni 3602  df-bdc 10632
This theorem is referenced by:  bj-uniexg  10709  bj-unex  10710
  Copyright terms: Public domain W3C validator