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

Theorem prdssca 13303
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 2229 . . 3 (Scalar‘𝑃) = (Scalar‘𝑃)
5 scaid 13180 . . 3 Scalar = Slot (Scalar‘ndx)
6 scaslid 13181 . . . 4 (Scalar = Slot (Scalar‘ndx) ∧ (Scalar‘ndx) ∈ ℕ)
76simpri 113 . . 3 (Scalar‘ndx) ∈ ℕ
8 snsstp1 3817 . . . . . 6 {⟨(Scalar‘ndx), 𝑆⟩} ⊆ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑆 Σg (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}
9 ssun2 3368 . . . . . 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 3233 . . . . 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 3367 . . . . 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 3233 . . . 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 2229 . . . . 5 (Base‘𝑆) = (Base‘𝑆)
14 eqidd 2230 . . . . 5 (𝜑 → dom 𝑅 = dom 𝑅)
15 eqidd 2230 . . . . 5 (𝜑X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) = X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)))
16 eqidd 2230 . . . . 5 (𝜑 → (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥)))))
17 eqidd 2230 . . . . 5 (𝜑 → (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))))
18 eqidd 2230 . . . . 5 (𝜑 → (𝑓 ∈ (Base‘𝑆), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓 ∈ (Base‘𝑆), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))))
19 eqidd 2230 . . . . 5 (𝜑 → (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑆 Σg (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))) = (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑆 Σg (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))))
20 eqidd 2230 . . . . 5 (𝜑 → (∏t‘(TopOpen ∘ 𝑅)) = (∏t‘(TopOpen ∘ 𝑅)))
21 eqidd 2230 . . . . 5 (𝜑 → {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ∧ ∀𝑥 ∈ dom 𝑅(𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))} = {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ∧ ∀𝑥 ∈ dom 𝑅(𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))})
22 eqidd 2230 . . . . 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 2230 . . . . 5 (𝜑 → (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))) = (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))))
24 eqidd 2230 . . . . 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 13301 . . . 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 3275 . . 3 (𝜑 → {⟨(Scalar‘ndx), 𝑆⟩} ⊆ 𝑃)
271, 2, 3, 4, 5, 7, 2, 26prdsbaslemss 13302 . 2 (𝜑 → (Scalar‘𝑃) = 𝑆)
2827eqcomd 2235 1 (𝜑𝑆 = (Scalar‘𝑃))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1395  wcel 2200  wral 2508  cun 3195  wss 3197  {csn 3666  {cpr 3667  {ctp 3668  cop 3669   class class class wbr 4082  {copab 4143  cmpt 4144   × cxp 4716  dom cdm 4718  ran crn 4719  ccom 4722  cfv 5317  (class class class)co 6000  cmpo 6002  1st c1st 6282  2nd c2nd 6283  Xcixp 6843  supcsup 7145  0cc0 7995  *cxr 8176   < clt 8177  cn 9106  ndxcnx 13024  Slot cslot 13026  Basecbs 13027  +gcplusg 13105  .rcmulr 13106  Scalarcsca 13108   ·𝑠 cvsca 13109  ·𝑖cip 13110  TopSetcts 13111  lecple 13112  distcds 13114  Hom chom 13116  compcco 13117  TopOpenctopn 13268  tcpt 13283   Σg cgsu 13285  Xscprds 13293
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-addcom 8095  ax-mulcom 8096  ax-addass 8097  ax-mulass 8098  ax-distr 8099  ax-i2m1 8100  ax-0lt1 8101  ax-1rid 8102  ax-0id 8103  ax-rnegex 8104  ax-cnre 8106  ax-pre-ltirr 8107  ax-pre-ltwlin 8108  ax-pre-lttrn 8109  ax-pre-apti 8110  ax-pre-ltadd 8111
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-tp 3674  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-map 6795  df-ixp 6844  df-sup 7147  df-pnf 8179  df-mnf 8180  df-xr 8181  df-ltxr 8182  df-le 8183  df-sub 8315  df-neg 8316  df-inn 9107  df-2 9165  df-3 9166  df-4 9167  df-5 9168  df-6 9169  df-7 9170  df-8 9171  df-9 9172  df-n0 9366  df-z 9443  df-dec 9575  df-uz 9719  df-fz 10201  df-struct 13029  df-ndx 13030  df-slot 13031  df-base 13033  df-plusg 13118  df-mulr 13119  df-sca 13121  df-vsca 13122  df-ip 13123  df-tset 13124  df-ple 13125  df-ds 13127  df-hom 13129  df-cco 13130  df-rest 13269  df-topn 13270  df-topgen 13288  df-pt 13289  df-prds 13295
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator