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

Theorem iunon 6430
Description: The indexed union of a set of ordinal numbers  B ( x ) is an ordinal number. (Contributed by NM, 13-Oct-2003.) (Revised by Mario Carneiro, 5-Dec-2016.)
Assertion
Ref Expression
iunon  |-  ( ( A  e.  V  /\  A. x  e.  A  B  e.  On )  ->  U_ x  e.  A  B  e.  On )
Distinct variable group:    x, A
Allowed substitution hints:    B( x)    V( x)

Proof of Theorem iunon
StepHypRef Expression
1 dfiun3g 4981 . . 3  |-  ( A. x  e.  A  B  e.  On  ->  U_ x  e.  A  B  =  U. ran  ( x  e.  A  |->  B ) )
21adantl 277 . 2  |-  ( ( A  e.  V  /\  A. x  e.  A  B  e.  On )  ->  U_ x  e.  A  B  =  U. ran  ( x  e.  A  |->  B ) )
3 mptexg 5864 . . . 4  |-  ( A  e.  V  ->  (
x  e.  A  |->  B )  e.  _V )
4 rnexg 4989 . . . 4  |-  ( ( x  e.  A  |->  B )  e.  _V  ->  ran  ( x  e.  A  |->  B )  e.  _V )
53, 4syl 14 . . 3  |-  ( A  e.  V  ->  ran  ( x  e.  A  |->  B )  e.  _V )
6 eqid 2229 . . . . 5  |-  ( x  e.  A  |->  B )  =  ( x  e.  A  |->  B )
76fmpt 5785 . . . 4  |-  ( A. x  e.  A  B  e.  On  <->  ( x  e.  A  |->  B ) : A --> On )
8 frn 5482 . . . 4  |-  ( ( x  e.  A  |->  B ) : A --> On  ->  ran  ( x  e.  A  |->  B )  C_  On )
97, 8sylbi 121 . . 3  |-  ( A. x  e.  A  B  e.  On  ->  ran  ( x  e.  A  |->  B ) 
C_  On )
10 ssonuni 4580 . . . 4  |-  ( ran  ( x  e.  A  |->  B )  e.  _V  ->  ( ran  ( x  e.  A  |->  B ) 
C_  On  ->  U. ran  ( x  e.  A  |->  B )  e.  On ) )
1110imp 124 . . 3  |-  ( ( ran  ( x  e.  A  |->  B )  e. 
_V  /\  ran  ( x  e.  A  |->  B ) 
C_  On )  ->  U. ran  ( x  e.  A  |->  B )  e.  On )
125, 9, 11syl2an 289 . 2  |-  ( ( A  e.  V  /\  A. x  e.  A  B  e.  On )  ->  U. ran  ( x  e.  A  |->  B )  e.  On )
132, 12eqeltrd 2306 1  |-  ( ( A  e.  V  /\  A. x  e.  A  B  e.  On )  ->  U_ x  e.  A  B  e.  On )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200   A.wral 2508   _Vcvv 2799    C_ wss 3197   U.cuni 3888   U_ciun 3965    |-> cmpt 4145   Oncon0 4454   ran crn 4720   -->wf 5314
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-iord 4457  df-on 4459  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326
This theorem is referenced by:  rdgon  6532
  Copyright terms: Public domain W3C validator