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

Theorem prdsvsca 16727
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.)
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 16724 . . 3 (𝜑𝐵 = X𝑥𝐼 (Base‘(𝑅𝑥)))
8 eqid 2821 . . . 4 (+g𝑃) = (+g𝑃)
91, 4, 5, 6, 3, 8prdsplusg 16725 . . 3 (𝜑 → (+g𝑃) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥)))))
10 eqid 2821 . . . 4 (.r𝑃) = (.r𝑃)
111, 4, 5, 6, 3, 10prdsmulr 16726 . . 3 (𝜑 → (.r𝑃) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))))
12 eqidd 2822 . . 3 (𝜑 → (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))))
13 eqidd 2822 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))))
14 eqidd 2822 . . 3 (𝜑 → (∏t‘(TopOpen ∘ 𝑅)) = (∏t‘(TopOpen ∘ 𝑅)))
15 eqidd 2822 . . 3 (𝜑 → {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥𝐼 (𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))} = {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥𝐼 (𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))})
16 eqidd 2822 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ sup((ran (𝑥𝐼 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < )) = (𝑓𝐵, 𝑔𝐵 ↦ sup((ran (𝑥𝐼 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < )))
17 eqidd 2822 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))) = (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))))
18 eqidd 2822 . . 3 (𝜑 → (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ (𝑐(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))(2nd𝑎)), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥))))) = (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ (𝑐(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))(2nd𝑎)), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥))))))
191, 2, 3, 7, 9, 11, 12, 13, 14, 15, 16, 17, 18, 4, 5prdsval 16722 . 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), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ (𝑐(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))(2nd𝑎)), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩})))
20 prdsvsca.m . 2 · = ( ·𝑠𝑃)
21 vscaid 16629 . 2 ·𝑠 = Slot ( ·𝑠 ‘ndx)
22 ovssunirn 7186 . . . . . . . . . . 11 (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran ( ·𝑠 ‘(𝑅𝑥))
2321strfvss 16500 . . . . . . . . . . . . 13 ( ·𝑠 ‘(𝑅𝑥)) ⊆ ran (𝑅𝑥)
24 fvssunirn 6694 . . . . . . . . . . . . . 14 (𝑅𝑥) ⊆ ran 𝑅
25 rnss 5804 . . . . . . . . . . . . . 14 ((𝑅𝑥) ⊆ ran 𝑅 → ran (𝑅𝑥) ⊆ ran ran 𝑅)
26 uniss 4853 . . . . . . . . . . . . . 14 (ran (𝑅𝑥) ⊆ ran ran 𝑅 ran (𝑅𝑥) ⊆ ran ran 𝑅)
2724, 25, 26mp2b 10 . . . . . . . . . . . . 13 ran (𝑅𝑥) ⊆ ran ran 𝑅
2823, 27sstri 3976 . . . . . . . . . . . 12 ( ·𝑠 ‘(𝑅𝑥)) ⊆ ran ran 𝑅
29 rnss 5804 . . . . . . . . . . . 12 (( ·𝑠 ‘(𝑅𝑥)) ⊆ ran ran 𝑅 → ran ( ·𝑠 ‘(𝑅𝑥)) ⊆ ran ran ran 𝑅)
30 uniss 4853 . . . . . . . . . . . 12 (ran ( ·𝑠 ‘(𝑅𝑥)) ⊆ ran ran ran 𝑅 ran ( ·𝑠 ‘(𝑅𝑥)) ⊆ ran ran ran 𝑅)
3128, 29, 30mp2b 10 . . . . . . . . . . 11 ran ( ·𝑠 ‘(𝑅𝑥)) ⊆ ran ran ran 𝑅
3222, 31sstri 3976 . . . . . . . . . 10 (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran ran ran 𝑅
33 ovex 7183 . . . . . . . . . . 11 (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)) ∈ V
3433elpw 4546 . . . . . . . . . 10 ((𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ran ran ran 𝑅 ↔ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)) ⊆ ran ran ran 𝑅)
3532, 34mpbir 233 . . . . . . . . 9 (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ran ran ran 𝑅
3635a1i 11 . . . . . . . 8 ((𝜑𝑥𝐼) → (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)) ∈ 𝒫 ran ran ran 𝑅)
3736fmpttd 6874 . . . . . . 7 (𝜑 → (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))):𝐼⟶𝒫 ran ran ran 𝑅)
38 rnexg 7608 . . . . . . . . . . 11 (𝑅𝑊 → ran 𝑅 ∈ V)
39 uniexg 7460 . . . . . . . . . . 11 (ran 𝑅 ∈ V → ran 𝑅 ∈ V)
405, 38, 393syl 18 . . . . . . . . . 10 (𝜑 ran 𝑅 ∈ V)
41 rnexg 7608 . . . . . . . . . 10 ( ran 𝑅 ∈ V → ran ran 𝑅 ∈ V)
42 uniexg 7460 . . . . . . . . . 10 (ran ran 𝑅 ∈ V → ran ran 𝑅 ∈ V)
4340, 41, 423syl 18 . . . . . . . . 9 (𝜑 ran ran 𝑅 ∈ V)
44 rnexg 7608 . . . . . . . . 9 ( ran ran 𝑅 ∈ V → ran ran ran 𝑅 ∈ V)
45 uniexg 7460 . . . . . . . . 9 (ran ran ran 𝑅 ∈ V → ran ran ran 𝑅 ∈ V)
46 pwexg 5272 . . . . . . . . 9 ( ran ran ran 𝑅 ∈ V → 𝒫 ran ran ran 𝑅 ∈ V)
4743, 44, 45, 464syl 19 . . . . . . . 8 (𝜑 → 𝒫 ran ran ran 𝑅 ∈ V)
485dmexd 7609 . . . . . . . . 9 (𝜑 → dom 𝑅 ∈ V)
493, 48eqeltrrd 2914 . . . . . . . 8 (𝜑𝐼 ∈ V)
5047, 49elmapd 8414 . . . . . . 7 (𝜑 → ((𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅m 𝐼) ↔ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))):𝐼⟶𝒫 ran ran ran 𝑅))
5137, 50mpbird 259 . . . . . 6 (𝜑 → (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅m 𝐼))
5251ralrimivw 3183 . . . . 5 (𝜑 → ∀𝑔𝐵 (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅m 𝐼))
5352ralrimivw 3183 . . . 4 (𝜑 → ∀𝑓𝐾𝑔𝐵 (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅m 𝐼))
54 eqid 2821 . . . . 5 (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))
5554fmpo 7760 . . . 4 (∀𝑓𝐾𝑔𝐵 (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))) ∈ (𝒫 ran ran ran 𝑅m 𝐼) ↔ (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))):(𝐾 × 𝐵)⟶(𝒫 ran ran ran 𝑅m 𝐼))
5653, 55sylib 220 . . 3 (𝜑 → (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))):(𝐾 × 𝐵)⟶(𝒫 ran ran ran 𝑅m 𝐼))
572fvexi 6679 . . . . 5 𝐾 ∈ V
586fvexi 6679 . . . . 5 𝐵 ∈ V
5957, 58xpex 7470 . . . 4 (𝐾 × 𝐵) ∈ V
60 ovex 7183 . . . 4 (𝒫 ran ran ran 𝑅m 𝐼) ∈ V
61 fex2 7632 . . . 4 (((𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))):(𝐾 × 𝐵)⟶(𝒫 ran ran ran 𝑅m 𝐼) ∧ (𝐾 × 𝐵) ∈ V ∧ (𝒫 ran ran ran 𝑅m 𝐼) ∈ V) → (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))) ∈ V)
6259, 60, 61mp3an23 1449 . . 3 ((𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))):(𝐾 × 𝐵)⟶(𝒫 ran ran ran 𝑅m 𝐼) → (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))) ∈ V)
6356, 62syl 17 . 2 (𝜑 → (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))) ∈ V)
64 snsstp2 4744 . . . 4 {⟨( ·𝑠 ‘ndx), (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩} ⊆ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}
65 ssun2 4149 . . . 4 {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (.r𝑃)⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩})
6664, 65sstri 3976 . . 3 {⟨( ·𝑠 ‘ndx), (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (.r𝑃)⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩})
67 ssun1 4148 . . 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), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ (𝑐(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))(2nd𝑎)), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩}))
6866, 67sstri 3976 . 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), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ (𝑐(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))(2nd𝑎)), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩}))
6919, 20, 21, 63, 68prdsvallem 16721 1 (𝜑· = (𝑓𝐾, 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1533  wcel 2110  wral 3138  Vcvv 3495  cun 3934  wss 3936  𝒫 cpw 4539  {csn 4561  {cpr 4563  {ctp 4565  cop 4567   cuni 4832   class class class wbr 5059  {copab 5121  cmpt 5139   × cxp 5548  dom cdm 5550  ran crn 5551  ccom 5554  wf 6346  cfv 6350  (class class class)co 7150  cmpo 7152  1st c1st 7681  2nd c2nd 7682  m cmap 8400  Xcixp 8455  supcsup 8898  0cc0 10531  *cxr 10668   < clt 10669  ndxcnx 16474  Basecbs 16477  +gcplusg 16559  .rcmulr 16560  Scalarcsca 16562   ·𝑠 cvsca 16563  ·𝑖cip 16564  TopSetcts 16565  lecple 16566  distcds 16568  Hom chom 16570  compcco 16571  TopOpenctopn 16689  tcpt 16706   Σg cgsu 16708  Xscprds 16713
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5322  ax-un 7455  ax-cnex 10587  ax-resscn 10588  ax-1cn 10589  ax-icn 10590  ax-addcl 10591  ax-addrcl 10592  ax-mulcl 10593  ax-mulrcl 10594  ax-mulcom 10595  ax-addass 10596  ax-mulass 10597  ax-distr 10598  ax-i2m1 10599  ax-1ne0 10600  ax-1rid 10601  ax-rnegex 10602  ax-rrecex 10603  ax-cnre 10604  ax-pre-lttri 10605  ax-pre-lttrn 10606  ax-pre-ltadd 10607  ax-pre-mulgt0 10608
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3497  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4562  df-pr 4564  df-tp 4566  df-op 4568  df-uni 4833  df-int 4870  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-tr 5166  df-id 5455  df-eprel 5460  df-po 5469  df-so 5470  df-fr 5509  df-we 5511  df-xp 5556  df-rel 5557  df-cnv 5558  df-co 5559  df-dm 5560  df-rn 5561  df-res 5562  df-ima 5563  df-pred 6143  df-ord 6189  df-on 6190  df-lim 6191  df-suc 6192  df-iota 6309  df-fun 6352  df-fn 6353  df-f 6354  df-f1 6355  df-fo 6356  df-f1o 6357  df-fv 6358  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-om 7575  df-1st 7683  df-2nd 7684  df-wrecs 7941  df-recs 8002  df-rdg 8040  df-1o 8096  df-oadd 8100  df-er 8283  df-map 8402  df-ixp 8456  df-en 8504  df-dom 8505  df-sdom 8506  df-fin 8507  df-sup 8900  df-pnf 10671  df-mnf 10672  df-xr 10673  df-ltxr 10674  df-le 10675  df-sub 10866  df-neg 10867  df-nn 11633  df-2 11694  df-3 11695  df-4 11696  df-5 11697  df-6 11698  df-7 11699  df-8 11700  df-9 11701  df-n0 11892  df-z 11976  df-dec 12093  df-uz 12238  df-fz 12887  df-struct 16479  df-ndx 16480  df-slot 16481  df-base 16483  df-plusg 16572  df-mulr 16573  df-sca 16575  df-vsca 16576  df-ip 16577  df-tset 16578  df-ple 16579  df-ds 16581  df-hom 16583  df-cco 16584  df-prds 16715
This theorem is referenced by:  prdsle  16729  prdsds  16731  prdstset  16733  prdshom  16734  prdsco  16735  prdsvscaval  16746
  Copyright terms: Public domain W3C validator