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

Theorem elxp7 6152
Description: Membership in a cross product. This version requires no quantifiers or dummy variables. See also elxp4 5160. (Contributed by NM, 19-Aug-2006.)
Assertion
Ref Expression
elxp7  |-  ( A  e.  ( B  X.  C )  <->  ( A  e.  ( _V  X.  _V )  /\  ( ( 1st `  A )  e.  B  /\  ( 2nd `  A
)  e.  C ) ) )

Proof of Theorem elxp7
StepHypRef Expression
1 elxp6 6151 . 2  |-  ( A  e.  ( B  X.  C )  <->  ( A  =  <. ( 1st `  A
) ,  ( 2nd `  A ) >.  /\  (
( 1st `  A
)  e.  B  /\  ( 2nd `  A )  e.  C ) ) )
2 fvex 5539 . . . . 5  |-  ( 1st `  A )  e.  _V
3 fvex 5539 . . . . 5  |-  ( 2nd `  A )  e.  _V
42, 3pm3.2i 441 . . . 4  |-  ( ( 1st `  A )  e.  _V  /\  ( 2nd `  A )  e. 
_V )
5 elxp6 6151 . . . 4  |-  ( A  e.  ( _V  X.  _V )  <->  ( A  = 
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  /\  (
( 1st `  A
)  e.  _V  /\  ( 2nd `  A )  e.  _V ) ) )
64, 5mpbiran2 885 . . 3  |-  ( A  e.  ( _V  X.  _V )  <->  A  =  <. ( 1st `  A ) ,  ( 2nd `  A
) >. )
76anbi1i 676 . 2  |-  ( ( A  e.  ( _V 
X.  _V )  /\  (
( 1st `  A
)  e.  B  /\  ( 2nd `  A )  e.  C ) )  <-> 
( A  =  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  /\  ( ( 1st `  A )  e.  B  /\  ( 2nd `  A )  e.  C
) ) )
81, 7bitr4i 243 1  |-  ( A  e.  ( B  X.  C )  <->  ( A  e.  ( _V  X.  _V )  /\  ( ( 1st `  A )  e.  B  /\  ( 2nd `  A
)  e.  C ) ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 176    /\ wa 358    = wceq 1623    e. wcel 1684   _Vcvv 2788   <.cop 3643    X. cxp 4687   ` cfv 5255   1stc1st 6120   2ndc2nd 6121
This theorem is referenced by:  xp2  6157  unielxp  6158  1stconst  6207  2ndconst  6208  fparlem1  6218  fparlem2  6219  infxpenlem  7641  xpinpreima2  23291  tpr2rico  23296  pellex  26920
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-13 1686  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-pow 4188  ax-pr 4214  ax-un 4512
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-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-sbc 2992  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-uni 3828  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-iota 5219  df-fun 5257  df-fv 5263  df-1st 6122  df-2nd 6123
  Copyright terms: Public domain W3C validator