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

Theorem elxp2 4707
Description: Membership in a cross product. (Contributed by NM, 23-Feb-2004.)
Assertion
Ref Expression
elxp2  |-  ( A  e.  ( B  X.  C )  <->  E. x  e.  B  E. y  e.  C  A  =  <. x ,  y >.
)
Distinct variable groups:    x, y, A    x, B, y    x, C, y

Proof of Theorem elxp2
StepHypRef Expression
1 df-rex 2549 . . . 4  |-  ( E. y  e.  C  ( x  e.  B  /\  A  =  <. x ,  y >. )  <->  E. y
( y  e.  C  /\  ( x  e.  B  /\  A  =  <. x ,  y >. )
) )
2 r19.42v 2694 . . . 4  |-  ( E. y  e.  C  ( x  e.  B  /\  A  =  <. x ,  y >. )  <->  ( x  e.  B  /\  E. y  e.  C  A  =  <. x ,  y >.
) )
3 an13 774 . . . . 5  |-  ( ( y  e.  C  /\  ( x  e.  B  /\  A  =  <. x ,  y >. )
)  <->  ( A  = 
<. x ,  y >.  /\  ( x  e.  B  /\  y  e.  C
) ) )
43exbii 1569 . . . 4  |-  ( E. y ( y  e.  C  /\  ( x  e.  B  /\  A  =  <. x ,  y
>. ) )  <->  E. y
( A  =  <. x ,  y >.  /\  (
x  e.  B  /\  y  e.  C )
) )
51, 2, 43bitr3i 266 . . 3  |-  ( ( x  e.  B  /\  E. y  e.  C  A  =  <. x ,  y
>. )  <->  E. y ( A  =  <. x ,  y
>.  /\  ( x  e.  B  /\  y  e.  C ) ) )
65exbii 1569 . 2  |-  ( E. x ( x  e.  B  /\  E. y  e.  C  A  =  <. x ,  y >.
)  <->  E. x E. y
( A  =  <. x ,  y >.  /\  (
x  e.  B  /\  y  e.  C )
) )
7 df-rex 2549 . 2  |-  ( E. x  e.  B  E. y  e.  C  A  =  <. x ,  y
>. 
<->  E. x ( x  e.  B  /\  E. y  e.  C  A  =  <. x ,  y
>. ) )
8 elxp 4706 . 2  |-  ( A  e.  ( B  X.  C )  <->  E. x E. y ( A  = 
<. x ,  y >.  /\  ( x  e.  B  /\  y  e.  C
) ) )
96, 7, 83bitr4ri 269 1  |-  ( A  e.  ( B  X.  C )  <->  E. x  e.  B  E. y  e.  C  A  =  <. x ,  y >.
)
Colors of variables: wff set class
Syntax hints:    <-> wb 176    /\ wa 358   E.wex 1528    = wceq 1623    e. wcel 1684   E.wrex 2544   <.cop 3643    X. cxp 4687
This theorem is referenced by:  opelxp  4719  xpiundi  4743  xpiundir  4744  xpdom2  6957  tskxpss  8394  nqereu  8553  elreal  8753  xpnnenOLD  12488  efgmnvl  15023  frgpuptinv  15080  frgpup3lem  15086
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-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-rex 2549  df-v 2790  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-opab 4078  df-xp 4695
  Copyright terms: Public domain W3C validator