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

Theorem dfxp3 6340
Description: Define the cross product of three classes. Compare df-xp 4725. (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 6338 . 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 4725 . 2  |-  ( ( A  X.  B )  X.  C )  =  { <. u ,  z
>.  |  ( u  e.  ( A  X.  B
)  /\  z  e.  C ) }
4 df-3an 1004 . . 3  |-  ( ( x  e.  A  /\  y  e.  B  /\  z  e.  C )  <->  ( ( x  e.  A  /\  y  e.  B
)  /\  z  e.  C ) )
54oprabbii 6059 . 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 2260 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 1002    = wceq 1395    e. wcel 2200   <.cop 3669   {copab 4144    X. cxp 4717   {coprab 6002
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-sbc 3029  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-fo 5324  df-fv 5326  df-oprab 6005  df-1st 6286  df-2nd 6287
This theorem is referenced by:  mpomulf  8136
  Copyright terms: Public domain W3C validator