Theorem bj-unex 16859

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

Hypotheses

Ref	Expression
bj-unex.1	⊢ 𝐴 ∈ V
bj-unex.2	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
bj-unex	⊢ (𝐴 ∪ 𝐵) ∈ V

Proof of Theorem bj-unex

Step	Hyp	Ref	Expression
1		bj-unex.1	. . 3 ⊢ 𝐴 ∈ V
2		bj-unex.2	. . 3 ⊢ 𝐵 ∈ V
3	1, 2	unipr 3944	. 2 ⊢ ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵)
4		bj-prexg 16851	. . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {𝐴, 𝐵} ∈ V)
5	1, 2, 4	mp2an 430	. . 3 ⊢ {𝐴, 𝐵} ∈ V
6	5	bj-uniex 16857	. 2 ⊢ ∪ {𝐴, 𝐵} ∈ V
7	3, 6	eqeltrri 2312	1 ⊢ (𝐴 ∪ 𝐵) ∈ V

Syntax hints:   ∈ wcel 2209  Vcvv 2821   ∪ cun 3218  {cpr 3706  ∪ cuni 3930

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-pr 4341  ax-un 4573  ax-bd0 16753  ax-bdor 16756  ax-bdex 16759  ax-bdeq 16760  ax-bdel 16761  ax-bdsep 16824

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-un 3224  df-sn 3711  df-pr 3712  df-uni 3931

This theorem is referenced by:  bdunexb  16860  bj-unexg  16861