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

Theorem prdsmulr 16047
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 2621 . . 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 16045 . . 3 (𝜑𝐵 = X𝑥𝐼 (Base‘(𝑅𝑥)))
8 eqid 2621 . . . 4 (+g𝑃) = (+g𝑃)
91, 4, 5, 6, 3, 8prdsplusg 16046 . . 3 (𝜑 → (+g𝑃) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥)))))
10 eqidd 2622 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))))
11 eqidd 2622 . . 3 (𝜑 → (𝑓 ∈ (Base‘𝑆), 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓 ∈ (Base‘𝑆), 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))))
12 eqidd 2622 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))))
13 eqidd 2622 . . 3 (𝜑 → (∏t‘(TopOpen ∘ 𝑅)) = (∏t‘(TopOpen ∘ 𝑅)))
14 eqidd 2622 . . 3 (𝜑 → {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥𝐼 (𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))} = {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥𝐼 (𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))})
15 eqidd 2622 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ sup((ran (𝑥𝐼 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < )) = (𝑓𝐵, 𝑔𝐵 ↦ sup((ran (𝑥𝐼 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < )))
16 eqidd 2622 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))) = (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))))
17 eqidd 2622 . . 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 16043 . 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 15925 . 2 .r = Slot (.r‘ndx)
21 ovssunirn 6641 . . . . . . . . . . 11 ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran (.r‘(𝑅𝑥))
2220strfvss 15809 . . . . . . . . . . . . 13 (.r‘(𝑅𝑥)) ⊆ ran (𝑅𝑥)
23 fvssunirn 6179 . . . . . . . . . . . . . 14 (𝑅𝑥) ⊆ ran 𝑅
24 rnss 5319 . . . . . . . . . . . . . 14 ((𝑅𝑥) ⊆ ran 𝑅 → ran (𝑅𝑥) ⊆ ran ran 𝑅)
25 uniss 4429 . . . . . . . . . . . . . 14 (ran (𝑅𝑥) ⊆ ran ran 𝑅 ran (𝑅𝑥) ⊆ ran ran 𝑅)
2623, 24, 25mp2b 10 . . . . . . . . . . . . 13 ran (𝑅𝑥) ⊆ ran ran 𝑅
2722, 26sstri 3596 . . . . . . . . . . . 12 (.r‘(𝑅𝑥)) ⊆ ran ran 𝑅
28 rnss 5319 . . . . . . . . . . . 12 ((.r‘(𝑅𝑥)) ⊆ ran ran 𝑅 → ran (.r‘(𝑅𝑥)) ⊆ ran ran ran 𝑅)
29 uniss 4429 . . . . . . . . . . . 12 (ran (.r‘(𝑅𝑥)) ⊆ ran ran ran 𝑅 ran (.r‘(𝑅𝑥)) ⊆ ran ran ran 𝑅)
3027, 28, 29mp2b 10 . . . . . . . . . . 11 ran (.r‘(𝑅𝑥)) ⊆ ran ran ran 𝑅
3121, 30sstri 3596 . . . . . . . . . 10 ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran ran ran 𝑅
32 ovex 6638 . . . . . . . . . . 11 ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)) ∈ V
3332elpw 4141 . . . . . . . . . 10 (((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ran ran ran 𝑅 ↔ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran ran ran 𝑅)
3431, 33mpbir 221 . . . . . . . . 9 ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ran ran ran 𝑅
3534a1i 11 . . . . . . . 8 ((𝜑𝑥𝐼) → ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ran ran ran 𝑅)
36 eqid 2621 . . . . . . . 8 (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))) = (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))
3735, 36fmptd 6346 . . . . . . 7 (𝜑 → (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))):𝐼⟶𝒫 ran ran ran 𝑅)
38 rnexg 7052 . . . . . . . . . . . 12 (𝑅𝑊 → ran 𝑅 ∈ V)
39 uniexg 6915 . . . . . . . . . . . 12 (ran 𝑅 ∈ V → ran 𝑅 ∈ V)
405, 38, 393syl 18 . . . . . . . . . . 11 (𝜑 ran 𝑅 ∈ V)
41 rnexg 7052 . . . . . . . . . . 11 ( ran 𝑅 ∈ V → ran ran 𝑅 ∈ V)
42 uniexg 6915 . . . . . . . . . . 11 (ran ran 𝑅 ∈ V → ran ran 𝑅 ∈ V)
4340, 41, 423syl 18 . . . . . . . . . 10 (𝜑 ran ran 𝑅 ∈ V)
44 rnexg 7052 . . . . . . . . . 10 ( ran ran 𝑅 ∈ V → ran ran ran 𝑅 ∈ V)
45 uniexg 6915 . . . . . . . . . 10 (ran ran ran 𝑅 ∈ V → ran ran ran 𝑅 ∈ V)
4643, 44, 453syl 18 . . . . . . . . 9 (𝜑 ran ran ran 𝑅 ∈ V)
47 pwexg 4815 . . . . . . . . 9 ( ran ran ran 𝑅 ∈ V → 𝒫 ran ran ran 𝑅 ∈ V)
4846, 47syl 17 . . . . . . . 8 (𝜑 → 𝒫 ran ran ran 𝑅 ∈ V)
49 dmexg 7051 . . . . . . . . . 10 (𝑅𝑊 → dom 𝑅 ∈ V)
505, 49syl 17 . . . . . . . . 9 (𝜑 → dom 𝑅 ∈ V)
513, 50eqeltrrd 2699 . . . . . . . 8 (𝜑𝐼 ∈ V)
5248, 51elmapd 7823 . . . . . . 7 (𝜑 → ((𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅𝑚 𝐼) ↔ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))):𝐼⟶𝒫 ran ran ran 𝑅))
5337, 52mpbird 247 . . . . . 6 (𝜑 → (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅𝑚 𝐼))
5453ralrimivw 2962 . . . . 5 (𝜑 → ∀𝑔𝐵 (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅𝑚 𝐼))
5554ralrimivw 2962 . . . 4 (𝜑 → ∀𝑓𝐵𝑔𝐵 (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅𝑚 𝐼))
56 eqid 2621 . . . . 5 (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))
5756fmpt2 7189 . . . 4 (∀𝑓𝐵𝑔𝐵 (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅𝑚 𝐼) ↔ (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))):(𝐵 × 𝐵)⟶(𝒫 ran ran ran 𝑅𝑚 𝐼))
5855, 57sylib 208 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))):(𝐵 × 𝐵)⟶(𝒫 ran ran ran 𝑅𝑚 𝐼))
59 fvex 6163 . . . . . 6 (Base‘𝑃) ∈ V
606, 59eqeltri 2694 . . . . 5 𝐵 ∈ V
6160, 60xpex 6922 . . . 4 (𝐵 × 𝐵) ∈ V
62 ovex 6638 . . . 4 (𝒫 ran ran ran 𝑅𝑚 𝐼) ∈ V
63 fex2 7075 . . . 4 (((𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))):(𝐵 × 𝐵)⟶(𝒫 ran ran ran 𝑅𝑚 𝐼) ∧ (𝐵 × 𝐵) ∈ V ∧ (𝒫 ran ran ran 𝑅𝑚 𝐼) ∈ V) → (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))) ∈ V)
6461, 62, 63mp3an23 1413 . . 3 ((𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))):(𝐵 × 𝐵)⟶(𝒫 ran ran ran 𝑅𝑚 𝐼) → (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))) ∈ V)
6558, 64syl 17 . 2 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))) ∈ V)
66 snsstp3 4322 . . . 4 {⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ⊆ {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩}
67 ssun1 3759 . . . 4 {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩})
6866, 67sstri 3596 . . 3 {⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩})
69 ssun1 3759 . . 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‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩}))
7068, 69sstri 3596 . 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‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩}))
7118, 19, 20, 65, 70prdsvallem 16042 1 (𝜑· = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1480  wcel 1987  wral 2907  Vcvv 3189  cun 3557  wss 3559  𝒫 cpw 4135  {csn 4153  {cpr 4155  {ctp 4157  cop 4159   cuni 4407   class class class wbr 4618  {copab 4677  cmpt 4678   × cxp 5077  dom cdm 5079  ran crn 5080  ccom 5083  wf 5848  cfv 5852  (class class class)co 6610  cmpt2 6612  1st c1st 7118  2nd c2nd 7119  𝑚 cmap 7809  Xcixp 7859  supcsup 8297  0cc0 9887  *cxr 10024   < clt 10025  ndxcnx 15785  Basecbs 15788  +gcplusg 15869  .rcmulr 15870  Scalarcsca 15872   ·𝑠 cvsca 15873  ·𝑖cip 15874  TopSetcts 15875  lecple 15876  distcds 15878  Hom chom 15880  compcco 15881  TopOpenctopn 16010  tcpt 16027   Σg cgsu 16029  Xscprds 16034
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6909  ax-cnex 9943  ax-resscn 9944  ax-1cn 9945  ax-icn 9946  ax-addcl 9947  ax-addrcl 9948  ax-mulcl 9949  ax-mulrcl 9950  ax-mulcom 9951  ax-addass 9952  ax-mulass 9953  ax-distr 9954  ax-i2m1 9955  ax-1ne0 9956  ax-1rid 9957  ax-rnegex 9958  ax-rrecex 9959  ax-cnre 9960  ax-pre-lttri 9961  ax-pre-lttrn 9962  ax-pre-ltadd 9963  ax-pre-mulgt0 9964
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-nel 2894  df-ral 2912  df-rex 2913  df-reu 2914  df-rab 2916  df-v 3191  df-sbc 3422  df-csb 3519  df-dif 3562  df-un 3564  df-in 3566  df-ss 3573  df-pss 3575  df-nul 3897  df-if 4064  df-pw 4137  df-sn 4154  df-pr 4156  df-tp 4158  df-op 4160  df-uni 4408  df-int 4446  df-iun 4492  df-br 4619  df-opab 4679  df-mpt 4680  df-tr 4718  df-eprel 4990  df-id 4994  df-po 5000  df-so 5001  df-fr 5038  df-we 5040  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-res 5091  df-ima 5092  df-pred 5644  df-ord 5690  df-on 5691  df-lim 5692  df-suc 5693  df-iota 5815  df-fun 5854  df-fn 5855  df-f 5856  df-f1 5857  df-fo 5858  df-f1o 5859  df-fv 5860  df-riota 6571  df-ov 6613  df-oprab 6614  df-mpt2 6615  df-om 7020  df-1st 7120  df-2nd 7121  df-wrecs 7359  df-recs 7420  df-rdg 7458  df-1o 7512  df-oadd 7516  df-er 7694  df-map 7811  df-ixp 7860  df-en 7907  df-dom 7908  df-sdom 7909  df-fin 7910  df-sup 8299  df-pnf 10027  df-mnf 10028  df-xr 10029  df-ltxr 10030  df-le 10031  df-sub 10219  df-neg 10220  df-nn 10972  df-2 11030  df-3 11031  df-4 11032  df-5 11033  df-6 11034  df-7 11035  df-8 11036  df-9 11037  df-n0 11244  df-z 11329  df-dec 11445  df-uz 11639  df-fz 12276  df-struct 15790  df-ndx 15791  df-slot 15792  df-base 15793  df-plusg 15882  df-mulr 15883  df-sca 15885  df-vsca 15886  df-ip 15887  df-tset 15888  df-ple 15889  df-ds 15892  df-hom 15894  df-cco 15895  df-prds 16036
This theorem is referenced by:  prdsvsca  16048  prdsle  16050  prdsds  16052  prdstset  16054  prdshom  16055  prdsco  16056  prdsmulrval  16063  prdsmgp  18538
  Copyright terms: Public domain W3C validator