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

Theorem iunxsng 4110
Description: A singleton index picks out an instance of an indexed union's argument. (Contributed by Mario Carneiro, 25-Jun-2016.)
Hypothesis
Ref Expression
iunxsng.1  |-  ( x  =  A  ->  B  =  C )
Assertion
Ref Expression
iunxsng  |-  ( A  e.  V  ->  U_ x  e.  { A } B  =  C )
Distinct variable groups:    x, A    x, C
Allowed substitution hints:    B( x)    V( x)

Proof of Theorem iunxsng
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 eliun 4039 . . 3  |-  ( y  e.  U_ x  e. 
{ A } B  <->  E. x  e.  { A } y  e.  B
)
2 iunxsng.1 . . . . 5  |-  ( x  =  A  ->  B  =  C )
32eleq2d 2454 . . . 4  |-  ( x  =  A  ->  (
y  e.  B  <->  y  e.  C ) )
43rexsng 3790 . . 3  |-  ( A  e.  V  ->  ( E. x  e.  { A } y  e.  B  <->  y  e.  C ) )
51, 4syl5bb 249 . 2  |-  ( A  e.  V  ->  (
y  e.  U_ x  e.  { A } B  <->  y  e.  C ) )
65eqrdv 2385 1  |-  ( A  e.  V  ->  U_ x  e.  { A } B  =  C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1649    e. wcel 1717   E.wrex 2650   {csn 3757   U_ciun 4035
This theorem is referenced by:  iunxsn  4111
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2368
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2374  df-cleq 2380  df-clel 2383  df-nfc 2512  df-ral 2654  df-rex 2655  df-v 2901  df-sbc 3105  df-sn 3763  df-iun 4037
  Copyright terms: Public domain W3C validator