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

Theorem elxp7 6342
Description: Membership in a cross product. This version requires no quantifiers or dummy variables. See also elxp4 5231. (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 elex 2815 . 2  |-  ( A  e.  ( B  X.  C )  ->  A  e.  _V )
2 elex 2815 . . 3  |-  ( A  e.  ( _V  X.  _V )  ->  A  e. 
_V )
32adantr 276 . 2  |-  ( ( A  e.  ( _V 
X.  _V )  /\  (
( 1st `  A
)  e.  B  /\  ( 2nd `  A )  e.  C ) )  ->  A  e.  _V )
4 elxp6 6341 . . 3  |-  ( A  e.  ( B  X.  C )  <->  ( A  =  <. ( 1st `  A
) ,  ( 2nd `  A ) >.  /\  (
( 1st `  A
)  e.  B  /\  ( 2nd `  A )  e.  C ) ) )
5 elxp6 6341 . . . . 5  |-  ( A  e.  ( _V  X.  _V )  <->  ( A  = 
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  /\  (
( 1st `  A
)  e.  _V  /\  ( 2nd `  A )  e.  _V ) ) )
6 1stexg 6339 . . . . . . 7  |-  ( A  e.  _V  ->  ( 1st `  A )  e. 
_V )
7 2ndexg 6340 . . . . . . 7  |-  ( A  e.  _V  ->  ( 2nd `  A )  e. 
_V )
86, 7jca 306 . . . . . 6  |-  ( A  e.  _V  ->  (
( 1st `  A
)  e.  _V  /\  ( 2nd `  A )  e.  _V ) )
98biantrud 304 . . . . 5  |-  ( A  e.  _V  ->  ( A  =  <. ( 1st `  A ) ,  ( 2nd `  A )
>. 
<->  ( A  =  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  /\  ( ( 1st `  A )  e. 
_V  /\  ( 2nd `  A )  e.  _V ) ) ) )
105, 9bitr4id 199 . . . 4  |-  ( A  e.  _V  ->  ( A  e.  ( _V  X.  _V )  <->  A  =  <. ( 1st `  A
) ,  ( 2nd `  A ) >. )
)
1110anbi1d 465 . . 3  |-  ( A  e.  _V  ->  (
( 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
) ) ) )
124, 11bitr4id 199 . 2  |-  ( A  e.  _V  ->  ( A  e.  ( B  X.  C )  <->  ( A  e.  ( _V  X.  _V )  /\  ( ( 1st `  A )  e.  B  /\  ( 2nd `  A
)  e.  C ) ) ) )
131, 3, 12pm5.21nii 712 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:    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2202   _Vcvv 2803   <.cop 3676    X. cxp 4729   ` cfv 5333   1stc1st 6310   2ndc2nd 6311
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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-fo 5339  df-fv 5341  df-1st 6312  df-2nd 6313
This theorem is referenced by:  xp2  6345  unielxp  6346  1stconst  6395  2ndconst  6396  f1od2  6409
  Copyright terms: Public domain W3C validator