HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem unexg 2871
Description: A union of two sets is a set. Corollary 5.8 of [TakeutiZaring] p. 16.
Assertion
Ref Expression
unexg |- ((A e. C /\ B e. D) -> (A u. B) e. V)

Proof of Theorem unexg
StepHypRef Expression
1 unexb 2870 . . 3 |- ((A e. V /\ B e. V) <-> (A u. B) e. V)
21biimp 151 . 2 |- ((A e. V /\ B e. V) -> (A u. B) e. V)
3 elisset 1815 . 2 |- (A e. C -> A e. V)
4 elisset 1815 . 2 |- (B e. D -> B e. V)
52, 3, 4syl2an 454 1 |- ((A e. C /\ B e. D) -> (A u. B) e. V)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223   e. wcel 957  Vcvv 1809   u. cun 2043
This theorem is referenced by:  eldifpw 2907  ordunel 3081  xpexg 3256  alephprc 4880
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-10 965  ax-11 966  ax-12 967  ax-13 968  ax-14 969  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-10o 1139  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2700  ax-pow 2739  ax-pr 2776  ax-un 2863
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 980  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1586  df-v 1810  df-dif 2047  df-un 2048  df-in 2049  df-ss 2051  df-nul 2279  df-pw 2400  df-sn 2410  df-pr 2411  df-uni 2501
Copyright terms: Public domain