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

Theorem dminxp 5303
Description: Domain of the intersection with a cross 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 5055 . . . 4  |-  dom  ( C  i^i  ( A  X.  B ) )  =  ran  `' ( C  i^i  ( A  X.  B ) )
2 cnvin 5271 . . . . . 6  |-  `' ( C  i^i  ( A  X.  B ) )  =  ( `' C  i^i  `' ( A  X.  B ) )
3 cnvxp 5282 . . . . . . 7  |-  `' ( A  X.  B )  =  ( B  X.  A )
43ineq2i 3531 . . . . . 6  |-  ( `' C  i^i  `' ( A  X.  B ) )  =  ( `' C  i^i  ( B  X.  A ) )
52, 4eqtri 2455 . . . . 5  |-  `' ( C  i^i  ( A  X.  B ) )  =  ( `' C  i^i  ( B  X.  A
) )
65rneqi 5088 . . . 4  |-  ran  `' ( C  i^i  ( A  X.  B ) )  =  ran  ( `' C  i^i  ( B  X.  A ) )
71, 6eqtri 2455 . . 3  |-  dom  ( C  i^i  ( A  X.  B ) )  =  ran  ( `' C  i^i  ( B  X.  A
) )
87eqeq1i 2442 . 2  |-  ( dom  ( C  i^i  ( A  X.  B ) )  =  A  <->  ran  ( `' C  i^i  ( B  X.  A ) )  =  A )
9 rninxp 5302 . 2  |-  ( ran  ( `' C  i^i  ( B  X.  A
) )  =  A  <->  A. x  e.  A  E. y  e.  B  y `' C x )
10 vex 2951 . . . . 5  |-  y  e. 
_V
11 vex 2951 . . . . 5  |-  x  e. 
_V
1210, 11brcnv 5047 . . . 4  |-  ( y `' C x  <->  x C
y )
1312rexbii 2722 . . 3  |-  ( E. y  e.  B  y `' C x  <->  E. y  e.  B  x C
y )
1413ralbii 2721 . 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 263 1  |-  ( dom  ( C  i^i  ( A  X.  B ) )  =  A  <->  A. x  e.  A  E. y  e.  B  x C
y )
Colors of variables: wff set class
Syntax hints:    <-> wb 177    = wceq 1652   A.wral 2697   E.wrex 2698    i^i cin 3311   class class class wbr 4204    X. cxp 4868   `'ccnv 4869   dom cdm 4870   ran crn 4871
This theorem is referenced by:  trust  18251
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-sep 4322  ax-nul 4330  ax-pr 4395
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rex 2703  df-rab 2706  df-v 2950  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-nul 3621  df-if 3732  df-sn 3812  df-pr 3813  df-op 3815  df-br 4205  df-opab 4259  df-xp 4876  df-rel 4877  df-cnv 4878  df-dm 4880  df-rn 4881  df-res 4882  df-ima 4883
  Copyright terms: Public domain W3C validator