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

Theorem xpexr2m 5209
Description: If a nonempty cross product is a set, so are both of its components. (Contributed by Jim Kingdon, 14-Dec-2018.)
Assertion
Ref Expression
xpexr2m  |-  ( ( ( A  X.  B
)  e.  C  /\  E. x  x  e.  ( A  X.  B ) )  ->  ( A  e.  _V  /\  B  e. 
_V ) )
Distinct variable groups:    x, A    x, B
Allowed substitution hint:    C( x)

Proof of Theorem xpexr2m
Dummy variables  a  b are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 xpm 5189 . 2  |-  ( ( E. a  a  e.  A  /\  E. b 
b  e.  B )  <->  E. x  x  e.  ( A  X.  B
) )
2 dmxpm 4982 . . . . . 6  |-  ( E. b  b  e.  B  ->  dom  ( A  X.  B )  =  A )
32adantl 277 . . . . 5  |-  ( ( ( A  X.  B
)  e.  C  /\  E. b  b  e.  B
)  ->  dom  ( A  X.  B )  =  A )
4 dmexg 5026 . . . . . 6  |-  ( ( A  X.  B )  e.  C  ->  dom  ( A  X.  B
)  e.  _V )
54adantr 276 . . . . 5  |-  ( ( ( A  X.  B
)  e.  C  /\  E. b  b  e.  B
)  ->  dom  ( A  X.  B )  e. 
_V )
63, 5eqeltrrd 2312 . . . 4  |-  ( ( ( A  X.  B
)  e.  C  /\  E. b  b  e.  B
)  ->  A  e.  _V )
7 rnxpm 5197 . . . . . 6  |-  ( E. a  a  e.  A  ->  ran  ( A  X.  B )  =  B )
87adantl 277 . . . . 5  |-  ( ( ( A  X.  B
)  e.  C  /\  E. a  a  e.  A
)  ->  ran  ( A  X.  B )  =  B )
9 rnexg 5027 . . . . . 6  |-  ( ( A  X.  B )  e.  C  ->  ran  ( A  X.  B
)  e.  _V )
109adantr 276 . . . . 5  |-  ( ( ( A  X.  B
)  e.  C  /\  E. a  a  e.  A
)  ->  ran  ( A  X.  B )  e. 
_V )
118, 10eqeltrrd 2312 . . . 4  |-  ( ( ( A  X.  B
)  e.  C  /\  E. a  a  e.  A
)  ->  B  e.  _V )
126, 11anim12dan 604 . . 3  |-  ( ( ( A  X.  B
)  e.  C  /\  ( E. b  b  e.  B  /\  E. a 
a  e.  A ) )  ->  ( A  e.  _V  /\  B  e. 
_V ) )
1312ancom2s 568 . 2  |-  ( ( ( A  X.  B
)  e.  C  /\  ( E. a  a  e.  A  /\  E. b 
b  e.  B ) )  ->  ( A  e.  _V  /\  B  e. 
_V ) )
141, 13sylan2br 288 1  |-  ( ( ( A  X.  B
)  e.  C  /\  E. x  x  e.  ( A  X.  B ) )  ->  ( A  e.  _V  /\  B  e. 
_V ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398   E.wex 1541    e. wcel 2205   _Vcvv 2815    X. cxp 4752   dom cdm 4754   ran crn 4755
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-xp 4760  df-rel 4761  df-cnv 4762  df-dm 4764  df-rn 4765
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator