ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  prdssca GIF version

Theorem prdssca 13381
Description: Scalar ring of 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 (𝜑𝑅𝑊)
Assertion
Ref Expression
prdssca (𝜑𝑆 = (Scalar‘𝑃))

Proof of Theorem prdssca
Dummy variables 𝑎 𝑐 𝑑 𝑒 𝑓 𝑔 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prdsbas.p . . 3 𝑃 = (𝑆Xs𝑅)
2 prdsbas.s . . 3 (𝜑𝑆𝑉)
3 prdsbas.r . . 3 (𝜑𝑅𝑊)
4 eqid 2230 . . 3 (Scalar‘𝑃) = (Scalar‘𝑃)
5 scaid 13258 . . 3 Scalar = Slot (Scalar‘ndx)
6 scaslid 13259 . . . 4 (Scalar = Slot (Scalar‘ndx) ∧ (Scalar‘ndx) ∈ ℕ)
76simpri 113 . . 3 (Scalar‘ndx) ∈ ℕ
8 snsstp1 3824 . . . . . 6 {⟨(Scalar‘ndx), 𝑆⟩} ⊆ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑆 Σg (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}
9 ssun2 3370 . . . . . 6 {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑆 Σg (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩} ⊆ ({⟨(Base‘ndx), X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥))⟩, ⟨(+g‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(.r‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑆 Σg (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩})
108, 9sstri 3235 . . . . 5 {⟨(Scalar‘ndx), 𝑆⟩} ⊆ ({⟨(Base‘ndx), X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥))⟩, ⟨(+g‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(.r‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑆 Σg (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩})
11 ssun1 3369 . . . . 5 ({⟨(Base‘ndx), X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥))⟩, ⟨(+g‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(.r‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑆 Σg (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}) ⊆ (({⟨(Base‘ndx), X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥))⟩, ⟨(+g‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(.r‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑆 Σg (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}) ∪ ({⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ∧ ∀𝑥 ∈ dom 𝑅(𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))}⟩, ⟨(dist‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ sup((ran (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < ))⟩} ∪ {⟨(Hom ‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) × X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥))), 𝑐X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑑 ∈ ((2nd𝑎)(𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩}))
1210, 11sstri 3235 . . . 4 {⟨(Scalar‘ndx), 𝑆⟩} ⊆ (({⟨(Base‘ndx), X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥))⟩, ⟨(+g‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(.r‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑆 Σg (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}) ∪ ({⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ∧ ∀𝑥 ∈ dom 𝑅(𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))}⟩, ⟨(dist‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ sup((ran (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < ))⟩} ∪ {⟨(Hom ‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) × X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥))), 𝑐X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑑 ∈ ((2nd𝑎)(𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩}))
13 eqid 2230 . . . . 5 (Base‘𝑆) = (Base‘𝑆)
14 eqidd 2231 . . . . 5 (𝜑 → dom 𝑅 = dom 𝑅)
15 eqidd 2231 . . . . 5 (𝜑X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) = X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)))
16 eqidd 2231 . . . . 5 (𝜑 → (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥)))))
17 eqidd 2231 . . . . 5 (𝜑 → (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))))
18 eqidd 2231 . . . . 5 (𝜑 → (𝑓 ∈ (Base‘𝑆), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓 ∈ (Base‘𝑆), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))))
19 eqidd 2231 . . . . 5 (𝜑 → (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑆 Σg (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))) = (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑆 Σg (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))))
20 eqidd 2231 . . . . 5 (𝜑 → (∏t‘(TopOpen ∘ 𝑅)) = (∏t‘(TopOpen ∘ 𝑅)))
21 eqidd 2231 . . . . 5 (𝜑 → {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ∧ ∀𝑥 ∈ dom 𝑅(𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))} = {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ∧ ∀𝑥 ∈ dom 𝑅(𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))})
22 eqidd 2231 . . . . 5 (𝜑 → (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ sup((ran (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < )) = (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ sup((ran (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < )))
23 eqidd 2231 . . . . 5 (𝜑 → (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))) = (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))))
24 eqidd 2231 . . . . 5 (𝜑 → (𝑎 ∈ (X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) × X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥))), 𝑐X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑑 ∈ ((2nd𝑎)(𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥))))) = (𝑎 ∈ (X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) × X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥))), 𝑐X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑑 ∈ ((2nd𝑎)(𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥))))))
251, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 2, 3prdsval 13379 . . . 4 (𝜑𝑃 = (({⟨(Base‘ndx), X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥))⟩, ⟨(+g‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(.r‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥))))⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑆 Σg (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}) ∪ ({⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ∧ ∀𝑥 ∈ dom 𝑅(𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))}⟩, ⟨(dist‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ sup((ran (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < ))⟩} ∪ {⟨(Hom ‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) × X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥))), 𝑐X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑑 ∈ ((2nd𝑎)(𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩})))
2612, 25sseqtrrid 3277 . . 3 (𝜑 → {⟨(Scalar‘ndx), 𝑆⟩} ⊆ 𝑃)
271, 2, 3, 4, 5, 7, 2, 26prdsbaslemss 13380 . 2 (𝜑 → (Scalar‘𝑃) = 𝑆)
2827eqcomd 2236 1 (𝜑𝑆 = (Scalar‘𝑃))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1397  wcel 2201  wral 2509  cun 3197  wss 3199  {csn 3670  {cpr 3671  {ctp 3672  cop 3673   class class class wbr 4089  {copab 4150  cmpt 4151   × cxp 4725  dom cdm 4727  ran crn 4728  ccom 4731  cfv 5328  (class class class)co 6023  cmpo 6025  1st c1st 6306  2nd c2nd 6307  Xcixp 6872  supcsup 7186  0cc0 8037  *cxr 8218   < clt 8219  cn 9148  ndxcnx 13102  Slot cslot 13104  Basecbs 13105  +gcplusg 13183  .rcmulr 13184  Scalarcsca 13186   ·𝑠 cvsca 13187  ·𝑖cip 13188  TopSetcts 13189  lecple 13190  distcds 13192  Hom chom 13194  compcco 13195  TopOpenctopn 13346  tcpt 13361   Σg cgsu 13363  Xscprds 13371
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-coll 4205  ax-sep 4208  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-cnex 8128  ax-resscn 8129  ax-1cn 8130  ax-1re 8131  ax-icn 8132  ax-addcl 8133  ax-addrcl 8134  ax-mulcl 8135  ax-addcom 8137  ax-mulcom 8138  ax-addass 8139  ax-mulass 8140  ax-distr 8141  ax-i2m1 8142  ax-0lt1 8143  ax-1rid 8144  ax-0id 8145  ax-rnegex 8146  ax-cnre 8148  ax-pre-ltirr 8149  ax-pre-ltwlin 8150  ax-pre-lttrn 8151  ax-pre-apti 8152  ax-pre-ltadd 8153
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-nel 2497  df-ral 2514  df-rex 2515  df-reu 2516  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-pw 3655  df-sn 3676  df-pr 3677  df-tp 3678  df-op 3679  df-uni 3895  df-int 3930  df-iun 3973  df-br 4090  df-opab 4152  df-mpt 4153  df-id 4392  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-f1 5333  df-fo 5334  df-f1o 5335  df-fv 5336  df-riota 5976  df-ov 6026  df-oprab 6027  df-mpo 6028  df-1st 6308  df-2nd 6309  df-map 6824  df-ixp 6873  df-sup 7188  df-pnf 8221  df-mnf 8222  df-xr 8223  df-ltxr 8224  df-le 8225  df-sub 8357  df-neg 8358  df-inn 9149  df-2 9207  df-3 9208  df-4 9209  df-5 9210  df-6 9211  df-7 9212  df-8 9213  df-9 9214  df-n0 9408  df-z 9485  df-dec 9617  df-uz 9761  df-fz 10249  df-struct 13107  df-ndx 13108  df-slot 13109  df-base 13111  df-plusg 13196  df-mulr 13197  df-sca 13199  df-vsca 13200  df-ip 13201  df-tset 13202  df-ple 13203  df-ds 13205  df-hom 13207  df-cco 13208  df-rest 13347  df-topn 13348  df-topgen 13366  df-pt 13367  df-prds 13373
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator