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

Theorem iunfo 8866
Description: Existence of an onto function from a disjoint union to a union. (Contributed by Mario Carneiro, 24-Jun-2013.) (Revised by Mario Carneiro, 18-Jan-2014.)
Hypothesis
Ref Expression
iunfo.1  |-  T  = 
U_ x  e.  A  ( { x }  X.  B )
Assertion
Ref Expression
iunfo  |-  ( 2nd  |`  T ) : T -onto-> U_ x  e.  A  B
Distinct variable group:    x, A
Allowed substitution hints:    B( x)    T( x)

Proof of Theorem iunfo
Dummy variables  y 
z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fo2nd 6759 . . . 4  |-  2nd : _V -onto-> _V
2 fof 5734 . . . 4  |-  ( 2nd
: _V -onto-> _V  ->  2nd
: _V --> _V )
3 ffn 5670 . . . 4  |-  ( 2nd
: _V --> _V  ->  2nd 
Fn  _V )
41, 2, 3mp2b 10 . . 3  |-  2nd  Fn  _V
5 ssv 3461 . . 3  |-  T  C_  _V
6 fnssres 5631 . . 3  |-  ( ( 2nd  Fn  _V  /\  T  C_  _V )  -> 
( 2nd  |`  T )  Fn  T )
74, 5, 6mp2an 670 . 2  |-  ( 2nd  |`  T )  Fn  T
8 df-ima 4955 . . 3  |-  ( 2nd " T )  =  ran  ( 2nd  |`  T )
9 iunfo.1 . . . . . . . . . . 11  |-  T  = 
U_ x  e.  A  ( { x }  X.  B )
109eleq2i 2480 . . . . . . . . . 10  |-  ( z  e.  T  <->  z  e.  U_ x  e.  A  ( { x }  X.  B ) )
11 eliun 4275 . . . . . . . . . 10  |-  ( z  e.  U_ x  e.  A  ( { x }  X.  B )  <->  E. x  e.  A  z  e.  ( { x }  X.  B ) )
1210, 11bitri 249 . . . . . . . . 9  |-  ( z  e.  T  <->  E. x  e.  A  z  e.  ( { x }  X.  B ) )
13 xp2nd 6769 . . . . . . . . . . 11  |-  ( z  e.  ( { x }  X.  B )  -> 
( 2nd `  z
)  e.  B )
14 eleq1 2474 . . . . . . . . . . 11  |-  ( ( 2nd `  z )  =  y  ->  (
( 2nd `  z
)  e.  B  <->  y  e.  B ) )
1513, 14syl5ib 219 . . . . . . . . . 10  |-  ( ( 2nd `  z )  =  y  ->  (
z  e.  ( { x }  X.  B
)  ->  y  e.  B ) )
1615reximdv 2877 . . . . . . . . 9  |-  ( ( 2nd `  z )  =  y  ->  ( E. x  e.  A  z  e.  ( {
x }  X.  B
)  ->  E. x  e.  A  y  e.  B ) )
1712, 16syl5bi 217 . . . . . . . 8  |-  ( ( 2nd `  z )  =  y  ->  (
z  e.  T  ->  E. x  e.  A  y  e.  B )
)
1817impcom 428 . . . . . . 7  |-  ( ( z  e.  T  /\  ( 2nd `  z )  =  y )  ->  E. x  e.  A  y  e.  B )
1918rexlimiva 2891 . . . . . 6  |-  ( E. z  e.  T  ( 2nd `  z )  =  y  ->  E. x  e.  A  y  e.  B )
20 nfiu1 4300 . . . . . . . . 9  |-  F/_ x U_ x  e.  A  ( { x }  X.  B )
219, 20nfcxfr 2562 . . . . . . . 8  |-  F/_ x T
22 nfv 1728 . . . . . . . 8  |-  F/ x
( 2nd `  z
)  =  y
2321, 22nfrex 2866 . . . . . . 7  |-  F/ x E. z  e.  T  ( 2nd `  z )  =  y
24 ssiun2 4313 . . . . . . . . . . . 12  |-  ( x  e.  A  ->  ( { x }  X.  B )  C_  U_ x  e.  A  ( {
x }  X.  B
) )
2524adantr 463 . . . . . . . . . . 11  |-  ( ( x  e.  A  /\  y  e.  B )  ->  ( { x }  X.  B )  C_  U_ x  e.  A  ( {
x }  X.  B
) )
26 simpr 459 . . . . . . . . . . . 12  |-  ( ( x  e.  A  /\  y  e.  B )  ->  y  e.  B )
27 ssnid 4000 . . . . . . . . . . . . 13  |-  x  e. 
{ x }
28 opelxp 4972 . . . . . . . . . . . . 13  |-  ( <.
x ,  y >.  e.  ( { x }  X.  B )  <->  ( x  e.  { x }  /\  y  e.  B )
)
2927, 28mpbiran 919 . . . . . . . . . . . 12  |-  ( <.
x ,  y >.  e.  ( { x }  X.  B )  <->  y  e.  B )
3026, 29sylibr 212 . . . . . . . . . . 11  |-  ( ( x  e.  A  /\  y  e.  B )  -> 
<. x ,  y >.  e.  ( { x }  X.  B ) )
3125, 30sseldd 3442 . . . . . . . . . 10  |-  ( ( x  e.  A  /\  y  e.  B )  -> 
<. x ,  y >.  e.  U_ x  e.  A  ( { x }  X.  B ) )
3231, 9syl6eleqr 2501 . . . . . . . . 9  |-  ( ( x  e.  A  /\  y  e.  B )  -> 
<. x ,  y >.  e.  T )
33 vex 3061 . . . . . . . . . 10  |-  x  e. 
_V
34 vex 3061 . . . . . . . . . 10  |-  y  e. 
_V
3533, 34op2nd 6747 . . . . . . . . 9  |-  ( 2nd `  <. x ,  y
>. )  =  y
36 fveq2 5805 . . . . . . . . . . 11  |-  ( z  =  <. x ,  y
>.  ->  ( 2nd `  z
)  =  ( 2nd `  <. x ,  y
>. ) )
3736eqeq1d 2404 . . . . . . . . . 10  |-  ( z  =  <. x ,  y
>.  ->  ( ( 2nd `  z )  =  y  <-> 
( 2nd `  <. x ,  y >. )  =  y ) )
3837rspcev 3159 . . . . . . . . 9  |-  ( (
<. x ,  y >.  e.  T  /\  ( 2nd `  <. x ,  y
>. )  =  y
)  ->  E. z  e.  T  ( 2nd `  z )  =  y )
3932, 35, 38sylancl 660 . . . . . . . 8  |-  ( ( x  e.  A  /\  y  e.  B )  ->  E. z  e.  T  ( 2nd `  z )  =  y )
4039ex 432 . . . . . . 7  |-  ( x  e.  A  ->  (
y  e.  B  ->  E. z  e.  T  ( 2nd `  z )  =  y ) )
4123, 40rexlimi 2885 . . . . . 6  |-  ( E. x  e.  A  y  e.  B  ->  E. z  e.  T  ( 2nd `  z )  =  y )
4219, 41impbii 188 . . . . 5  |-  ( E. z  e.  T  ( 2nd `  z )  =  y  <->  E. x  e.  A  y  e.  B )
43 fvelimab 5861 . . . . . 6  |-  ( ( 2nd  Fn  _V  /\  T  C_  _V )  -> 
( y  e.  ( 2nd " T )  <->  E. z  e.  T  ( 2nd `  z )  =  y ) )
444, 5, 43mp2an 670 . . . . 5  |-  ( y  e.  ( 2nd " T
)  <->  E. z  e.  T  ( 2nd `  z )  =  y )
45 eliun 4275 . . . . 5  |-  ( y  e.  U_ x  e.  A  B  <->  E. x  e.  A  y  e.  B )
4642, 44, 453bitr4i 277 . . . 4  |-  ( y  e.  ( 2nd " T
)  <->  y  e.  U_ x  e.  A  B
)
4746eqriv 2398 . . 3  |-  ( 2nd " T )  =  U_ x  e.  A  B
488, 47eqtr3i 2433 . 2  |-  ran  ( 2nd  |`  T )  = 
U_ x  e.  A  B
49 df-fo 5531 . 2  |-  ( ( 2nd  |`  T ) : T -onto-> U_ x  e.  A  B 
<->  ( ( 2nd  |`  T )  Fn  T  /\  ran  ( 2nd  |`  T )  =  U_ x  e.  A  B ) )
507, 48, 49mpbir2an 921 1  |-  ( 2nd  |`  T ) : T -onto-> U_ x  e.  A  B
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    /\ wa 367    = wceq 1405    e. wcel 1842   E.wrex 2754   _Vcvv 3058    C_ wss 3413   {csn 3971   <.cop 3977   U_ciun 4270    X. cxp 4940   ran crn 4943    |` cres 4944   "cima 4945    Fn wfn 5520   -->wf 5521   -onto->wfo 5523   ` cfv 5525   2ndc2nd 6737
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1639  ax-4 1652  ax-5 1725  ax-6 1771  ax-7 1814  ax-8 1844  ax-9 1846  ax-10 1861  ax-11 1866  ax-12 1878  ax-13 2026  ax-ext 2380  ax-sep 4516  ax-nul 4524  ax-pow 4571  ax-pr 4629  ax-un 6530
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 976  df-tru 1408  df-ex 1634  df-nf 1638  df-sb 1764  df-eu 2242  df-mo 2243  df-clab 2388  df-cleq 2394  df-clel 2397  df-nfc 2552  df-ne 2600  df-ral 2758  df-rex 2759  df-rab 2762  df-v 3060  df-sbc 3277  df-dif 3416  df-un 3418  df-in 3420  df-ss 3427  df-nul 3738  df-if 3885  df-sn 3972  df-pr 3974  df-op 3978  df-uni 4191  df-iun 4272  df-br 4395  df-opab 4453  df-mpt 4454  df-id 4737  df-xp 4948  df-rel 4949  df-cnv 4950  df-co 4951  df-dm 4952  df-rn 4953  df-res 4954  df-ima 4955  df-iota 5489  df-fun 5527  df-fn 5528  df-f 5529  df-fo 5531  df-fv 5533  df-2nd 6739
This theorem is referenced by:  iundomg  8868
  Copyright terms: Public domain W3C validator