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

Theorem dfxp3 5840
Description: Define the cross product of three classes. Compare df-xp 4369. (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 170 . . 3  |-  ( u  =  <. x ,  y
>.  ->  ( z  e.  C  <->  z  e.  C
) )
21dfoprab4 5838 . 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 4369 . 2  |-  ( ( A  X.  B )  X.  C )  =  { <. u ,  z
>.  |  ( u  e.  ( A  X.  B
)  /\  z  e.  C ) }
4 df-3an 921 . . 3  |-  ( ( x  e.  A  /\  y  e.  B  /\  z  e.  C )  <->  ( ( x  e.  A  /\  y  e.  B
)  /\  z  e.  C ) )
54oprabbii 5580 . 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 2111 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 102    /\ w3a 919    = wceq 1284    e. wcel 1433   <.cop 3401   {copab 3838    X. cxp 4361   {coprab 5533
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964  ax-un 4188
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-sbc 2816  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-fo 4928  df-fv 4930  df-oprab 5536  df-1st 5787  df-2nd 5788
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator