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

Theorem prdsmulr 16722
 Description: Multiplication in a structure product. (Contributed by Mario Carneiro, 11-Jan-2015.) (Revised by Mario Carneiro, 15-Aug-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.)
Hypotheses
Ref Expression
prdsbas.p 𝑃 = (𝑆Xs𝑅)
prdsbas.s (𝜑𝑆𝑉)
prdsbas.r (𝜑𝑅𝑊)
prdsbas.b 𝐵 = (Base‘𝑃)
prdsbas.i (𝜑 → dom 𝑅 = 𝐼)
prdsmulr.t · = (.r𝑃)
Assertion
Ref Expression
prdsmulr (𝜑· = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))))
Distinct variable groups:   𝑓,𝑔,𝑥,𝐵   𝜑,𝑓,𝑔,𝑥   𝑓,𝐼,𝑔,𝑥   𝑃,𝑓,𝑔,𝑥   𝑅,𝑓,𝑔,𝑥   𝑆,𝑓,𝑔,𝑥
Allowed substitution hints:   · (𝑥,𝑓,𝑔)   𝑉(𝑥,𝑓,𝑔)   𝑊(𝑥,𝑓,𝑔)

Proof of Theorem prdsmulr
Dummy variables 𝑎 𝑐 𝑑 𝑒 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prdsbas.p . . 3 𝑃 = (𝑆Xs𝑅)
2 eqid 2826 . . 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 16720 . . 3 (𝜑𝐵 = X𝑥𝐼 (Base‘(𝑅𝑥)))
8 eqid 2826 . . . 4 (+g𝑃) = (+g𝑃)
91, 4, 5, 6, 3, 8prdsplusg 16721 . . 3 (𝜑 → (+g𝑃) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥)))))
10 eqidd 2827 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))))
11 eqidd 2827 . . 3 (𝜑 → (𝑓 ∈ (Base‘𝑆), 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓 ∈ (Base‘𝑆), 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))))
12 eqidd 2827 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))))
13 eqidd 2827 . . 3 (𝜑 → (∏t‘(TopOpen ∘ 𝑅)) = (∏t‘(TopOpen ∘ 𝑅)))
14 eqidd 2827 . . 3 (𝜑 → {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥𝐼 (𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))} = {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥𝐼 (𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))})
15 eqidd 2827 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ sup((ran (𝑥𝐼 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < )) = (𝑓𝐵, 𝑔𝐵 ↦ sup((ran (𝑥𝐼 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < )))
16 eqidd 2827 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))) = (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))))
17 eqidd 2827 . . 3 (𝜑 → (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ (𝑐(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))(2nd𝑎)), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥))))) = (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ (𝑐(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))(2nd𝑎)), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥))))))
181, 2, 3, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 4, 5prdsval 16718 . 2 (𝜑𝑃 = (({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}) ∪ ({⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥𝐼 (𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))}⟩, ⟨(dist‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ sup((ran (𝑥𝐼 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < ))⟩} ∪ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ (𝑐(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))(2nd𝑎)), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩})))
19 prdsmulr.t . 2 · = (.r𝑃)
20 mulrid 16606 . 2 .r = Slot (.r‘ndx)
21 ovssunirn 7184 . . . . . . . . . . 11 ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran (.r‘(𝑅𝑥))
2220strfvss 16496 . . . . . . . . . . . . 13 (.r‘(𝑅𝑥)) ⊆ ran (𝑅𝑥)
23 fvssunirn 6696 . . . . . . . . . . . . . 14 (𝑅𝑥) ⊆ ran 𝑅
24 rnss 5808 . . . . . . . . . . . . . 14 ((𝑅𝑥) ⊆ ran 𝑅 → ran (𝑅𝑥) ⊆ ran ran 𝑅)
25 uniss 4858 . . . . . . . . . . . . . 14 (ran (𝑅𝑥) ⊆ ran ran 𝑅 ran (𝑅𝑥) ⊆ ran ran 𝑅)
2623, 24, 25mp2b 10 . . . . . . . . . . . . 13 ran (𝑅𝑥) ⊆ ran ran 𝑅
2722, 26sstri 3980 . . . . . . . . . . . 12 (.r‘(𝑅𝑥)) ⊆ ran ran 𝑅
28 rnss 5808 . . . . . . . . . . . 12 ((.r‘(𝑅𝑥)) ⊆ ran ran 𝑅 → ran (.r‘(𝑅𝑥)) ⊆ ran ran ran 𝑅)
29 uniss 4858 . . . . . . . . . . . 12 (ran (.r‘(𝑅𝑥)) ⊆ ran ran ran 𝑅 ran (.r‘(𝑅𝑥)) ⊆ ran ran ran 𝑅)
3027, 28, 29mp2b 10 . . . . . . . . . . 11 ran (.r‘(𝑅𝑥)) ⊆ ran ran ran 𝑅
3121, 30sstri 3980 . . . . . . . . . 10 ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran ran ran 𝑅
32 ovex 7181 . . . . . . . . . . 11 ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)) ∈ V
3332elpw 4549 . . . . . . . . . 10 (((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ran ran ran 𝑅 ↔ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran ran ran 𝑅)
3431, 33mpbir 232 . . . . . . . . 9 ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ran ran ran 𝑅
3534a1i 11 . . . . . . . 8 ((𝜑𝑥𝐼) → ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ran ran ran 𝑅)
3635fmpttd 6875 . . . . . . 7 (𝜑 → (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))):𝐼⟶𝒫 ran ran ran 𝑅)
37 rnexg 7602 . . . . . . . . . . . 12 (𝑅𝑊 → ran 𝑅 ∈ V)
38 uniexg 7457 . . . . . . . . . . . 12 (ran 𝑅 ∈ V → ran 𝑅 ∈ V)
395, 37, 383syl 18 . . . . . . . . . . 11 (𝜑 ran 𝑅 ∈ V)
40 rnexg 7602 . . . . . . . . . . 11 ( ran 𝑅 ∈ V → ran ran 𝑅 ∈ V)
41 uniexg 7457 . . . . . . . . . . 11 (ran ran 𝑅 ∈ V → ran ran 𝑅 ∈ V)
4239, 40, 413syl 18 . . . . . . . . . 10 (𝜑 ran ran 𝑅 ∈ V)
43 rnexg 7602 . . . . . . . . . 10 ( ran ran 𝑅 ∈ V → ran ran ran 𝑅 ∈ V)
44 uniexg 7457 . . . . . . . . . 10 (ran ran ran 𝑅 ∈ V → ran ran ran 𝑅 ∈ V)
4542, 43, 443syl 18 . . . . . . . . 9 (𝜑 ran ran ran 𝑅 ∈ V)
4645pwexd 5277 . . . . . . . 8 (𝜑 → 𝒫 ran ran ran 𝑅 ∈ V)
475dmexd 7603 . . . . . . . . 9 (𝜑 → dom 𝑅 ∈ V)
483, 47eqeltrrd 2919 . . . . . . . 8 (𝜑𝐼 ∈ V)
4946, 48elmapd 8410 . . . . . . 7 (𝜑 → ((𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅m 𝐼) ↔ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))):𝐼⟶𝒫 ran ran ran 𝑅))
5036, 49mpbird 258 . . . . . 6 (𝜑 → (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅m 𝐼))
5150ralrimivw 3188 . . . . 5 (𝜑 → ∀𝑔𝐵 (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅m 𝐼))
5251ralrimivw 3188 . . . 4 (𝜑 → ∀𝑓𝐵𝑔𝐵 (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅m 𝐼))
53 eqid 2826 . . . . 5 (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))
5453fmpo 7757 . . . 4 (∀𝑓𝐵𝑔𝐵 (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅m 𝐼) ↔ (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))):(𝐵 × 𝐵)⟶(𝒫 ran ran ran 𝑅m 𝐼))
5552, 54sylib 219 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))):(𝐵 × 𝐵)⟶(𝒫 ran ran ran 𝑅m 𝐼))
566fvexi 6681 . . . . 5 𝐵 ∈ V
5756, 56xpex 7465 . . . 4 (𝐵 × 𝐵) ∈ V
58 ovex 7181 . . . 4 (𝒫 ran ran ran 𝑅m 𝐼) ∈ V
59 fex2 7626 . . . 4 (((𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))):(𝐵 × 𝐵)⟶(𝒫 ran ran ran 𝑅m 𝐼) ∧ (𝐵 × 𝐵) ∈ V ∧ (𝒫 ran ran ran 𝑅m 𝐼) ∈ V) → (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))) ∈ V)
6057, 58, 59mp3an23 1446 . . 3 ((𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))):(𝐵 × 𝐵)⟶(𝒫 ran ran ran 𝑅m 𝐼) → (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))) ∈ V)
6155, 60syl 17 . 2 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))) ∈ V)
62 snsstp3 4750 . . . 4 {⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ⊆ {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩}
63 ssun1 4152 . . . 4 {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩})
6462, 63sstri 3980 . . 3 {⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩})
65 ssun1 4152 . . 3 ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}) ⊆ (({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}) ∪ ({⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥𝐼 (𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))}⟩, ⟨(dist‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ sup((ran (𝑥𝐼 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < ))⟩} ∪ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ (𝑐(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))(2nd𝑎)), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩}))
6664, 65sstri 3980 . 2 {⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ⊆ (({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}) ∪ ({⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥𝐼 (𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))}⟩, ⟨(dist‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ sup((ran (𝑥𝐼 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < ))⟩} ∪ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ (𝑐(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))(2nd𝑎)), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩}))
6718, 19, 20, 61, 66prdsvallem 16717 1 (𝜑· = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 396   = wceq 1530   ∈ wcel 2107  ∀wral 3143  Vcvv 3500   ∪ cun 3938   ⊆ wss 3940  𝒫 cpw 4542  {csn 4564  {cpr 4566  {ctp 4568  ⟨cop 4570  ∪ cuni 4837   class class class wbr 5063  {copab 5125   ↦ cmpt 5143   × cxp 5552  dom cdm 5554  ran crn 5555   ∘ ccom 5558  ⟶wf 6348  ‘cfv 6352  (class class class)co 7148   ∈ cmpo 7150  1st c1st 7678  2nd c2nd 7679   ↑m cmap 8396  Xcixp 8450  supcsup 8893  0cc0 10526  ℝ*cxr 10663   < clt 10664  ndxcnx 16470  Basecbs 16473  +gcplusg 16555  .rcmulr 16556  Scalarcsca 16558   ·𝑠 cvsca 16559  ·𝑖cip 16560  TopSetcts 16561  lecple 16562  distcds 16564  Hom chom 16566  compcco 16567  TopOpenctopn 16685  ∏tcpt 16702   Σg cgsu 16704  Xscprds 16709 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2798  ax-sep 5200  ax-nul 5207  ax-pow 5263  ax-pr 5326  ax-un 7451  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603 This theorem depends on definitions:  df-bi 208  df-an 397  df-or 844  df-3or 1082  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2620  df-eu 2652  df-clab 2805  df-cleq 2819  df-clel 2898  df-nfc 2968  df-ne 3022  df-nel 3129  df-ral 3148  df-rex 3149  df-reu 3150  df-rab 3152  df-v 3502  df-sbc 3777  df-csb 3888  df-dif 3943  df-un 3945  df-in 3947  df-ss 3956  df-pss 3958  df-nul 4296  df-if 4471  df-pw 4544  df-sn 4565  df-pr 4567  df-tp 4569  df-op 4571  df-uni 4838  df-int 4875  df-iun 4919  df-br 5064  df-opab 5126  df-mpt 5144  df-tr 5170  df-id 5459  df-eprel 5464  df-po 5473  df-so 5474  df-fr 5513  df-we 5515  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-pred 6146  df-ord 6192  df-on 6193  df-lim 6194  df-suc 6195  df-iota 6312  df-fun 6354  df-fn 6355  df-f 6356  df-f1 6357  df-fo 6358  df-f1o 6359  df-fv 6360  df-riota 7106  df-ov 7151  df-oprab 7152  df-mpo 7153  df-om 7569  df-1st 7680  df-2nd 7681  df-wrecs 7938  df-recs 7999  df-rdg 8037  df-1o 8093  df-oadd 8097  df-er 8279  df-map 8398  df-ixp 8451  df-en 8499  df-dom 8500  df-sdom 8501  df-fin 8502  df-sup 8895  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-nn 11628  df-2 11689  df-3 11690  df-4 11691  df-5 11692  df-6 11693  df-7 11694  df-8 11695  df-9 11696  df-n0 11887  df-z 11971  df-dec 12088  df-uz 12233  df-fz 12883  df-struct 16475  df-ndx 16476  df-slot 16477  df-base 16479  df-plusg 16568  df-mulr 16569  df-sca 16571  df-vsca 16572  df-ip 16573  df-tset 16574  df-ple 16575  df-ds 16577  df-hom 16579  df-cco 16580  df-prds 16711 This theorem is referenced by:  prdsvsca  16723  prdsle  16725  prdsds  16727  prdstset  16729  prdshom  16730  prdsco  16731  prdsmulrval  16738  prdsmgp  19280
 Copyright terms: Public domain W3C validator