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

Theorem iunsuc 4960
Description: Inductive definition for the indexed union at a successor. (Contributed by Mario Carneiro, 4-Feb-2013.) (Proof shortened by Mario Carneiro, 18-Nov-2016.)
Hypotheses
Ref Expression
iunsuc.1  |-  A  e. 
_V
iunsuc.2  |-  ( x  =  A  ->  B  =  C )
Assertion
Ref Expression
iunsuc  |-  U_ x  e.  suc  A B  =  ( U_ x  e.  A  B  u.  C
)
Distinct variable groups:    x, A    x, C
Allowed substitution hint:    B( x)

Proof of Theorem iunsuc
StepHypRef Expression
1 df-suc 4884 . . 3  |-  suc  A  =  ( A  u.  { A } )
2 iuneq1 4339 . . 3  |-  ( suc 
A  =  ( A  u.  { A }
)  ->  U_ x  e. 
suc  A B  = 
U_ x  e.  ( A  u.  { A } ) B )
31, 2ax-mp 5 . 2  |-  U_ x  e.  suc  A B  = 
U_ x  e.  ( A  u.  { A } ) B
4 iunxun 4407 . 2  |-  U_ x  e.  ( A  u.  { A } ) B  =  ( U_ x  e.  A  B  u.  U_ x  e.  { A } B )
5 iunsuc.1 . . . 4  |-  A  e. 
_V
6 iunsuc.2 . . . 4  |-  ( x  =  A  ->  B  =  C )
75, 6iunxsn 4405 . . 3  |-  U_ x  e.  { A } B  =  C
87uneq2i 3655 . 2  |-  ( U_ x  e.  A  B  u.  U_ x  e.  { A } B )  =  ( U_ x  e.  A  B  u.  C
)
93, 4, 83eqtri 2500 1  |-  U_ x  e.  suc  A B  =  ( U_ x  e.  A  B  u.  C
)
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1379    e. wcel 1767   _Vcvv 3113    u. cun 3474   {csn 4027   U_ciun 4325   suc csuc 4880
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ral 2819  df-rex 2820  df-v 3115  df-sbc 3332  df-un 3481  df-in 3483  df-ss 3490  df-sn 4028  df-iun 4327  df-suc 4884
This theorem is referenced by:  pwsdompw  8580
  Copyright terms: Public domain W3C validator