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

Theorem prdsvsca 17657
Description: Scalar multiplication in a structure product. (Contributed by Stefan O'Rear, 5-Jan-2015.) (Revised by Mario Carneiro, 15-Aug-2015.) (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 𝑅 = 𝐼)
prdsvsca.k 𝐾 = (Base‘𝑆)
prdsvsca.m · = ( ·𝑠 ‘𝑃)
Assertion
Ref Expression
prdsvsca (𝜑 → · = (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)))))
Distinct variable groups:   𝑓,𝑔,𝑥,𝐵   𝑓,𝐾,𝑔   𝜑,𝑓,𝑔,𝑥   𝑓,𝐼,𝑔,𝑥   𝑃,𝑓,𝑔,𝑥   𝑅,𝑓,𝑔,𝑥   𝑆,𝑓,𝑔,𝑥
Allowed substitution hints:   · (𝑥, 𝑓, 𝑔)   𝐾(𝑥)   𝑉(𝑥, 𝑓, 𝑔)   𝑊(𝑥, 𝑓, 𝑔)

Proof of Theorem prdsvsca
Dummy variables 𝑎 𝑐 𝑑 𝑒 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prdsbas.p . . 3 𝑃 = (𝑆Xs𝑅)
2 prdsvsca.k . . 3 𝐾 = (Base‘𝑆)
3 prdsbas.i . . 3 (𝜑 → dom 𝑅 = 𝐼)
4 prdsbas.s . . . 4 (𝜑 → 𝑆 ∈ 𝑉)
5 prdsbas.r . . . 4 (𝜑 → 𝑅 ∈ 𝑊)
6 prdsbas.b . . . 4 𝐵 = (Base‘𝑃)
71, 4, 5, 6, 3prdsbas 17654 . . 3 (𝜑 → 𝐵 = X𝑥 ∈ 𝐼 (Base‘(𝑅‘𝑥)))
8 eqid 2763 . . . 4 (+g‘𝑃) = (+g‘𝑃)
91, 4, 5, 6, 3, 8prdsplusg 17655 . . 3 (𝜑 → (+g‘𝑃) = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+g‘(𝑅‘𝑥))(𝑔‘𝑥)))))
10 eqid 2763 . . . 4 (.r‘𝑃) = (.r‘𝑃)
111, 4, 5, 6, 3, 10prdsmulr 17656 . . 3 (𝜑 → (.r‘𝑃) = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(.r‘(𝑅‘𝑥))(𝑔‘𝑥)))))
12 eqidd 2764 . . 3 (𝜑 → (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)))) = (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)))))
13 eqidd 2764 . . 3 (𝜑 → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑆 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘(𝑅‘𝑥))(𝑔‘𝑥))))) = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑆 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘(𝑅‘𝑥))(𝑔‘𝑥))))))
14 eqidd 2764 . . 3 (𝜑 → (∏t‘(TopOpen ∘ 𝑅)) = (∏t‘(TopOpen ∘ 𝑅)))
15 eqidd 2764 . . 3 (𝜑 → {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))} = {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))})
16 eqidd 2764 . . 3 (𝜑 → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(dist‘(𝑅‘𝑥))(𝑔‘𝑥))) ∪ {0}), ℝ*, < )) = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(dist‘(𝑅‘𝑥))(𝑔‘𝑥))) ∪ {0}), ℝ*, < )))
17 eqidd 2764 . . 3 (𝜑 → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥))) = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥))))
18 eqidd 2764 . . 3 (𝜑 → (𝑎 ∈ (𝐵 × 𝐵), 𝑐 ∈ 𝐵 ↦ (𝑑 ∈ ((2nd ‘𝑎)(𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))𝑐), 𝑒 ∈ ((𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))‘𝑎) ↦ (𝑥 ∈ 𝐼 ↦ ((𝑑‘𝑥)(⟨((1st ‘𝑎)‘𝑥), ((2nd ‘𝑎)‘𝑥)⟩(comp‘(𝑅‘𝑥))(𝑐‘𝑥))(𝑒‘𝑥))))) = (𝑎 ∈ (𝐵 × 𝐵), 𝑐 ∈ 𝐵 ↦ (𝑑 ∈ ((2nd ‘𝑎)(𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))𝑐), 𝑒 ∈ ((𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))‘𝑎) ↦ (𝑥 ∈ 𝐼 ↦ ((𝑑‘𝑥)(⟨((1st ‘𝑎)‘𝑥), ((2nd ‘𝑎)‘𝑥)⟩(comp‘(𝑅‘𝑥))(𝑐‘𝑥))(𝑒‘𝑥))))))
191, 2, 3, 7, 9, 11, 12, 13, 14, 15, 16, 17, 18, 4, 5prdsval 17652 . 2 (𝜑 → 𝑃 = (({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g‘𝑃)⟩, ⟨(.r‘ndx), (.r‘𝑃)⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑆 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘(𝑅‘𝑥))(𝑔‘𝑥)))))⟩}) ∪ ({⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))}⟩, ⟨(dist‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(dist‘(𝑅‘𝑥))(𝑔‘𝑥))) ∪ {0}), ℝ*, < ))⟩} ∪ {⟨(Hom ‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐 ∈ 𝐵 ↦ (𝑑 ∈ ((2nd ‘𝑎)(𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))𝑐), 𝑒 ∈ ((𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))‘𝑎) ↦ (𝑥 ∈ 𝐼 ↦ ((𝑑‘𝑥)(⟨((1st ‘𝑎)‘𝑥), ((2nd ‘𝑎)‘𝑥)⟩(comp‘(𝑅‘𝑥))(𝑐‘𝑥))(𝑒‘𝑥)))))⟩})))
20 prdsvsca.m . 2 · = ( ·𝑠 ‘𝑃)
21 vscaid 17517 . 2 ·𝑠 = Slot ( ·𝑠 ‘ndx)
22 ovssunirn 7476 . . . . . . . . . . 11 (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)) ⊆ ∪ ran ( ·𝑠 ‘(𝑅‘𝑥))
2321strfvss 17391 . . . . . . . . . . . . 13 ( ·𝑠 ‘(𝑅‘𝑥)) ⊆ ∪ ran (𝑅‘𝑥)
24 fvssunirn 6936 . . . . . . . . . . . . . 14 (𝑅‘𝑥) ⊆ ∪ ran 𝑅
25 rnss 5927 . . . . . . . . . . . . . 14 ((𝑅‘𝑥) ⊆ ∪ ran 𝑅 → ran (𝑅‘𝑥) ⊆ ran ∪ ran 𝑅)
26 uniss 4878 . . . . . . . . . . . . . 14 (ran (𝑅‘𝑥) ⊆ ran ∪ ran 𝑅 → ∪ ran (𝑅‘𝑥) ⊆ ∪ ran ∪ ran 𝑅)
2724, 25, 26mp2b 10 . . . . . . . . . . . . 13 ∪ ran (𝑅‘𝑥) ⊆ ∪ ran ∪ ran 𝑅
2823, 27sstri 3922 . . . . . . . . . . . 12 ( ·𝑠 ‘(𝑅‘𝑥)) ⊆ ∪ ran ∪ ran 𝑅
29 rnss 5927 . . . . . . . . . . . 12 (( ·𝑠 ‘(𝑅‘𝑥)) ⊆ ∪ ran ∪ ran 𝑅 → ran ( ·𝑠 ‘(𝑅‘𝑥)) ⊆ ran ∪ ran ∪ ran 𝑅)
30 uniss 4878 . . . . . . . . . . . 12 (ran ( ·𝑠 ‘(𝑅‘𝑥)) ⊆ ran ∪ ran ∪ ran 𝑅 → ∪ ran ( ·𝑠 ‘(𝑅‘𝑥)) ⊆ ∪ ran ∪ ran ∪ ran 𝑅)
3128, 29, 30mp2b 10 . . . . . . . . . . 11 ∪ ran ( ·𝑠 ‘(𝑅‘𝑥)) ⊆ ∪ ran ∪ ran ∪ ran 𝑅
3222, 31sstri 3922 . . . . . . . . . 10 (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)) ⊆ ∪ ran ∪ ran ∪ ran 𝑅
33 ovex 7473 . . . . . . . . . . 11 (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)) ∈ V
3433elpw 4564 . . . . . . . . . 10 ((𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)) ∈ 𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↔ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)) ⊆ ∪ ran ∪ ran ∪ ran 𝑅)
3532, 34mpbir 234 . . . . . . . . 9 (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)) ∈ 𝒫 ∪ ran ∪ ran ∪ ran 𝑅
3635a1i 11 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)) ∈ 𝒫 ∪ ran ∪ ran ∪ ran 𝑅)
3736fmpttd 7136 . . . . . . 7 (𝜑 → (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))):𝐼⟶𝒫 ∪ ran ∪ ran ∪ ran 𝑅)
38 rnexg 7935 . . . . . . . . . . 11 (𝑅 ∈ 𝑊 → ran 𝑅 ∈ V)
39 uniexg 7778 . . . . . . . . . . 11 (ran 𝑅 ∈ V → ∪ ran 𝑅 ∈ V)
405, 38, 393syl 19 . . . . . . . . . 10 (𝜑 → ∪ ran 𝑅 ∈ V)
41 rnexg 7935 . . . . . . . . . 10 (∪ ran 𝑅 ∈ V → ran ∪ ran 𝑅 ∈ V)
42 uniexg 7778 . . . . . . . . . 10 (ran ∪ ran 𝑅 ∈ V → ∪ ran ∪ ran 𝑅 ∈ V)
4340, 41, 423syl 19 . . . . . . . . 9 (𝜑 → ∪ ran ∪ ran 𝑅 ∈ V)
44 rnexg 7935 . . . . . . . . 9 (∪ ran ∪ ran 𝑅 ∈ V → ran ∪ ran ∪ ran 𝑅 ∈ V)
45 uniexg 7778 . . . . . . . . 9 (ran ∪ ran ∪ ran 𝑅 ∈ V → ∪ ran ∪ ran ∪ ran 𝑅 ∈ V)
46 pwexg 5344 . . . . . . . . 9 (∪ ran ∪ ran ∪ ran 𝑅 ∈ V → 𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ∈ V)
4743, 44, 45, 464syl 20 . . . . . . . 8 (𝜑 → 𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ∈ V)
485dmexd 7936 . . . . . . . . 9 (𝜑 → dom 𝑅 ∈ V)
493, 48eqeltrrd 2865 . . . . . . . 8 (𝜑 → 𝐼 ∈ V)
5047, 49elmapd 8885 . . . . . . 7 (𝜑 → ((𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))) ∈ (𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑m 𝐼) ↔ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))):𝐼⟶𝒫 ∪ ran ∪ ran ∪ ran 𝑅))
5137, 50mpbird 260 . . . . . 6 (𝜑 → (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))) ∈ (𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑m 𝐼))
5251ralrimivw 3162 . . . . 5 (𝜑 → ∀𝑔 ∈ 𝐵 (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))) ∈ (𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑m 𝐼))
5352ralrimivw 3162 . . . 4 (𝜑 → ∀𝑓 ∈ 𝐾 ∀𝑔 ∈ 𝐵 (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))) ∈ (𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑m 𝐼))
54 eqid 2763 . . . . 5 (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)))) = (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))))
5554fmpo 8101 . . . 4 (∀𝑓 ∈ 𝐾 ∀𝑔 ∈ 𝐵 (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))) ∈ (𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑m 𝐼) ↔ (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)))):(𝐾 × 𝐵)⟶(𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑m 𝐼))
5653, 55sylib 221 . . 3 (𝜑 → (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)))):(𝐾 × 𝐵)⟶(𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑m 𝐼))
572fvexi 6919 . . . . 5 𝐾 ∈ V
586fvexi 6919 . . . . 5 𝐵 ∈ V
5957, 58xpex 7788 . . . 4 (𝐾 × 𝐵) ∈ V
60 ovex 7473 . . . 4 (𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑m 𝐼) ∈ V
61 fex2 7969 . . . 4 (((𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)))):(𝐾 × 𝐵)⟶(𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑m 𝐼) ∧ (𝐾 × 𝐵) ∈ V ∧ (𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑m 𝐼) ∈ V) → (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)))) ∈ V)
6259, 60, 61mp3an23 1483 . . 3 ((𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)))):(𝐾 × 𝐵)⟶(𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑m 𝐼) → (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)))) ∈ V)
6356, 62syl 18 . 2 (𝜑 → (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)))) ∈ V)
64 snsstp2 4776 . . . 4 {⟨( ·𝑠 ‘ndx), (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩} ⊆ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑆 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘(𝑅‘𝑥))(𝑔‘𝑥)))))⟩}
65 ssun2 4180 . . . 4 {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑆 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘(𝑅‘𝑥))(𝑔‘𝑥)))))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g‘𝑃)⟩, ⟨(.r‘ndx), (.r‘𝑃)⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑆 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘(𝑅‘𝑥))(𝑔‘𝑥)))))⟩})
6664, 65sstri 3922 . . 3 {⟨( ·𝑠 ‘ndx), (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g‘𝑃)⟩, ⟨(.r‘ndx), (.r‘𝑃)⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑆 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘(𝑅‘𝑥))(𝑔‘𝑥)))))⟩})
67 ssun1 4179 . . 3 ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g‘𝑃)⟩, ⟨(.r‘ndx), (.r‘𝑃)⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑆 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘(𝑅‘𝑥))(𝑔‘𝑥)))))⟩}) ⊆ (({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g‘𝑃)⟩, ⟨(.r‘ndx), (.r‘𝑃)⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑆 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘(𝑅‘𝑥))(𝑔‘𝑥)))))⟩}) ∪ ({⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))}⟩, ⟨(dist‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(dist‘(𝑅‘𝑥))(𝑔‘𝑥))) ∪ {0}), ℝ*, < ))⟩} ∪ {⟨(Hom ‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐 ∈ 𝐵 ↦ (𝑑 ∈ ((2nd ‘𝑎)(𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))𝑐), 𝑒 ∈ ((𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))‘𝑎) ↦ (𝑥 ∈ 𝐼 ↦ ((𝑑‘𝑥)(⟨((1st ‘𝑎)‘𝑥), ((2nd ‘𝑎)‘𝑥)⟩(comp‘(𝑅‘𝑥))(𝑐‘𝑥))(𝑒‘𝑥)))))⟩}))
6866, 67sstri 3922 . 2 {⟨( ·𝑠 ‘ndx), (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩} ⊆ (({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g‘𝑃)⟩, ⟨(.r‘ndx), (.r‘𝑃)⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑆 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘(𝑅‘𝑥))(𝑔‘𝑥)))))⟩}) ∪ ({⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))}⟩, ⟨(dist‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(dist‘(𝑅‘𝑥))(𝑔‘𝑥))) ∪ {0}), ℝ*, < ))⟩} ∪ {⟨(Hom ‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐 ∈ 𝐵 ↦ (𝑑 ∈ ((2nd ‘𝑎)(𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))𝑐), 𝑒 ∈ ((𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))‘𝑎) ↦ (𝑥 ∈ 𝐼 ↦ ((𝑑‘𝑥)(⟨((1st ‘𝑎)‘𝑥), ((2nd ‘𝑎)‘𝑥)⟩(comp‘(𝑅‘𝑥))(𝑐‘𝑥))(𝑒‘𝑥)))))⟩}))
6919, 20, 21, 63, 68prdsbaslem 17650 1 (𝜑 → · = (𝑓 ∈ 𝐾, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ⊆ wss 3900   ∪ cun 4152  𝒫 cpw 4560  {csn 4588  {cpr 4590  {ctp 4592  ⟨cop 4838  ∪ cuni 4870   class class class wbr 5106  {copab 5170   ↦ cmpt 5189   × cxp 5653  dom cdm 5655  ran crn 5656   ∘ ccom 5659  ⟶wf 6551  ‘cfv 6555  (class class class)co 7440   ∈ cmpo 7442  1st c1st 8020  2nd c2nd 8021   ↑m cmap 8872  Xcixp 8950  supcsup 9456  0cc0 11224  ℝ*cxr 11366   < clt 11367  ndxcnx 17397  Basecbs 17413  +gcplusg 17454  .rcmulr 17455  Scalarcsca 17457   ·𝑠 cvsca 17458  ·𝑖cip 17459  TopSetcts 17460  lecple 17461  distcds 17463  Hom chom 17465  compcco 17466  TopOpenctopn 17618  ∏tcpt 17635   Σg cgsu 17637  Xscprds 17642
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-cnex 11280  ax-resscn 11281  ax-1cn 11282  ax-icn 11283  ax-addcl 11284  ax-addrcl 11285  ax-mulcl 11286  ax-mulrcl 11287  ax-mulcom 11288  ax-addass 11289  ax-mulass 11290  ax-distr 11291  ax-i2m1 11292  ax-1ne0 11293  ax-1rid 11294  ax-rnegex 11295  ax-rrecex 11296  ax-cnre 11297  ax-pre-lttri 11298  ax-pre-lttrn 11299  ax-pre-ltadd 11300  ax-pre-mulgt0 11301
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-om 7899  df-1st 8022  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-1o 8501  df-er 8742  df-map 8874  df-ixp 8951  df-en 8999  df-dom 9000  df-sdom 9001  df-fin 9002  df-sup 9458  df-pnf 11369  df-mnf 11370  df-xr 11371  df-ltxr 11372  df-le 11373  df-sub 11567  df-neg 11568  df-nn 12360  df-2 12429  df-3 12430  df-4 12431  df-5 12432  df-6 12433  df-7 12434  df-8 12435  df-9 12436  df-n0 12631  df-z 12718  df-dec 12839  df-uz 12990  df-fz 13664  df-struct 17351  df-slot 17386  df-ndx 17398  df-base 17414  df-plusg 17467  df-mulr 17468  df-sca 17470  df-vsca 17471  df-ip 17472  df-tset 17473  df-ple 17474  df-ds 17476  df-hom 17478  df-cco 17479  df-prds 17644
This theorem is used by:  prdsle  17659  prdsds  17661  prdstset  17663  prdshom  17664  prdsco  17665  prdsvscaval  17676
  Copyright terms: Public domain W3C validator