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

Theorem ixpf 6838
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 6820 . 2  |-  ( F  e.  X_ x  e.  A  B 
<->  ( F  e.  _V  /\  F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B ) )
2 ssiun2 3945 . . . . . . 7  |-  ( x  e.  A  ->  B  C_ 
U_ x  e.  A  B )
32sseld 3179 . . . . . 6  |-  ( x  e.  A  ->  (
( F `  x
)  e.  B  -> 
( F `  x
)  e.  U_ x  e.  A  B )
)
43ralimia 2616 . . . . 5  |-  ( A. x  e.  A  ( F `  x )  e.  B  ->  A. x  e.  A  ( F `  x )  e.  U_ x  e.  A  B
)
54anim2i 552 . . . 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 2419 . . . . 5  |-  F/_ x A
7 nfiu1 3933 . . . . 5  |-  F/_ x U_ x  e.  A  B
8 nfcv 2419 . . . . 5  |-  F/_ x F
96, 7, 8ffnfvf 5686 . . . 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 203 . . 3  |-  ( ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B )  ->  F : A --> U_ x  e.  A  B )
11103adant1 973 . 2  |-  ( ( F  e.  _V  /\  F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B )  ->  F : A --> U_ x  e.  A  B )
121, 11sylbi 187 1  |-  ( F  e.  X_ x  e.  A  B  ->  F : A --> U_ x  e.  A  B
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    /\ w3a 934    e. wcel 1684   A.wral 2543   _Vcvv 2788   U_ciun 3905    Fn wfn 5250   -->wf 5251   ` cfv 5255   X_cixp 6817
This theorem is referenced by:  uniixp  6839  ixpssmap2g  6845  npincppr  25159
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pr 4214
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-sbc 2992  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-fv 5263  df-ixp 6818
  Copyright terms: Public domain W3C validator