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

Theorem dfxp3 6279
Description: Define the cross product of three classes. Compare df-xp 4680. (Contributed by FL, 6-Nov-2013.) (Proof shortened by Mario Carneiro, 3-Nov-2015.)
Assertion
Ref Expression
dfxp3  |-  ( ( A  X.  B )  X.  C )  =  { <. <. x ,  y
>. ,  z >.  |  ( x  e.  A  /\  y  e.  B  /\  z  e.  C
) }
Distinct variable groups:    x, y, z, A    x, B, y, z    x, C, y, z

Proof of Theorem dfxp3
Dummy variable  u is distinct from all other variables.
StepHypRef Expression
1 biidd 172 . . 3  |-  ( u  =  <. x ,  y
>.  ->  ( z  e.  C  <->  z  e.  C
) )
21dfoprab4 6277 . 2  |-  { <. u ,  z >.  |  ( u  e.  ( A  X.  B )  /\  z  e.  C ) }  =  { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  A  /\  y  e.  B )  /\  z  e.  C
) }
3 df-xp 4680 . 2  |-  ( ( A  X.  B )  X.  C )  =  { <. u ,  z
>.  |  ( u  e.  ( A  X.  B
)  /\  z  e.  C ) }
4 df-3an 982 . . 3  |-  ( ( x  e.  A  /\  y  e.  B  /\  z  e.  C )  <->  ( ( x  e.  A  /\  y  e.  B
)  /\  z  e.  C ) )
54oprabbii 5999 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ( x  e.  A  /\  y  e.  B  /\  z  e.  C ) }  =  { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  A  /\  y  e.  B )  /\  z  e.  C
) }
62, 3, 53eqtr4i 2235 1  |-  ( ( A  X.  B )  X.  C )  =  { <. <. x ,  y
>. ,  z >.  |  ( x  e.  A  /\  y  e.  B  /\  z  e.  C
) }
Colors of variables: wff set class
Syntax hints:    /\ wa 104    /\ w3a 980    = wceq 1372    e. wcel 2175   <.cop 3635   {copab 4103    X. cxp 4672   {coprab 5944
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 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252  ax-un 4479
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-v 2773  df-sbc 2998  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-opab 4105  df-mpt 4106  df-id 4339  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-iota 5231  df-fun 5272  df-fn 5273  df-f 5274  df-fo 5276  df-fv 5278  df-oprab 5947  df-1st 6225  df-2nd 6226
This theorem is referenced by:  mpomulf  8061
  Copyright terms: Public domain W3C validator