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

Theorem prdshom 17187
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 2739 . . 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 17177 . . 3 (𝜑𝐵 = X𝑥𝐼 (Base‘(𝑅𝑥)))
8 eqid 2739 . . . 4 (+g𝑃) = (+g𝑃)
91, 4, 5, 6, 3, 8prdsplusg 17178 . . 3 (𝜑 → (+g𝑃) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥)))))
10 eqid 2739 . . . 4 (.r𝑃) = (.r𝑃)
111, 4, 5, 6, 3, 10prdsmulr 17179 . . 3 (𝜑 → (.r𝑃) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))))
12 eqid 2739 . . . 4 ( ·𝑠𝑃) = ( ·𝑠𝑃)
131, 4, 5, 6, 3, 2, 12prdsvsca 17180 . . 3 (𝜑 → ( ·𝑠𝑃) = (𝑓 ∈ (Base‘𝑆), 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))))
14 eqidd 2740 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))))
15 eqid 2739 . . . 4 (TopSet‘𝑃) = (TopSet‘𝑃)
161, 4, 5, 6, 3, 15prdstset 17186 . . 3 (𝜑 → (TopSet‘𝑃) = (∏t‘(TopOpen ∘ 𝑅)))
17 eqid 2739 . . . 4 (le‘𝑃) = (le‘𝑃)
181, 4, 5, 6, 3, 17prdsle 17182 . . 3 (𝜑 → (le‘𝑃) = {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥𝐼 (𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))})
19 eqid 2739 . . . 4 (dist‘𝑃) = (dist‘𝑃)
201, 4, 5, 6, 3, 19prdsds 17184 . . 3 (𝜑 → (dist‘𝑃) = (𝑓𝐵, 𝑔𝐵 ↦ sup((ran (𝑥𝐼 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < )))
21 eqidd 2740 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))) = (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))))
22 eqidd 2740 . . 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 17175 . 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 17131 . 2 Hom = Slot (Hom ‘ndx)
26 ovssunirn 7320 . . . . . . . . . . 11 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran (Hom ‘(𝑅𝑥))
2725strfvss 16897 . . . . . . . . . . . . 13 (Hom ‘(𝑅𝑥)) ⊆ ran (𝑅𝑥)
28 fvssunirn 6812 . . . . . . . . . . . . . 14 (𝑅𝑥) ⊆ ran 𝑅
29 rnss 5851 . . . . . . . . . . . . . 14 ((𝑅𝑥) ⊆ ran 𝑅 → ran (𝑅𝑥) ⊆ ran ran 𝑅)
30 uniss 4848 . . . . . . . . . . . . . 14 (ran (𝑅𝑥) ⊆ ran ran 𝑅 ran (𝑅𝑥) ⊆ ran ran 𝑅)
3128, 29, 30mp2b 10 . . . . . . . . . . . . 13 ran (𝑅𝑥) ⊆ ran ran 𝑅
3227, 31sstri 3931 . . . . . . . . . . . 12 (Hom ‘(𝑅𝑥)) ⊆ ran ran 𝑅
33 rnss 5851 . . . . . . . . . . . 12 ((Hom ‘(𝑅𝑥)) ⊆ ran ran 𝑅 → ran (Hom ‘(𝑅𝑥)) ⊆ ran ran ran 𝑅)
34 uniss 4848 . . . . . . . . . . . 12 (ran (Hom ‘(𝑅𝑥)) ⊆ ran ran ran 𝑅 ran (Hom ‘(𝑅𝑥)) ⊆ ran ran ran 𝑅)
3532, 33, 34mp2b 10 . . . . . . . . . . 11 ran (Hom ‘(𝑅𝑥)) ⊆ ran ran ran 𝑅
3626, 35sstri 3931 . . . . . . . . . 10 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran ran ran 𝑅
3736rgenw 3077 . . . . . . . . 9 𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran ran ran 𝑅
38 ss2ixp 8707 . . . . . . . . 9 (∀𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran ran ran 𝑅X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ⊆ X𝑥𝐼 ran ran ran 𝑅)
3937, 38ax-mp 5 . . . . . . . 8 X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ⊆ X𝑥𝐼 ran ran ran 𝑅
405dmexd 7761 . . . . . . . . . 10 (𝜑 → dom 𝑅 ∈ V)
413, 40eqeltrrd 2841 . . . . . . . . 9 (𝜑𝐼 ∈ V)
42 rnexg 7760 . . . . . . . . . . . 12 (𝑅𝑊 → ran 𝑅 ∈ V)
43 uniexg 7602 . . . . . . . . . . . 12 (ran 𝑅 ∈ V → ran 𝑅 ∈ V)
445, 42, 433syl 18 . . . . . . . . . . 11 (𝜑 ran 𝑅 ∈ V)
45 rnexg 7760 . . . . . . . . . . 11 ( ran 𝑅 ∈ V → ran ran 𝑅 ∈ V)
46 uniexg 7602 . . . . . . . . . . 11 (ran ran 𝑅 ∈ V → ran ran 𝑅 ∈ V)
4744, 45, 463syl 18 . . . . . . . . . 10 (𝜑 ran ran 𝑅 ∈ V)
48 rnexg 7760 . . . . . . . . . 10 ( ran ran 𝑅 ∈ V → ran ran ran 𝑅 ∈ V)
49 uniexg 7602 . . . . . . . . . 10 (ran ran ran 𝑅 ∈ V → ran ran ran 𝑅 ∈ V)
5047, 48, 493syl 18 . . . . . . . . 9 (𝜑 ran ran ran 𝑅 ∈ V)
51 ixpconstg 8703 . . . . . . . . 9 ((𝐼 ∈ V ∧ ran ran ran 𝑅 ∈ V) → X𝑥𝐼 ran ran ran 𝑅 = ( ran ran ran 𝑅m 𝐼))
5241, 50, 51syl2anc 584 . . . . . . . 8 (𝜑X𝑥𝐼 ran ran ran 𝑅 = ( ran ran ran 𝑅m 𝐼))
5339, 52sseqtrid 3974 . . . . . . 7 (𝜑X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ( ran ran ran 𝑅m 𝐼))
54 ovex 7317 . . . . . . . 8 ( ran ran ran 𝑅m 𝐼) ∈ V
5554elpw2 5270 . . . . . . 7 (X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ( ran ran ran 𝑅m 𝐼) ↔ X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ( ran ran ran 𝑅m 𝐼))
5653, 55sylibr 233 . . . . . 6 (𝜑X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ( ran ran ran 𝑅m 𝐼))
5756ralrimivw 3105 . . . . 5 (𝜑 → ∀𝑔𝐵 X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ( ran ran ran 𝑅m 𝐼))
5857ralrimivw 3105 . . . 4 (𝜑 → ∀𝑓𝐵𝑔𝐵 X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ( ran ran ran 𝑅m 𝐼))
59 eqid 2739 . . . . 5 (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))) = (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))
6059fmpo 7917 . . . 4 (∀𝑓𝐵𝑔𝐵 X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ( ran ran ran 𝑅m 𝐼) ↔ (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))):(𝐵 × 𝐵)⟶𝒫 ( ran ran ran 𝑅m 𝐼))
6158, 60sylib 217 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))):(𝐵 × 𝐵)⟶𝒫 ( ran ran ran 𝑅m 𝐼))
626fvexi 6797 . . . . 5 𝐵 ∈ V
6362, 62xpex 7612 . . . 4 (𝐵 × 𝐵) ∈ V
6463a1i 11 . . 3 (𝜑 → (𝐵 × 𝐵) ∈ V)
6554pwex 5304 . . . 4 𝒫 ( ran ran ran 𝑅m 𝐼) ∈ V
6665a1i 11 . . 3 (𝜑 → 𝒫 ( ran ran ran 𝑅m 𝐼) ∈ V)
67 fex2 7789 . . 3 (((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))):(𝐵 × 𝐵)⟶𝒫 ( ran ran ran 𝑅m 𝐼) ∧ (𝐵 × 𝐵) ∈ V ∧ 𝒫 ( ran ran ran 𝑅m 𝐼) ∈ V) → (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))) ∈ V)
6861, 64, 66, 67syl3anc 1370 . 2 (𝜑 → (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))) ∈ V)
69 snsspr1 4748 . . . 4 {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩} ⊆ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩}
70 ssun2 4108 . . . 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 3931 . . 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 4108 . . 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 3931 . 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 17173 1 (𝜑𝐻 = (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1539  wcel 2107  wral 3065  Vcvv 3433  cun 3886  wss 3888  𝒫 cpw 4534  {csn 4562  {cpr 4564  {ctp 4566  cop 4568   cuni 4840  cmpt 5158   × cxp 5588  dom cdm 5590  ran crn 5591  wf 6433  cfv 6437  (class class class)co 7284  cmpo 7286  1st c1st 7838  2nd c2nd 7839  m cmap 8624  Xcixp 8694  ndxcnx 16903  Basecbs 16921  +gcplusg 16971  .rcmulr 16972  Scalarcsca 16974   ·𝑠 cvsca 16975  ·𝑖cip 16976  TopSetcts 16977  lecple 16978  distcds 16980  Hom chom 16982  compcco 16983   Σg cgsu 17160  Xscprds 17165
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2710  ax-sep 5224  ax-nul 5231  ax-pow 5289  ax-pr 5353  ax-un 7597  ax-cnex 10936  ax-resscn 10937  ax-1cn 10938  ax-icn 10939  ax-addcl 10940  ax-addrcl 10941  ax-mulcl 10942  ax-mulrcl 10943  ax-mulcom 10944  ax-addass 10945  ax-mulass 10946  ax-distr 10947  ax-i2m1 10948  ax-1ne0 10949  ax-1rid 10950  ax-rnegex 10951  ax-rrecex 10952  ax-cnre 10953  ax-pre-lttri 10954  ax-pre-lttrn 10955  ax-pre-ltadd 10956  ax-pre-mulgt0 10957
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ne 2945  df-nel 3051  df-ral 3070  df-rex 3071  df-reu 3073  df-rab 3074  df-v 3435  df-sbc 3718  df-csb 3834  df-dif 3891  df-un 3893  df-in 3895  df-ss 3905  df-pss 3907  df-nul 4258  df-if 4461  df-pw 4536  df-sn 4563  df-pr 4565  df-tp 4567  df-op 4569  df-uni 4841  df-iun 4927  df-br 5076  df-opab 5138  df-mpt 5159  df-tr 5193  df-id 5490  df-eprel 5496  df-po 5504  df-so 5505  df-fr 5545  df-we 5547  df-xp 5596  df-rel 5597  df-cnv 5598  df-co 5599  df-dm 5600  df-rn 5601  df-res 5602  df-ima 5603  df-pred 6206  df-ord 6273  df-on 6274  df-lim 6275  df-suc 6276  df-iota 6395  df-fun 6439  df-fn 6440  df-f 6441  df-f1 6442  df-fo 6443  df-f1o 6444  df-fv 6445  df-riota 7241  df-ov 7287  df-oprab 7288  df-mpo 7289  df-om 7722  df-1st 7840  df-2nd 7841  df-frecs 8106  df-wrecs 8137  df-recs 8211  df-rdg 8250  df-1o 8306  df-er 8507  df-map 8626  df-ixp 8695  df-en 8743  df-dom 8744  df-sdom 8745  df-fin 8746  df-sup 9210  df-pnf 11020  df-mnf 11021  df-xr 11022  df-ltxr 11023  df-le 11024  df-sub 11216  df-neg 11217  df-nn 11983  df-2 12045  df-3 12046  df-4 12047  df-5 12048  df-6 12049  df-7 12050  df-8 12051  df-9 12052  df-n0 12243  df-z 12329  df-dec 12447  df-uz 12592  df-fz 13249  df-struct 16857  df-slot 16892  df-ndx 16904  df-base 16922  df-plusg 16984  df-mulr 16985  df-sca 16987  df-vsca 16988  df-ip 16989  df-tset 16990  df-ple 16991  df-ds 16993  df-hom 16995  df-cco 16996  df-prds 17167
This theorem is referenced by:  prdsco  17188
  Copyright terms: Public domain W3C validator