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

Theorem dminxp 5454
Description: Domain of the intersection with a Cartesian product. (Contributed by NM, 17-Jan-2006.)
Assertion
Ref Expression
dminxp  |-  ( dom  ( C  i^i  ( A  X.  B ) )  =  A  <->  A. x  e.  A  E. y  e.  B  x C
y )
Distinct variable groups:    x, A    x, y, B    x, C, y
Allowed substitution hint:    A( y)

Proof of Theorem dminxp
StepHypRef Expression
1 dfdm4 5205 . . . 4  |-  dom  ( C  i^i  ( A  X.  B ) )  =  ran  `' ( C  i^i  ( A  X.  B ) )
2 cnvin 5420 . . . . . 6  |-  `' ( C  i^i  ( A  X.  B ) )  =  ( `' C  i^i  `' ( A  X.  B ) )
3 cnvxp 5431 . . . . . . 7  |-  `' ( A  X.  B )  =  ( B  X.  A )
43ineq2i 3693 . . . . . 6  |-  ( `' C  i^i  `' ( A  X.  B ) )  =  ( `' C  i^i  ( B  X.  A ) )
52, 4eqtri 2486 . . . . 5  |-  `' ( C  i^i  ( A  X.  B ) )  =  ( `' C  i^i  ( B  X.  A
) )
65rneqi 5239 . . . 4  |-  ran  `' ( C  i^i  ( A  X.  B ) )  =  ran  ( `' C  i^i  ( B  X.  A ) )
71, 6eqtri 2486 . . 3  |-  dom  ( C  i^i  ( A  X.  B ) )  =  ran  ( `' C  i^i  ( B  X.  A
) )
87eqeq1i 2464 . 2  |-  ( dom  ( C  i^i  ( A  X.  B ) )  =  A  <->  ran  ( `' C  i^i  ( B  X.  A ) )  =  A )
9 rninxp 5453 . 2  |-  ( ran  ( `' C  i^i  ( B  X.  A
) )  =  A  <->  A. x  e.  A  E. y  e.  B  y `' C x )
10 vex 3112 . . . . 5  |-  y  e. 
_V
11 vex 3112 . . . . 5  |-  x  e. 
_V
1210, 11brcnv 5195 . . . 4  |-  ( y `' C x  <->  x C
y )
1312rexbii 2959 . . 3  |-  ( E. y  e.  B  y `' C x  <->  E. y  e.  B  x C
y )
1413ralbii 2888 . 2  |-  ( A. x  e.  A  E. y  e.  B  y `' C x  <->  A. x  e.  A  E. y  e.  B  x C
y )
158, 9, 143bitri 271 1  |-  ( dom  ( C  i^i  ( A  X.  B ) )  =  A  <->  A. x  e.  A  E. y  e.  B  x C
y )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    = wceq 1395   A.wral 2807   E.wrex 2808    i^i cin 3470   class class class wbr 4456    X. cxp 5006   `'ccnv 5007   dom cdm 5008   ran crn 5009
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-9 1823  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435  ax-sep 4578  ax-nul 4586  ax-pr 4695
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1398  df-ex 1614  df-nf 1618  df-sb 1741  df-eu 2287  df-mo 2288  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3111  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-nul 3794  df-if 3945  df-sn 4033  df-pr 4035  df-op 4039  df-br 4457  df-opab 4516  df-xp 5014  df-rel 5015  df-cnv 5016  df-dm 5018  df-rn 5019  df-res 5020  df-ima 5021
This theorem is referenced by:  trust  20858
  Copyright terms: Public domain W3C validator