MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  prdshom Structured version   Visualization version   GIF version

Theorem prdshom 17095
Description: Structure product hom-sets. (Contributed by Mario Carneiro, 7-Jan-2017.) (Revised by Thierry Arnoux, 16-Jun-2019.) (Revised by Zhi Wang, 18-Aug-2024.)
Hypotheses
Ref Expression
prdsbas.p 𝑃 = (𝑆Xs𝑅)
prdsbas.s (𝜑𝑆𝑉)
prdsbas.r (𝜑𝑅𝑊)
prdsbas.b 𝐵 = (Base‘𝑃)
prdsbas.i (𝜑 → dom 𝑅 = 𝐼)
prdshom.h 𝐻 = (Hom ‘𝑃)
Assertion
Ref Expression
prdshom (𝜑𝐻 = (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))))
Distinct variable groups:   𝑓,𝑔,𝑥,𝐵   𝜑,𝑓,𝑔,𝑥   𝑓,𝐼,𝑔,𝑥   𝑃,𝑓,𝑔,𝑥   𝑅,𝑓,𝑔,𝑥   𝑆,𝑓,𝑔,𝑥
Allowed substitution hints:   𝐻(𝑥,𝑓,𝑔)   𝑉(𝑥,𝑓,𝑔)   𝑊(𝑥,𝑓,𝑔)

