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

Theorem iunon 6065
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 4705 . . 3  |-  ( A. x  e.  A  B  e.  On  ->  U_ x  e.  A  B  =  U. ran  ( x  e.  A  |->  B ) )
21adantl 272 . 2  |-  ( ( A  e.  V  /\  A. x  e.  A  B  e.  On )  ->  U_ x  e.  A  B  =  U. ran  ( x  e.  A  |->  B ) )
3 mptexg 5538 . . . 4  |-  ( A  e.  V  ->  (
x  e.  A  |->  B )  e.  _V )
4 rnexg 4713 . . . 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 2089 . . . . 5  |-  ( x  e.  A  |->  B )  =  ( x  e.  A  |->  B )
76fmpt 5465 . . . 4  |-  ( A. x  e.  A  B  e.  On  <->  ( x  e.  A  |->  B ) : A --> On )
8 frn 5184 . . . 4  |-  ( ( x  e.  A  |->  B ) : A --> On  ->  ran  ( x  e.  A  |->  B )  C_  On )
97, 8sylbi 120 . . 3  |-  ( A. x  e.  A  B  e.  On  ->  ran  ( x  e.  A  |->  B ) 
C_  On )
10 ssonuni 4320 . . . 4  |-  ( ran  ( x  e.  A  |->  B )  e.  _V  ->  ( ran  ( x  e.  A  |->  B ) 
C_  On  ->  U. ran  ( x  e.  A  |->  B )  e.  On ) )
1110imp 123 . . 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 284 . 2  |-  ( ( A  e.  V  /\  A. x  e.  A  B  e.  On )  ->  U. ran  ( x  e.  A  |->  B )  e.  On )
132, 12eqeltrd 2165 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 103    = wceq 1290    e. wcel 1439   A.wral 2360   _Vcvv 2622    C_ wss 3002   U.cuni 3661   U_ciun 3738    |-> cmpt 3907   Oncon0 4201   ran crn 4455   -->wf 5026
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-13 1450  ax-14 1451  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-coll 3962  ax-sep 3965  ax-pow 4017  ax-pr 4047  ax-un 4271
This theorem depends on definitions:  df-bi 116  df-3an 927  df-tru 1293  df-nf 1396  df-sb 1694  df-eu 1952  df-mo 1953  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ral 2365  df-rex 2366  df-reu 2367  df-rab 2369  df-v 2624  df-sbc 2844  df-csb 2937  df-un 3006  df-in 3008  df-ss 3015  df-pw 3437  df-sn 3458  df-pr 3459  df-op 3461  df-uni 3662  df-iun 3740  df-br 3854  df-opab 3908  df-mpt 3909  df-tr 3945  df-id 4131  df-iord 4204  df-on 4206  df-xp 4460  df-rel 4461  df-cnv 4462  df-co 4463  df-dm 4464  df-rn 4465  df-res 4466  df-ima 4467  df-iota 4995  df-fun 5032  df-fn 5033  df-f 5034  df-f1 5035  df-fo 5036  df-f1o 5037  df-fv 5038
This theorem is referenced by:  rdgon  6167
  Copyright terms: Public domain W3C validator