Theorem bj-uniexg 16737

Description: uniexg 4562 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-uniexg	⊢ (𝐴 ∈ 𝑉 → ∪ 𝐴 ∈ V)

Proof of Theorem bj-uniexg

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		unieq 3925	. . 3 ⊢ (𝑥 = 𝐴 → ∪ 𝑥 = ∪ 𝐴)
2	1	eleq1d 2303	. 2 ⊢ (𝑥 = 𝐴 → (∪ 𝑥 ∈ V ↔ ∪ 𝐴 ∈ V))
3		vex 2818	. . 3 ⊢ 𝑥 ∈ V
4	3	bj-uniex 16736	. 2 ⊢ ∪ 𝑥 ∈ V
5	2, 4	vtoclg 2877	1 ⊢ (𝐴 ∈ 𝑉 → ∪ 𝐴 ∈ V)

Syntax hints:   → wi 4   = wceq 1398   ∈ wcel 2205  Vcvv 2815  ∪ cuni 3916

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-un 4556  ax-bd0 16632  ax-bdex 16638  ax-bdel 16640  ax-bdsb 16641  ax-bdsep 16703

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-rex 2528  df-v 2817  df-uni 3917  df-bdc 16660

This theorem is referenced by: (None)