Proof of Theorem prdshom
Dummy variables 𝑎 𝑐 𝑑 𝑒 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prdsbas.p . . 3 𝑃 = (𝑆Xs𝑅)
2 eqid 2738 . . 3 (Base‘𝑆) = (Base‘𝑆)
3 prdsbas.i . . 3 (𝜑 → dom 𝑅 = 𝐼)
4 prdsbas.s . . . 4 (𝜑𝑆𝑉)
5 prdsbas.r . . . 4 (𝜑𝑅𝑊)
6 prdsbas.b . . . 4 𝐵 = (Base‘𝑃)
71, 4, 5, 6, 3prdsbas 17085 . . 3 (𝜑𝐵 = X𝑥𝐼 (Base‘(𝑅𝑥)))
8 eqid 2738 . . . 4 (+g𝑃) = (+g𝑃)
91, 4, 5, 6, 3, 8prdsplusg 17086 . . 3 (𝜑 → (+g𝑃) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥)))))
10 eqid 2738 . . . 4 (.r𝑃) = (.r𝑃)
111, 4, 5, 6, 3, 10prdsmulr 17087 . . 3 (𝜑 → (.r𝑃) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))))
12 eqid 2738 . . . 4 ( ·𝑠𝑃) = ( ·𝑠𝑃)
131, 4, 5, 6, 3, 2, 12prdsvsca 17088 . . 3 (𝜑 → ( ·𝑠𝑃) = (𝑓 ∈ (Base‘𝑆), 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))))
14 eqidd 2739 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))))
15 eqid 2738 . . . 4 (TopSet‘𝑃) = (TopSet‘𝑃)
161, 4, 5, 6, 3, 15prdstset 17094 . . 3 (𝜑 → (TopSet‘𝑃) = (∏t‘(TopOpen ∘ 𝑅)))
17 eqid 2738 . . . 4 (le‘𝑃) = (le‘𝑃)
181, 4, 5, 6, 3, 17prdsle 17090 . . 3 (𝜑 → (le‘𝑃) = {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥𝐼 (𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))})
19 eqid 2738 . . . 4 (dist‘𝑃) = (dist‘𝑃)
201, 4, 5, 6, 3, 19prdsds 17092 . . 3 (𝜑 → (dist‘𝑃) = (𝑓𝐵, 𝑔𝐵 ↦ sup((ran (𝑥𝐼 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < )))
21 eqidd 2739 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))) = (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))))
22 eqidd 2739 . . 3 (𝜑 → (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥))))) = (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥))))))
231, 2, 3, 7, 9, 11, 13, 14, 16, 18, 20, 21, 22, 4, 5prdsval 17083 . 2 (𝜑𝑃 = (({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (.r𝑃)⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), ( ·𝑠𝑃)⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}) ∪ ({⟨(TopSet‘ndx), (TopSet‘𝑃)⟩, ⟨(le‘ndx), (le‘𝑃)⟩, ⟨(dist‘ndx), (dist‘𝑃)⟩} ∪ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩})))
24 prdshom.h . 2 𝐻 = (Hom ‘𝑃)
25 homid 17041 . 2 Hom = Slot (Hom ‘ndx)
26 ovssunirn 7291 . . . . . . . . . . 11 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran (Hom ‘(𝑅𝑥))
2725strfvss 16816 . . . . . . . . . . . . 13 (Hom ‘(𝑅𝑥)) ⊆ ran (𝑅𝑥)
28 fvssunirn 6785 . . . . . . . . . . . . . 14 (𝑅𝑥) ⊆ ran 𝑅
29 rnss 5837 . . . . . . . . . . . . . 14 ((𝑅𝑥) ⊆ ran 𝑅 → ran (𝑅𝑥) ⊆ ran ran 𝑅)
30 uniss 4844 . . . . . . . . . . . . . 14 (ran (𝑅𝑥) ⊆ ran ran 𝑅 ran (𝑅𝑥) ⊆ ran ran 𝑅)
3128, 29, 30mp2b 10 . . . . . . . . . . . . 13 ran (𝑅𝑥) ⊆ ran ran 𝑅
3227, 31sstri 3926 . . . . . . . . . . . 12 (Hom ‘(𝑅𝑥)) ⊆ ran ran 𝑅
33 rnss 5837 . . . . . . . . . . . 12 ((Hom ‘(𝑅𝑥)) ⊆ ran ran 𝑅 → ran (Hom ‘(𝑅𝑥)) ⊆ ran ran ran 𝑅)
34 uniss 4844 . . . . . . . . . . . 12 (ran (Hom ‘(𝑅𝑥)) ⊆ ran ran ran 𝑅 ran (Hom ‘(𝑅𝑥)) ⊆ ran ran ran 𝑅)
3532, 33, 34mp2b 10 . . . . . . . . . . 11 ran (Hom ‘(𝑅𝑥)) ⊆ ran ran ran 𝑅
3626, 35sstri 3926 . . . . . . . . . 10 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran ran ran 𝑅
3736rgenw 3075 . . . . . . . . 9 𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran ran ran 𝑅
38 ss2ixp 8656 . . . . . . . . 9 (∀𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran ran ran 𝑅X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ⊆ X𝑥𝐼 ran ran ran 𝑅)
3937, 38ax-mp 5 . . . . . . . 8 X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ⊆ X𝑥𝐼 ran ran ran 𝑅
405dmexd 7726 . . . . . . . . . 10 (𝜑 → dom 𝑅 ∈ V)
413, 40eqeltrrd 2840 . . . . . . . . 9 (𝜑𝐼 ∈ V)
42 rnexg 7725 . . . . . . . . . . . 12 (𝑅𝑊 → ran 𝑅 ∈ V)
43 uniexg 7571 . . . . . . . . . . . 12 (ran 𝑅 ∈ V → ran 𝑅 ∈ V)
445, 42, 433syl 18 . . . . . . . . . . 11 (𝜑 ran 𝑅 ∈ V)
45 rnexg 7725 . . . . . . . . . . 11 ( ran 𝑅 ∈ V → ran ran 𝑅 ∈ V)
46 uniexg 7571 . . . . . . . . . . 11 (ran ran 𝑅 ∈ V → ran ran 𝑅 ∈ V)
4744, 45, 463syl 18 . . . . . . . . . 10 (𝜑 ran ran 𝑅 ∈ V)
48 rnexg 7725 . . . . . . . . . 10 ( ran ran 𝑅 ∈ V → ran ran ran 𝑅 ∈ V)
49 uniexg 7571 . . . . . . . . . 10 (ran ran ran 𝑅 ∈ V → ran ran ran 𝑅 ∈ V)
5047, 48, 493syl 18 . . . . . . . . 9 (𝜑 ran ran ran 𝑅 ∈ V)
51 ixpconstg 8652 . . . . . . . . 9 ((𝐼 ∈ V ∧ ran ran ran 𝑅 ∈ V) → X𝑥𝐼 ran ran ran 𝑅 = ( ran ran ran 𝑅m 𝐼))
5241, 50, 51syl2anc 583 . . . . . . . 8 (𝜑X𝑥𝐼 ran ran ran 𝑅 = ( ran ran ran 𝑅m 𝐼))
5339, 52sseqtrid 3969 . . . . . . 7 (𝜑X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ( ran ran ran 𝑅m 𝐼))
54 ovex 7288 . . . . . . . 8 ( ran ran ran 𝑅m 𝐼) ∈ V
5554elpw2 5264 . . . . . . 7 (X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ( ran ran ran 𝑅m 𝐼) ↔ X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ( ran ran ran 𝑅m 𝐼))
5653, 55sylibr 233 . . . . . 6 (𝜑X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ( ran ran ran 𝑅m 𝐼))
5756ralrimivw 3108 . . . . 5 (𝜑 → ∀𝑔𝐵 X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ( ran ran ran 𝑅m 𝐼))
5857ralrimivw 3108 . . . 4 (𝜑 → ∀𝑓𝐵𝑔𝐵 X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ( ran ran ran 𝑅m 𝐼))
59 eqid 2738 . . . . 5 (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))) = (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))
6059fmpo 7881 . . . 4 (∀𝑓𝐵𝑔𝐵 X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ( ran ran ran 𝑅m 𝐼) ↔ (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))):(𝐵 × 𝐵)⟶𝒫 ( ran ran ran 𝑅m 𝐼))
6158, 60sylib 217 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))):(𝐵 × 𝐵)⟶𝒫 ( ran ran ran 𝑅m 𝐼))
626fvexi 6770 . . . . 5 𝐵 ∈ V
6362, 62xpex 7581 . . . 4 (𝐵 × 𝐵) ∈ V
6463a1i 11 . . 3 (𝜑 → (𝐵 × 𝐵) ∈ V)
6554pwex 5298 . . . 4 𝒫 ( ran ran ran 𝑅m 𝐼) ∈ V
6665a1i 11 . . 3 (𝜑 → 𝒫 ( ran ran ran 𝑅m 𝐼) ∈ V)
67 fex2 7754 . . 3 (((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))):(𝐵 × 𝐵)⟶𝒫 ( ran ran ran 𝑅m 𝐼) ∧ (𝐵 × 𝐵) ∈ V ∧ 𝒫 ( ran ran ran 𝑅m 𝐼) ∈ V) → (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))) ∈ V)
6861, 64, 66, 67syl3anc 1369 . 2 (𝜑 → (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))) ∈ V)
69 snsspr1 4744 . . . 4 {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩} ⊆ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩}
70 ssun2 4103 . . . 4 {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩} ⊆ ({⟨(TopSet‘ndx), (TopSet‘𝑃)⟩, ⟨(le‘ndx), (le‘𝑃)⟩, ⟨(dist‘ndx), (dist‘𝑃)⟩} ∪ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩})
7169, 70sstri 3926 . . 3 {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩} ⊆ ({⟨(TopSet‘ndx), (TopSet‘𝑃)⟩, ⟨(le‘ndx), (le‘𝑃)⟩, ⟨(dist‘ndx), (dist‘𝑃)⟩} ∪ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩})
72 ssun2 4103 . . 3 ({⟨(TopSet‘ndx), (TopSet‘𝑃)⟩, ⟨(le‘ndx), (le‘𝑃)⟩, ⟨(dist‘ndx), (dist‘𝑃)⟩} ∪ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩}) ⊆ (({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (.r𝑃)⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), ( ·𝑠𝑃)⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}) ∪ ({⟨(TopSet‘ndx), (TopSet‘𝑃)⟩, ⟨(le‘ndx), (le‘𝑃)⟩, ⟨(dist‘ndx), (dist‘𝑃)⟩} ∪ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩}))
7371, 72sstri 3926 . 2 {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩} ⊆ (({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (.r𝑃)⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), ( ·𝑠𝑃)⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}) ∪ ({⟨(TopSet‘ndx), (TopSet‘𝑃)⟩, ⟨(le‘ndx), (le‘𝑃)⟩, ⟨(dist‘ndx), (dist‘𝑃)⟩} ∪ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩}))
7423, 24, 25, 68, 73prdsbaslem 17081 1 (𝜑𝐻 = (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1539  wcel 2108  wral 3063  Vcvv 3422  cun 3881  wss 3883  𝒫 cpw 4530  {csn 4558  {cpr 4560  {ctp 4562  cop 4564   cuni 4836  cmpt 5153   × cxp 5578  dom cdm 5580  ran crn 5581  wf 6414  cfv 6418  (class class class)co 7255  cmpo 7257  1st c1st 7802  2nd c2nd 7803  m cmap 8573  Xcixp 8643  ndxcnx 16822  Basecbs 16840  +gcplusg 16888  .rcmulr 16889  Scalarcsca 16891   ·𝑠 cvsca 16892  ·𝑖cip 16893  TopSetcts 16894  lecple 16895  distcds 16897  Hom chom 16899  compcco 16900   Σg cgsu 17068  Xscprds 17073
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-1cn 10860  ax-icn 10861  ax-addcl 10862  ax-addrcl 10863  ax-mulcl 10864  ax-mulrcl 10865  ax-mulcom 10866  ax-addass 10867  ax-mulass 10868  ax-distr 10869  ax-i2m1 10870  ax-1ne0 10871  ax-1rid 10872  ax-rnegex 10873  ax-rrecex 10874  ax-cnre 10875  ax-pre-lttri 10876  ax-pre-lttrn 10877  ax-pre-ltadd 10878  ax-pre-mulgt0 10879
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-1o 8267  df-er 8456  df-map 8575  df-ixp 8644  df-en 8692  df-dom 8693  df-sdom 8694  df-fin 8695  df-sup 9131  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-le 10946  df-sub 11137  df-neg 11138  df-nn 11904  df-2 11966  df-3 11967  df-4 11968  df-5 11969  df-6 11970  df-7 11971  df-8 11972  df-9 11973  df-n0 12164  df-z 12250  df-dec 12367  df-uz 12512  df-fz 13169  df-struct 16776  df-slot 16811  df-ndx 16823  df-base 16841  df-plusg 16901  df-mulr 16902  df-sca 16904  df-vsca 16905  df-ip 16906  df-tset 16907  df-ple 16908  df-ds 16910  df-hom 16912  df-cco 16913  df-prds 17075
This theorem is referenced by:  prdsco  17096
  Copyright terms: Public domain W3C validator