Theorem bj-uniexg 16534

Description: uniexg 4536 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.

Step	Hyp	Ref	Expression
1		unieq 3902	. . 3 |- ( x = A -> U. x = U. A )
2	1	eleq1d 2300	. 2 |- ( x = A -> ( U. x e. _V <-> U. A e. _V ) )
3		vex 2805	. . 3 |- x e. _V
4	3	bj-uniex 16533	. 2 |- U. x e. _V
5	2, 4	vtoclg 2864	1 |- ( A e. V -> U. A e. _V )

Syntax hints:   -> wi 4   = wceq 1397   e. wcel 2202   _Vcvv 2802   U.cuni 3893

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-un 4530  ax-bd0 16429  ax-bdex 16435  ax-bdel 16437  ax-bdsb 16438  ax-bdsep 16500

This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-rex 2516  df-v 2804  df-uni 3894  df-bdc 16457

This theorem is referenced by: (None)