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

Theorem reldmprds 14113
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 14112 . 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.  ( ( 2nd `  a ) h c ) ,  e  e.  ( h `
 a )  |->  ( x  e.  dom  r  |->  ( ( d `  x ) ( <.
( ( 1st `  a
) `  x ) ,  ( ( 2nd `  a ) `  x
) >. (comp `  (
r `  x )
) ( c `  x ) ) ( e `  x ) ) ) ) )
>. } ) ) )
21reldmmpo 6173 1  |-  Rel  dom  X_s
Colors of variables: wff set class
Syntax hints:    /\ wa 104   A.wral 2522   _Vcvv 2815   [_csb 3141    u. cun 3212    C_ wss 3214   {csn 3694   {cpr 3695   {ctp 3696   <.cop 3697   class class class wbr 4114   {copab 4175    |-> cmpt 4176    X. cxp 4752   dom cdm 4754   ran crn 4755    o. ccom 4758   Rel wrel 4759   ` cfv 5357  (class class class)co 6058    e. cmpo 6060   1stc1st 6345   2ndc2nd 6346   X_cixp 6946   supcsup 7286   0cc0 8143   RR*cxr 8323    < clt 8324   ndxcnx 13293   Basecbs 13296   +g cplusg 13374   .rcmulr 13375  Scalarcsca 13377   .scvsca 13378   .icip 13379  TopSetcts 13380   lecple 13381   distcds 13383   Hom chom 13385  compcco 13386   TopOpenctopn 13537   Xt_cpt 13552    gsumg cgsu 13554   X_scprds 14111
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 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-br 4115  df-opab 4177  df-xp 4760  df-rel 4761  df-dm 4764  df-oprab 6062  df-mpo 6063  df-prds 14112
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator