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

Theorem reldmprds 12605
Description: The structure product is a well-behaved binary operator. (Contributed by Stefan O'Rear, 7-Jan-2015.) (Revised by Thierry Arnoux, 15-Jun-2019.)
Assertion
Ref Expression
reldmprds  |-  Rel  dom  X_s

Proof of Theorem reldmprds
Dummy variables  a  c  d  e  f  g  h  s  r  x  v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-prds 12604 . 2  |-  X_s  =  (
s  e.  _V , 
r  e.  _V  |->  [_ X_ x  e.  dom  r
( Base `  ( r `  x ) )  / 
v ]_ [_ ( f  e.  v ,  g  e.  v  |->  X_ x  e.  dom  r ( ( f `  x ) ( Hom  `  (
r `  x )
) ( g `  x ) ) )  /  h ]_ (
( { <. ( Base `  ndx ) ,  v >. ,  <. ( +g  `  ndx ) ,  ( f  e.  v ,  g  e.  v 
|->  ( x  e.  dom  r  |->  ( ( f `
 x ) ( +g  `  ( r `
 x ) ) ( g `  x
) ) ) )
>. ,  <. ( .r
`  ndx ) ,  ( f  e.  v ,  g  e.  v  |->  ( x  e.  dom  r  |->  ( ( f `  x ) ( .r
`  ( r `  x ) ) ( g `  x ) ) ) ) >. }  u.  { <. (Scalar ` 
ndx ) ,  s
>. ,  <. ( .s
`  ndx ) ,  ( f  e.  ( Base `  s ) ,  g  e.  v  |->  ( x  e.  dom  r  |->  ( f ( .s `  ( r `  x
) ) ( g `
 x ) ) ) ) >. ,  <. ( .i `  ndx ) ,  ( f  e.  v ,  g  e.  v  |->  ( s  gsumg  ( x  e.  dom  r  |->  ( ( f `  x
) ( .i `  ( r `  x
) ) ( g `
 x ) ) ) ) ) >. } )  u.  ( { <. (TopSet `  ndx ) ,  ( Xt_ `  ( TopOpen  o.  r )
) >. ,  <. ( le `  ndx ) ,  { <. f ,  g
>.  |  ( {
f ,  g } 
C_  v  /\  A. x  e.  dom  r ( f `  x ) ( le `  (
r `  x )
) ( g `  x ) ) }
>. ,  <. ( dist `  ndx ) ,  ( f  e.  v ,  g  e.  v  |->  sup ( ( ran  (
x  e.  dom  r  |->  ( ( f `  x ) ( dist `  ( r `  x
) ) ( g `
 x ) ) )  u.  { 0 } ) ,  RR* ,  <  ) ) >. }  u.  { <. ( Hom  `  ndx ) ,  h >. ,  <. (comp ` 
ndx ) ,  ( a  e.  ( v  X.  v ) ,  c  e.  v  |->  ( d  e.  ( c h ( 2nd `  a
) ) ,  e  e.  ( h `  a )  |->  ( x  e.  dom  r  |->  ( ( d `  x
) ( <. (
( 1st `  a
) `  x ) ,  ( ( 2nd `  a ) `  x
) >. (comp `  (
r `  x )
) ( c `  x ) ) ( e `  x ) ) ) ) )
>. } ) ) )
21reldmmpo 5964 1  |-  Rel  dom  X_s
Colors of variables: wff set class
Syntax hints:    /\ wa 103   A.wral 2448   _Vcvv 2730   [_csb 3049    u. cun 3119    C_ wss 3121   {csn 3583   {cpr 3584   {ctp 3585   <.cop 3586   class class class wbr 3989   {copab 4049    |-> cmpt 4050    X. cxp 4609   dom cdm 4611   ran crn 4612    o. ccom 4615   Rel wrel 4616   ` cfv 5198  (class class class)co 5853    e. cmpo 5855   1stc1st 6117   2ndc2nd 6118   X_cixp 6676   supcsup 6959   0cc0 7774   RR*cxr 7953    < clt 7954   ndxcnx 12413   Basecbs 12416   +g cplusg 12480   .rcmulr 12481  Scalarcsca 12483   .scvsca 12484   .icip 12485  TopSetcts 12486   lecple 12487   distcds 12489   Hom chom 12491  compcco 12492   TopOpenctopn 12580   Xt_cpt 12595    gsumg cgsu 12597   X_scprds 12602
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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-br 3990  df-opab 4051  df-xp 4617  df-rel 4618  df-dm 4621  df-oprab 5857  df-mpo 5858  df-prds 12604
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator