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

Theorem xpcom 5283
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 301 . . . 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 266 . . . . . . . 8  |-  ( ( a  e.  A  /\  x  e.  B )  <->  ( x  e.  B  /\  a  e.  A )
)
32anbi1i 458 . . . . . . 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 4756 . . . . . . . 8  |-  ( a ( A  X.  B
) x  <->  ( a  e.  A  /\  x  e.  B ) )
5 brxp 4756 . . . . . . . 8  |-  ( x ( B  X.  C
) c  <->  ( x  e.  B  /\  c  e.  C ) )
64, 5anbi12i 460 . . . . . . 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 594 . . . . . . 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 212 . . . . . 6  |-  ( ( a ( A  X.  B ) x  /\  x ( B  X.  C ) c )  <-> 
( x  e.  B  /\  ( a  e.  A  /\  c  e.  C
) ) )
98exbii 1653 . . . . 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 1951 . . . . 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 185 . . . 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 197 . . 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 4155 . 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 4734 . 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 4731 . 2  |-  ( A  X.  C )  =  { <. a ,  c
>.  |  ( a  e.  A  /\  c  e.  C ) }
1613, 14, 153eqtr4g 2289 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 104    = wceq 1397   E.wex 1540    e. wcel 2202   class class class wbr 4088   {copab 4149    X. cxp 4723    o. ccom 4729
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-xp 4731  df-co 4734
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator