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

Theorem bj-uniex 14809
Description: uniex 4439 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 3820 . . 3  |-  ( x  =  A  ->  U. x  =  U. A )
32eleq1d 2246 . 2  |-  ( x  =  A  ->  ( U. x  e.  _V  <->  U. A  e.  _V )
)
4 bj-uniex2 14808 . . 3  |-  E. y 
y  =  U. x
54issetri 2748 . 2  |-  U. x  e.  _V
61, 3, 5vtocl 2793 1  |-  U. A  e.  _V
Colors of variables: wff set class
Syntax hints:    = wceq 1353    e. wcel 2148   _Vcvv 2739   U.cuni 3811
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-un 4435  ax-bd0 14705  ax-bdex 14711  ax-bdel 14713  ax-bdsb 14714  ax-bdsep 14776
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-rex 2461  df-v 2741  df-uni 3812  df-bdc 14733
This theorem is referenced by:  bj-uniexg  14810  bj-unex  14811
  Copyright terms: Public domain W3C validator