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

Theorem xpexgALT 6366
Description: The cross product of two sets is a set. Proposition 6.2 of [TakeutiZaring] p. 23. This version is proven using Replacement; see xpexg 4889 for a version that uses the Power Set axiom instead. (Contributed by Mario Carneiro, 20-May-2013.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
xpexgALT  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A  X.  B
)  e.  _V )

Proof of Theorem xpexgALT
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 iunid 4068 . . . 4  |-  U_ y  e.  B  { y }  =  B
21xpeq2i 4795 . . 3  |-  ( A  X.  U_ y  e.  B  { y } )  =  ( A  X.  B )
3 xpiundi 4833 . . 3  |-  ( A  X.  U_ y  e.  B  { y } )  =  U_ y  e.  B  ( A  X.  { y } )
42, 3eqtr3i 2261 . 2  |-  ( A  X.  B )  = 
U_ y  e.  B  ( A  X.  { y } )
5 id 19 . . 3  |-  ( B  e.  W  ->  B  e.  W )
6 fconstmpt 4822 . . . . 5  |-  ( A  X.  { y } )  =  ( x  e.  A  |->  y )
7 mptexg 5942 . . . . 5  |-  ( A  e.  V  ->  (
x  e.  A  |->  y )  e.  _V )
86, 7eqeltrid 2325 . . . 4  |-  ( A  e.  V  ->  ( A  X.  { y } )  e.  _V )
98ralrimivw 2624 . . 3  |-  ( A  e.  V  ->  A. y  e.  B  ( A  X.  { y } )  e.  _V )
10 iunexg 6348 . . 3  |-  ( ( B  e.  W  /\  A. y  e.  B  ( A  X.  { y } )  e.  _V )  ->  U_ y  e.  B  ( A  X.  { y } )  e.  _V )
115, 9, 10syl2anr 290 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  U_ y  e.  B  ( A  X.  { y } )  e.  _V )
124, 11eqeltrid 2325 1  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A  X.  B
)  e.  _V )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    e. wcel 2209   A.wral 2528   _Vcvv 2821   {csn 3709   U_ciun 4012    |-> cmpt 4192    X. cxp 4772
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator