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

Theorem prdsvsca 17394
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 17391 . . 3 (𝜑𝐵 = X𝑥𝐼 (Base‘(𝑅𝑥)))
8 eqid 2737 . . . 4 (+g𝑃) = (+g𝑃)
91, 4, 5, 6, 3, 8prdsplusg 17392 . . 3 (𝜑 → (+g𝑃) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥)))))
10 eqid 2737 . . . 4 (.r𝑃) = (.r𝑃)
111, 4, 5, 6, 3, 10prdsmulr 17393 . . 3 (𝜑 → (.r𝑃) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))))
12 eqidd 2738 . . 3 (𝜑 → (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))))
13 eqidd 2738 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))))
14 eqidd 2738 . . 3 (𝜑 → (∏t‘(TopOpen ∘ 𝑅)) = (∏t‘(TopOpen ∘ 𝑅)))
15 eqidd 2738 . . 3 (𝜑 → {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥𝐼 (𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))} = {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥𝐼 (𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))})
16 eqidd 2738 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ sup((ran (𝑥𝐼 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < )) = (𝑓𝐵, 𝑔𝐵 ↦ sup((ran (𝑥𝐼 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < )))
17 eqidd 2738 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))) = (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))))
18 eqidd 2738 . . 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 17389 . 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 17254 . 2 ·𝑠 = Slot ( ·𝑠 ‘ndx)
22 ovssunirn 7406 . . . . . . . . . . 11 (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran ( ·𝑠 ‘(𝑅𝑥))
2321strfvss 17128 . . . . . . . . . . . . 13 ( ·𝑠 ‘(𝑅𝑥)) ⊆ ran (𝑅𝑥)
24 fvssunirn 6875 . . . . . . . . . . . . . 14 (𝑅𝑥) ⊆ ran 𝑅
25 rnss 5898 . . . . . . . . . . . . . 14 ((𝑅𝑥) ⊆ ran 𝑅 → ran (𝑅𝑥) ⊆ ran ran 𝑅)
26 uniss 4873 . . . . . . . . . . . . . 14 (ran (𝑅𝑥) ⊆ ran ran 𝑅 ran (𝑅𝑥) ⊆ ran ran 𝑅)
2724, 25, 26mp2b 10 . . . . . . . . . . . . 13 ran (𝑅𝑥) ⊆ ran ran 𝑅
2823, 27sstri 3945 . . . . . . . . . . . 12 ( ·𝑠 ‘(𝑅𝑥)) ⊆ ran ran 𝑅
29 rnss 5898 . . . . . . . . . . . 12 (( ·𝑠 ‘(𝑅𝑥)) ⊆ ran ran 𝑅 → ran ( ·𝑠 ‘(𝑅𝑥)) ⊆ ran ran ran 𝑅)
30 uniss 4873 . . . . . . . . . . . 12 (ran ( ·𝑠 ‘(𝑅𝑥)) ⊆ ran ran ran 𝑅 ran ( ·𝑠 ‘(𝑅𝑥)) ⊆ ran ran ran 𝑅)
3128, 29, 30mp2b 10 . . . . . . . . . . 11 ran ( ·𝑠 ‘(𝑅𝑥)) ⊆ ran ran ran 𝑅
3222, 31sstri 3945 . . . . . . . . . 10 (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran ran ran 𝑅
33 ovex 7403 . . . . . . . . . . 11 (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)) ∈ V
3433elpw 4560 . . . . . . . . . 10 ((𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ran ran ran 𝑅 ↔ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran ran ran 𝑅)
3532, 34mpbir 231 . . . . . . . . 9 (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ran ran ran 𝑅
3635a1i 11 . . . . . . . 8 ((𝜑𝑥𝐼) → (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ran ran ran 𝑅)
3736fmpttd 7071 . . . . . . 7 (𝜑 → (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))):𝐼⟶𝒫 ran ran ran 𝑅)
38 rnexg 7856 . . . . . . . . . . 11 (𝑅𝑊 → ran 𝑅 ∈ V)
39 uniexg 7697 . . . . . . . . . . 11 (ran 𝑅 ∈ V → ran 𝑅 ∈ V)
405, 38, 393syl 18 . . . . . . . . . 10 (𝜑 ran 𝑅 ∈ V)
41 rnexg 7856 . . . . . . . . . 10 ( ran 𝑅 ∈ V → ran ran 𝑅 ∈ V)
42 uniexg 7697 . . . . . . . . . 10 (ran ran 𝑅 ∈ V → ran ran 𝑅 ∈ V)
4340, 41, 423syl 18 . . . . . . . . 9 (𝜑 ran ran 𝑅 ∈ V)
44 rnexg 7856 . . . . . . . . 9 ( ran ran 𝑅 ∈ V → ran ran ran 𝑅 ∈ V)
45 uniexg 7697 . . . . . . . . 9 (ran ran ran 𝑅 ∈ V → ran ran ran 𝑅 ∈ V)
46 pwexg 5327 . . . . . . . . 9 ( ran ran ran 𝑅 ∈ V → 𝒫 ran ran ran 𝑅 ∈ V)
4743, 44, 45, 464syl 19 . . . . . . . 8 (𝜑 → 𝒫 ran ran ran 𝑅 ∈ V)
485dmexd 7857 . . . . . . . . 9 (𝜑 → dom 𝑅 ∈ V)
493, 48eqeltrrd 2838 . . . . . . . 8 (𝜑𝐼 ∈ V)
5047, 49elmapd 8791 . . . . . . 7 (𝜑 → ((𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅m 𝐼) ↔ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))):𝐼⟶𝒫 ran ran ran 𝑅))
5137, 50mpbird 257 . . . . . 6 (𝜑 → (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅m 𝐼))
5251ralrimivw 3134 . . . . 5 (𝜑 → ∀𝑔𝐵 (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅m 𝐼))
5352ralrimivw 3134 . . . 4 (𝜑 → ∀𝑓𝐾𝑔𝐵 (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅m 𝐼))
54 eqid 2737 . . . . 5 (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))
5554fmpo 8024 . . . 4 (∀𝑓𝐾𝑔𝐵 (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅m 𝐼) ↔ (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))):(𝐾 × 𝐵)⟶(𝒫 ran ran ran 𝑅m 𝐼))
5653, 55sylib 218 . . 3 (𝜑 → (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))):(𝐾 × 𝐵)⟶(𝒫 ran ran ran 𝑅m 𝐼))
572fvexi 6858 . . . . 5 𝐾 ∈ V
586fvexi 6858 . . . . 5 𝐵 ∈ V
5957, 58xpex 7710 . . . 4 (𝐾 × 𝐵) ∈ V
60 ovex 7403 . . . 4 (𝒫 ran ran ran 𝑅m 𝐼) ∈ V
61 fex2 7890 . . . 4 (((𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))):(𝐾 × 𝐵)⟶(𝒫 ran ran ran 𝑅m 𝐼) ∧ (𝐾 × 𝐵) ∈ V ∧ (𝒫 ran ran ran 𝑅m 𝐼) ∈ V) → (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))) ∈ V)
6259, 60, 61mp3an23 1456 . . 3 ((𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))):(𝐾 × 𝐵)⟶(𝒫 ran ran ran 𝑅m 𝐼) → (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))) ∈ V)
6356, 62syl 17 . 2 (𝜑 → (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))) ∈ V)
64 snsstp2 4775 . . . 4 {⟨( ·𝑠 ‘ndx), (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩} ⊆ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}
65 ssun2 4133 . . . 4 {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (.r𝑃)⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩})
6664, 65sstri 3945 . . 3 {⟨( ·𝑠 ‘ndx), (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (.r𝑃)⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩})
67 ssun1 4132 . . 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 3945 . 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 17387 1 (𝜑· = (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  wral 3052  Vcvv 3442  cun 3901  wss 3903  𝒫 cpw 4556  {csn 4582  {cpr 4584  {ctp 4586  cop 4588   cuni 4865   class class class wbr 5100  {copab 5162  cmpt 5181   × cxp 5632  dom cdm 5634  ran crn 5635  ccom 5638  wf 6498  cfv 6502  (class class class)co 7370  cmpo 7372  1st c1st 7943  2nd c2nd 7944  m cmap 8777  Xcixp 8849  supcsup 9357  0cc0 11040  *cxr 11179   < clt 11180  ndxcnx 17134  Basecbs 17150  +gcplusg 17191  .rcmulr 17192  Scalarcsca 17194   ·𝑠 cvsca 17195  ·𝑖cip 17196  TopSetcts 17197  lecple 17198  distcds 17200  Hom chom 17202  compcco 17203  TopOpenctopn 17355  tcpt 17372   Σg cgsu 17374  Xscprds 17379
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692  ax-cnex 11096  ax-resscn 11097  ax-1cn 11098  ax-icn 11099  ax-addcl 11100  ax-addrcl 11101  ax-mulcl 11102  ax-mulrcl 11103  ax-mulcom 11104  ax-addass 11105  ax-mulass 11106  ax-distr 11107  ax-i2m1 11108  ax-1ne0 11109  ax-1rid 11110  ax-rnegex 11111  ax-rrecex 11112  ax-cnre 11113  ax-pre-lttri 11114  ax-pre-lttrn 11115  ax-pre-ltadd 11116  ax-pre-mulgt0 11117
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5529  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5587  df-we 5589  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-pred 6269  df-ord 6330  df-on 6331  df-lim 6332  df-suc 6333  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-riota 7327  df-ov 7373  df-oprab 7374  df-mpo 7375  df-om 7821  df-1st 7945  df-2nd 7946  df-frecs 8235  df-wrecs 8266  df-recs 8315  df-rdg 8353  df-1o 8409  df-er 8647  df-map 8779  df-ixp 8850  df-en 8898  df-dom 8899  df-sdom 8900  df-fin 8901  df-sup 9359  df-pnf 11182  df-mnf 11183  df-xr 11184  df-ltxr 11185  df-le 11186  df-sub 11380  df-neg 11381  df-nn 12160  df-2 12222  df-3 12223  df-4 12224  df-5 12225  df-6 12226  df-7 12227  df-8 12228  df-9 12229  df-n0 12416  df-z 12503  df-dec 12622  df-uz 12766  df-fz 13438  df-struct 17088  df-slot 17123  df-ndx 17135  df-base 17151  df-plusg 17204  df-mulr 17205  df-sca 17207  df-vsca 17208  df-ip 17209  df-tset 17210  df-ple 17211  df-ds 17213  df-hom 17215  df-cco 17216  df-prds 17381
This theorem is referenced by:  prdsle  17396  prdsds  17398  prdstset  17400  prdshom  17401  prdsco  17402  prdsvscaval  17413
  Copyright terms: Public domain W3C validator