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

Theorem xpcom 5150
Description: Composition of two cross products. (Contributed by Jim Kingdon, 20-Dec-2018.)
Assertion
Ref Expression
xpcom  |-  ( E. x  x  e.  B  ->  ( ( B  X.  C )  o.  ( A  X.  B ) )  =  ( A  X.  C ) )
Distinct variable groups:    x, A    x, B    x, C

Proof of Theorem xpcom
Dummy variables  a  c are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ibar 299 . . . 4  |-  ( E. x  x  e.  B  ->  ( ( a  e.  A  /\  c  e.  C )  <->  ( E. x  x  e.  B  /\  ( a  e.  A  /\  c  e.  C
) ) ) )
2 ancom 264 . . . . . . . 8  |-  ( ( a  e.  A  /\  x  e.  B )  <->  ( x  e.  B  /\  a  e.  A )
)
32anbi1i 454 . . . . . . 7  |-  ( ( ( a  e.  A  /\  x  e.  B
)  /\  ( x  e.  B  /\  c  e.  C ) )  <->  ( (
x  e.  B  /\  a  e.  A )  /\  ( x  e.  B  /\  c  e.  C
) ) )
4 brxp 4635 . . . . . . . 8  |-  ( a ( A  X.  B
) x  <->  ( a  e.  A  /\  x  e.  B ) )
5 brxp 4635 . . . . . . . 8  |-  ( x ( B  X.  C
) c  <->  ( x  e.  B  /\  c  e.  C ) )
64, 5anbi12i 456 . . . . . . 7  |-  ( ( a ( A  X.  B ) x  /\  x ( B  X.  C ) c )  <-> 
( ( a  e.  A  /\  x  e.  B )  /\  (
x  e.  B  /\  c  e.  C )
) )
7 anandi 580 . . . . . . 7  |-  ( ( x  e.  B  /\  ( a  e.  A  /\  c  e.  C
) )  <->  ( (
x  e.  B  /\  a  e.  A )  /\  ( x  e.  B  /\  c  e.  C
) ) )
83, 6, 73bitr4i 211 . . . . . 6  |-  ( ( a ( A  X.  B ) x  /\  x ( B  X.  C ) c )  <-> 
( x  e.  B  /\  ( a  e.  A  /\  c  e.  C
) ) )
98exbii 1593 . . . . 5  |-  ( E. x ( a ( A  X.  B ) x  /\  x ( B  X.  C ) c )  <->  E. x
( x  e.  B  /\  ( a  e.  A  /\  c  e.  C
) ) )
10 19.41v 1890 . . . . 5  |-  ( E. x ( x  e.  B  /\  ( a  e.  A  /\  c  e.  C ) )  <->  ( E. x  x  e.  B  /\  ( a  e.  A  /\  c  e.  C
) ) )
119, 10bitr2i 184 . . . 4  |-  ( ( E. x  x  e.  B  /\  ( a  e.  A  /\  c  e.  C ) )  <->  E. x
( a ( A  X.  B ) x  /\  x ( B  X.  C ) c ) )
121, 11bitr2di 196 . . 3  |-  ( E. x  x  e.  B  ->  ( E. x ( a ( A  X.  B ) x  /\  x ( B  X.  C ) c )  <-> 
( a  e.  A  /\  c  e.  C
) ) )
1312opabbidv 4048 . 2  |-  ( E. x  x  e.  B  ->  { <. a ,  c
>.  |  E. x
( a ( A  X.  B ) x  /\  x ( B  X.  C ) c ) }  =  { <. a ,  c >.  |  ( a  e.  A  /\  c  e.  C ) } )
14 df-co 4613 . 2  |-  ( ( B  X.  C )  o.  ( A  X.  B ) )  =  { <. a ,  c
>.  |  E. x
( a ( A  X.  B ) x  /\  x ( B  X.  C ) c ) }
15 df-xp 4610 . 2  |-  ( A  X.  C )  =  { <. a ,  c
>.  |  ( a  e.  A  /\  c  e.  C ) }
1613, 14, 153eqtr4g 2224 1  |-  ( E. x  x  e.  B  ->  ( ( B  X.  C )  o.  ( A  X.  B ) )  =  ( A  X.  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1343   E.wex 1480    e. wcel 2136   class class class wbr 3982   {copab 4042    X. cxp 4602    o. ccom 4608
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-br 3983  df-opab 4044  df-xp 4610  df-co 4613
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator