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

Theorem ixpf 6833
Description: A member of an infinite Cartesian product maps to the indexed union of the product argument. Remark in [Enderton] p. 54. (Contributed by NM, 28-Sep-2006.)
Assertion
Ref Expression
ixpf  |-  ( F  e.  X_ x  e.  A  B  ->  F : A --> U_ x  e.  A  B
)
Distinct variable groups:    x, A    x, F
Allowed substitution hint:    B( x)

Proof of Theorem ixpf
StepHypRef Expression
1 elixp2 6815 . 2  |-  ( F  e.  X_ x  e.  A  B 
<->  ( F  e.  _V  /\  F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B ) )
2 ssiun2 3946 . . . . . . 7  |-  ( x  e.  A  ->  B  C_ 
U_ x  e.  A  B )
32sseld 3180 . . . . . 6  |-  ( x  e.  A  ->  (
( F `  x
)  e.  B  -> 
( F `  x
)  e.  U_ x  e.  A  B )
)
43ralimia 2617 . . . . 5  |-  ( A. x  e.  A  ( F `  x )  e.  B  ->  A. x  e.  A  ( F `  x )  e.  U_ x  e.  A  B
)
54anim2i 555 . . . 4  |-  ( ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B )  -> 
( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  U_ x  e.  A  B ) )
6 nfcv 2420 . . . . 5  |-  F/_ x A
7 nfiu1 3934 . . . . 5  |-  F/_ x U_ x  e.  A  B
8 nfcv 2420 . . . . 5  |-  F/_ x F
96, 7, 8ffnfvf 5647 . . . 4  |-  ( F : A --> U_ x  e.  A  B  <->  ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  U_ x  e.  A  B
) )
105, 9sylibr 205 . . 3  |-  ( ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B )  ->  F : A --> U_ x  e.  A  B )
11103adant1 978 . 2  |-  ( ( F  e.  _V  /\  F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B )  ->  F : A --> U_ x  e.  A  B )
121, 11sylbi 189 1  |-  ( F  e.  X_ x  e.  A  B  ->  F : A --> U_ x  e.  A  B
)
Colors of variables: wff set class
Syntax hints:    -> wi 6    /\ wa 360    /\ w3a 939    e. wcel 1688   A.wral 2544   _Vcvv 2789   U_ciun 3906    Fn wfn 5216   -->wf 5217   ` cfv 5221   X_cixp 6812
This theorem is referenced by:  uniixp  6834  ixpssmap2g  6840  npincppr  24558
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-gen 1538  ax-5 1549  ax-17 1608  ax-9 1641  ax-8 1648  ax-13 1690  ax-14 1692  ax-6 1707  ax-7 1712  ax-11 1719  ax-12 1869  ax-ext 2265  ax-sep 4142  ax-nul 4150  ax-pr 4213  ax-un 4511
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 941  df-tru 1315  df-ex 1534  df-nf 1537  df-sb 1636  df-eu 2148  df-mo 2149  df-clab 2271  df-cleq 2277  df-clel 2280  df-nfc 2409  df-ne 2449  df-ral 2549  df-rex 2550  df-rab 2553  df-v 2791  df-sbc 2993  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3457  df-if 3567  df-sn 3647  df-pr 3648  df-op 3650  df-uni 3829  df-iun 3908  df-br 4025  df-opab 4079  df-mpt 4080  df-id 4308  df-xp 4694  df-rel 4695  df-cnv 4696  df-co 4697  df-dm 4698  df-rn 4699  df-res 4700  df-ima 4701  df-fun 5223  df-fn 5224  df-f 5225  df-fv 5229  df-ixp 6813
  Copyright terms: Public domain W3C validator