Theorem unexd 7755

Description: The union of two sets is a set. (Contributed by SN, 16-Jul-2024.)

Hypotheses

Ref	Expression
unexd.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
unexd.2	⊢ (𝜑 → 𝐵 ∈ 𝑊)

Assertion

Ref	Expression
unexd	⊢ (𝜑 → (𝐴 ∪ 𝐵) ∈ V)

Proof of Theorem unexd

Step	Hyp	Ref	Expression
1		unexd.1	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
2		unexd.2	. 2 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
3		unexg 7744	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ∪ 𝐵) ∈ V)
4	1, 2, 3	syl2anc 595	1 ⊢ (𝜑 → (𝐴 ∪ 𝐵) ∈ V)

Syntax hints:   → wi 4   ∈ wcel 2149  Vcvv 3463   ∪ cun 3911

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261  ax-pr 5407  ax-un 7735

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1570  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-v 3465  df-un 3918  df-ss 3930  df-sn 4595  df-pr 4597  df-uni 4877

This theorem is referenced by:  sexp2  8144  sexp3  8151  mapunen  9136  sltsun1  27949  sltsun2  27950  addsproplem2  28131  addsuniflem  28162  sltmuls1  28308  sltmuls2  28309  precsexlem11  28378  suppun2  32972  elrgspnsubrunlem1  33510  elrgspnsubrunlem2  33511  elrgspnsubrun  33512  elrspunsn  33683  ofun  42933  tfsconcatun  43993  rclexi  44270  rtrclexlem  44271  trclubgNEW  44273  cnvrcl0  44280  dfrtrcl5  44284  iunrelexp0  44357  relexpmulg  44365  relexp01min  44368  clnbgrval  48513