Theorem reldmprds 12735

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.

Step	Hyp	Ref	Expression
1		df-prds 12734	. 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 ) ) ) ) ) >. } ) ) )
2	1	reldmmpo 6000	1 |- Rel dom X_s

Syntax hints:   /\ wa 104   A.wral 2465   _Vcvv 2749   [_csb 3069   u. cun 3139   C_ wss 3141   {csn 3604   {cpr 3605   {ctp 3606   <.cop 3607   class class class wbr 4015   {copab 4075   |-> cmpt 4076   X. cxp 4636   dom cdm 4638   ran crn 4639   o. ccom 4642   Rel wrel 4643   ` cfv 5228  (class class class)co 5888   e. cmpo 5890   1stc1st 6153   2ndc2nd 6154   X_cixp 6712   supcsup 6995   0cc0 7825   RR*cxr 8005   < clt 8006   ndxcnx 12473   Basecbs 12476   +g cplusg 12551   .rcmulr 12552  Scalarcsca 12554   .scvsca 12555   .icip 12556  TopSetcts 12557   lecple 12558   distcds 12560   Hom chom 12562  compcco 12563   TopOpenctopn 12707   Xt_cpt 12722   gsum_g cgsu 12724   X__scprds 12732

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 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-14 2161  ax-ext 2169  ax-sep 4133  ax-pow 4186  ax-pr 4221

This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ral 2470  df-rex 2471  df-v 2751  df-un 3145  df-in 3147  df-ss 3154  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-br 4016  df-opab 4077  df-xp 4644  df-rel 4645  df-dm 4648  df-oprab 5892  df-mpo 5893  df-prds 12734

This theorem is referenced by: (None)