ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  unexd Unicode version

Theorem unexd 4858
Description: The union of two sets is a set. (Contributed by SN, 16-Jul-2024.)
Hypotheses
Ref Expression
unexd.1  |-  ( ph  ->  A  e.  V )
unexd.2  |-  ( ph  ->  B  e.  W )
Assertion
Ref Expression
unexd  |-  ( ph  ->  ( A  u.  B
)  e.  _V )

Proof of Theorem unexd
StepHypRef Expression
1 unexd.1 . 2  |-  ( ph  ->  A  e.  V )
2 unexd.2 . 2  |-  ( ph  ->  B  e.  W )
3 unexg 4555 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A  u.  B
)  e.  _V )
41, 2, 3syl2anc 411 1  |-  ( ph  ->  ( A  u.  B
)  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 2203   _Vcvv 2812    u. cun 3208
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 2205  ax-14 2206  ax-ext 2214  ax-sep 4221  ax-pr 4314  ax-un 4545
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-rex 2526  df-v 2814  df-un 3214  df-in 3216  df-ss 3223  df-sn 3688  df-pr 3689  df-uni 3908
This theorem is referenced by:  mapunen  7095
  Copyright terms: Public domain W3C validator