Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  brcart Structured version   Unicode version

Theorem brcart 28100
Description: Binary relationship form of the cartesian product operator. (Contributed by Scott Fenton, 11-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
Hypotheses
Ref Expression
brcart.1  |-  A  e. 
_V
brcart.2  |-  B  e. 
_V
brcart.3  |-  C  e. 
_V
Assertion
Ref Expression
brcart  |-  ( <. A ,  B >.Cart C  <-> 
C  =  ( A  X.  B ) )

Proof of Theorem brcart
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 opex 4657 . 2  |-  <. A ,  B >.  e.  _V
2 brcart.3 . 2  |-  C  e. 
_V
3 df-cart 28032 . 2  |- Cart  =  ( ( ( _V  X.  _V )  X.  _V )  \  ran  ( ( _V 
(x)  _E  )(++) (pprod (  _E  ,  _E  )  (x)  _V ) ) )
4 brcart.1 . . . 4  |-  A  e. 
_V
5 brcart.2 . . . 4  |-  B  e. 
_V
64, 5opelvv 4986 . . 3  |-  <. A ,  B >.  e.  ( _V 
X.  _V )
7 brxp 4971 . . 3  |-  ( <. A ,  B >. ( ( _V  X.  _V )  X.  _V ) C  <-> 
( <. A ,  B >.  e.  ( _V  X.  _V )  /\  C  e. 
_V ) )
86, 2, 7mpbir2an 911 . 2  |-  <. A ,  B >. ( ( _V 
X.  _V )  X.  _V ) C
9 3anass 969 . . . . 5  |-  ( ( x  =  <. y ,  z >.  /\  y  _E  A  /\  z  _E  B )  <->  ( x  =  <. y ,  z
>.  /\  ( y  _E  A  /\  z  _E  B ) ) )
104epelc 4735 . . . . . . 7  |-  ( y  _E  A  <->  y  e.  A )
115epelc 4735 . . . . . . 7  |-  ( z  _E  B  <->  z  e.  B )
1210, 11anbi12i 697 . . . . . 6  |-  ( ( y  _E  A  /\  z  _E  B )  <->  ( y  e.  A  /\  z  e.  B )
)
1312anbi2i 694 . . . . 5  |-  ( ( x  =  <. y ,  z >.  /\  (
y  _E  A  /\  z  _E  B )
)  <->  ( x  = 
<. y ,  z >.  /\  ( y  e.  A  /\  z  e.  B
) ) )
149, 13bitri 249 . . . 4  |-  ( ( x  =  <. y ,  z >.  /\  y  _E  A  /\  z  _E  B )  <->  ( x  =  <. y ,  z
>.  /\  ( y  e.  A  /\  z  e.  B ) ) )
15142exbii 1636 . . 3  |-  ( E. y E. z ( x  =  <. y ,  z >.  /\  y  _E  A  /\  z  _E  B )  <->  E. y E. z ( x  = 
<. y ,  z >.  /\  ( y  e.  A  /\  z  e.  B
) ) )
16 vex 3074 . . . 4  |-  x  e. 
_V
1716, 4, 5brpprod3b 28055 . . 3  |-  ( xpprod (  _E  ,  _E  ) <. A ,  B >.  <->  E. y E. z ( x  =  <. y ,  z >.  /\  y  _E  A  /\  z  _E  B ) )
18 elxp 4958 . . 3  |-  ( x  e.  ( A  X.  B )  <->  E. y E. z ( x  = 
<. y ,  z >.  /\  ( y  e.  A  /\  z  e.  B
) ) )
1915, 17, 183bitr4ri 278 . 2  |-  ( x  e.  ( A  X.  B )  <->  xpprod (  _E  ,  _E  ) <. A ,  B >. )
201, 2, 3, 8, 19brtxpsd3 28064 1  |-  ( <. A ,  B >.Cart C  <-> 
C  =  ( A  X.  B ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    /\ wa 369    /\ w3a 965    = wceq 1370   E.wex 1587    e. wcel 1758   _Vcvv 3071   <.cop 3984   class class class wbr 4393    _E cep 4731    X. cxp 4939  pprodcpprod 27998  Cartccart 28008
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-8 1760  ax-9 1762  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1952  ax-ext 2430  ax-sep 4514  ax-nul 4522  ax-pow 4571  ax-pr 4632  ax-un 6475
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-eu 2264  df-mo 2265  df-clab 2437  df-cleq 2443  df-clel 2446  df-nfc 2601  df-ne 2646  df-ral 2800  df-rex 2801  df-rab 2804  df-v 3073  df-sbc 3288  df-dif 3432  df-un 3434  df-in 3436  df-ss 3443  df-nul 3739  df-if 3893  df-sn 3979  df-pr 3981  df-op 3985  df-uni 4193  df-br 4394  df-opab 4452  df-mpt 4453  df-eprel 4733  df-id 4737  df-xp 4947  df-rel 4948  df-cnv 4949  df-co 4950  df-dm 4951  df-rn 4952  df-res 4953  df-iota 5482  df-fun 5521  df-fn 5522  df-f 5523  df-fo 5525  df-fv 5527  df-1st 6680  df-2nd 6681  df-symdif 27986  df-txp 28021  df-pprod 28022  df-cart 28032
This theorem is referenced by:  brimg  28105  brrestrict  28117
  Copyright terms: Public domain W3C validator