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

Theorem xpiindim 4873
Description: Distributive law for cross product over indexed intersection. (Contributed by Jim Kingdon, 7-Dec-2018.)
Assertion
Ref Expression
xpiindim  |-  ( E. y  y  e.  A  ->  ( C  X.  |^|_ x  e.  A  B )  =  |^|_ x  e.  A  ( C  X.  B
) )
Distinct variable groups:    x, y, A   
x, C, y
Allowed substitution hints:    B( x, y)

Proof of Theorem xpiindim
Dummy variables  z  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relxp 4841 . . . . . 6  |-  Rel  ( C  X.  B )
21rgenw 2588 . . . . 5  |-  A. x  e.  A  Rel  ( C  X.  B )
3 r19.2m 3583 . . . . 5  |-  ( ( E. y  y  e.  A  /\  A. x  e.  A  Rel  ( C  X.  B ) )  ->  E. x  e.  A  Rel  ( C  X.  B
) )
42, 3mpan2 425 . . . 4  |-  ( E. y  y  e.  A  ->  E. x  e.  A  Rel  ( C  X.  B
) )
5 reliin 4855 . . . 4  |-  ( E. x  e.  A  Rel  ( C  X.  B
)  ->  Rel  |^|_ x  e.  A  ( C  X.  B ) )
64, 5syl 14 . . 3  |-  ( E. y  y  e.  A  ->  Rel  |^|_ x  e.  A  ( C  X.  B
) )
7 relxp 4841 . . 3  |-  Rel  ( C  X.  |^|_ x  e.  A  B )
86, 7jctil 312 . 2  |-  ( E. y  y  e.  A  ->  ( Rel  ( C  X.  |^|_ x  e.  A  B )  /\  Rel  |^|_
x  e.  A  ( C  X.  B ) ) )
9 eleq1w 2292 . . . . . . . 8  |-  ( x  =  y  ->  (
x  e.  A  <->  y  e.  A ) )
109cbvexv 1967 . . . . . . 7  |-  ( E. x  x  e.  A  <->  E. y  y  e.  A
)
11 r19.28mv 3589 . . . . . . 7  |-  ( E. x  x  e.  A  ->  ( A. x  e.  A  ( w  e.  C  /\  z  e.  B )  <->  ( w  e.  C  /\  A. x  e.  A  z  e.  B ) ) )
1210, 11sylbir 135 . . . . . 6  |-  ( E. y  y  e.  A  ->  ( A. x  e.  A  ( w  e.  C  /\  z  e.  B )  <->  ( w  e.  C  /\  A. x  e.  A  z  e.  B ) ) )
1312bicomd 141 . . . . 5  |-  ( E. y  y  e.  A  ->  ( ( w  e.  C  /\  A. x  e.  A  z  e.  B )  <->  A. x  e.  A  ( w  e.  C  /\  z  e.  B ) ) )
14 eliin 3980 . . . . . . 7  |-  ( z  e.  _V  ->  (
z  e.  |^|_ x  e.  A  B  <->  A. x  e.  A  z  e.  B ) )
1514elv 2807 . . . . . 6  |-  ( z  e.  |^|_ x  e.  A  B 
<-> 
A. x  e.  A  z  e.  B )
1615anbi2i 457 . . . . 5  |-  ( ( w  e.  C  /\  z  e.  |^|_ x  e.  A  B )  <->  ( w  e.  C  /\  A. x  e.  A  z  e.  B ) )
17 opelxp 4761 . . . . . 6  |-  ( <.
w ,  z >.  e.  ( C  X.  B
)  <->  ( w  e.  C  /\  z  e.  B ) )
1817ralbii 2539 . . . . 5  |-  ( A. x  e.  A  <. w ,  z >.  e.  ( C  X.  B )  <->  A. x  e.  A  ( w  e.  C  /\  z  e.  B
) )
1913, 16, 183bitr4g 223 . . . 4  |-  ( E. y  y  e.  A  ->  ( ( w  e.  C  /\  z  e. 
|^|_ x  e.  A  B )  <->  A. x  e.  A  <. w ,  z >.  e.  ( C  X.  B ) ) )
20 opelxp 4761 . . . 4  |-  ( <.
w ,  z >.  e.  ( C  X.  |^|_ x  e.  A  B )  <-> 
( w  e.  C  /\  z  e.  |^|_ x  e.  A  B )
)
21 vex 2806 . . . . . 6  |-  w  e. 
_V
22 vex 2806 . . . . . 6  |-  z  e. 
_V
2321, 22opex 4327 . . . . 5  |-  <. w ,  z >.  e.  _V
24 eliin 3980 . . . . 5  |-  ( <.
w ,  z >.  e.  _V  ->  ( <. w ,  z >.  e.  |^|_ x  e.  A  ( C  X.  B )  <->  A. x  e.  A  <. w ,  z >.  e.  ( C  X.  B ) ) )
2523, 24ax-mp 5 . . . 4  |-  ( <.
w ,  z >.  e.  |^|_ x  e.  A  ( C  X.  B
)  <->  A. x  e.  A  <. w ,  z >.  e.  ( C  X.  B
) )
2619, 20, 253bitr4g 223 . . 3  |-  ( E. y  y  e.  A  ->  ( <. w ,  z
>.  e.  ( C  X.  |^|_
x  e.  A  B
)  <->  <. w ,  z
>.  e.  |^|_ x  e.  A  ( C  X.  B
) ) )
2726eqrelrdv2 4831 . 2  |-  ( ( ( Rel  ( C  X.  |^|_ x  e.  A  B )  /\  Rel  |^|_
x  e.  A  ( C  X.  B ) )  /\  E. y 
y  e.  A )  ->  ( C  X.  |^|_
x  e.  A  B
)  =  |^|_ x  e.  A  ( C  X.  B ) )
288, 27mpancom 422 1  |-  ( E. y  y  e.  A  ->  ( C  X.  |^|_ x  e.  A  B )  =  |^|_ x  e.  A  ( C  X.  B
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398   E.wex 1541    e. wcel 2202   A.wral 2511   E.wrex 2512   _Vcvv 2803   <.cop 3676   |^|_ciin 3976    X. cxp 4729   Rel wrel 4736
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-iin 3978  df-opab 4156  df-xp 4737  df-rel 4738
This theorem is referenced by:  xpriindim  4874
  Copyright terms: Public domain W3C validator