MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  uneqri Structured version   Unicode version

Theorem uneqri 3478
Description: Inference from membership to union. (Contributed by NM, 5-Aug-1993.)
Hypothesis
Ref Expression
uneqri.1  |-  ( ( x  e.  A  \/  x  e.  B )  <->  x  e.  C )
Assertion
Ref Expression
uneqri  |-  ( A  u.  B )  =  C
Distinct variable groups:    x, A    x, B    x, C

Proof of Theorem uneqri
StepHypRef Expression
1 elun 3477 . . 3  |-  ( x  e.  ( A  u.  B )  <->  ( x  e.  A  \/  x  e.  B ) )
2 uneqri.1 . . 3  |-  ( ( x  e.  A  \/  x  e.  B )  <->  x  e.  C )
31, 2bitri 242 . 2  |-  ( x  e.  ( A  u.  B )  <->  x  e.  C )
43eqriv 2440 1  |-  ( A  u.  B )  =  C
Colors of variables: wff set class
Syntax hints:    <-> wb 178    \/ wo 359    = wceq 1654    e. wcel 1728    u. cun 3307
This theorem is referenced by:  unidm  3479  uncom  3480  unass  3493  dfun2  3564  undi  3576  unab  3596  un0  3640  inundif  3734
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1628  ax-9 1669  ax-8 1690  ax-6 1747  ax-7 1752  ax-11 1764  ax-12 1954  ax-ext 2424
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1661  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2568  df-v 2967  df-un 3314
  Copyright terms: Public domain W3C validator