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

Theorem prdssca 12977
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 2196 . . 3 (Scalar‘𝑃) = (Scalar‘𝑃)
5 scaid 12854 . . 3 Scalar = Slot (Scalar‘ndx)
6 scaslid 12855 . . . 4 (Scalar = Slot (Scalar‘ndx) ∧ (Scalar‘ndx) ∈ ℕ)
76simpri 113 . . 3 (Scalar‘ndx) ∈ ℕ
8 snsstp1 3773 . . . . . 6 {⟨(Scalar‘ndx), 𝑆⟩} ⊆ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥))))⟩, ⟨(·𝑖‘ndx), (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑆 Σg (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}
9 ssun2 3328 . . . . . 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 3193 . . . . 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 3327 . . . . 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 3193 . . . 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 2196 . . . . 5 (Base‘𝑆) = (Base‘𝑆)
14 eqidd 2197 . . . . 5 (𝜑 → dom 𝑅 = dom 𝑅)
15 eqidd 2197 . . . . 5 (𝜑X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) = X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)))
16 eqidd 2197 . . . . 5 (𝜑 → (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥)))))
17 eqidd 2197 . . . . 5 (𝜑 → (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))))
18 eqidd 2197 . . . . 5 (𝜑 → (𝑓 ∈ (Base‘𝑆), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))) = (𝑓 ∈ (Base‘𝑆), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑥 ∈ dom 𝑅 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))))
19 eqidd 2197 . . . . 5 (𝜑 → (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑆 Σg (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))) = (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ (𝑆 Σg (𝑥 ∈ dom 𝑅 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))))
20 eqidd 2197 . . . . 5 (𝜑 → (∏t‘(TopOpen ∘ 𝑅)) = (∏t‘(TopOpen ∘ 𝑅)))
21 eqidd 2197 . . . . 5 (𝜑 → {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ∧ ∀𝑥 ∈ dom 𝑅(𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))} = {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ∧ ∀𝑥 ∈ dom 𝑅(𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))})
22 eqidd 2197 . . . . 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 2197 . . . . 5 (𝜑 → (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))) = (𝑓X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)), 𝑔X𝑥 ∈ dom 𝑅(Base‘(𝑅𝑥)) ↦ X𝑥 ∈ dom 𝑅((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))))
24 eqidd 2197 . . . . 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 12975 . . . 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 3235 . . 3 (𝜑 → {⟨(Scalar‘ndx), 𝑆⟩} ⊆ 𝑃)
271, 2, 3, 4, 5, 7, 2, 26prdsbaslemss 12976 . 2 (𝜑 → (Scalar‘𝑃) = 𝑆)
2827eqcomd 2202 1 (𝜑𝑆 = (Scalar‘𝑃))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1364  wcel 2167  wral 2475  cun 3155  wss 3157  {csn 3623  {cpr 3624  {ctp 3625  cop 3626   class class class wbr 4034  {copab 4094  cmpt 4095   × cxp 4662  dom cdm 4664  ran crn 4665  ccom 4668  cfv 5259  (class class class)co 5925  cmpo 5927  1st c1st 6205  2nd c2nd 6206  Xcixp 6766  supcsup 7057  0cc0 7896  *cxr 8077   < clt 8078  cn 9007  ndxcnx 12700  Slot cslot 12702  Basecbs 12703  +gcplusg 12780  .rcmulr 12781  Scalarcsca 12783   ·𝑠 cvsca 12784  ·𝑖cip 12785  TopSetcts 12786  lecple 12787  distcds 12789  Hom chom 12791  compcco 12792  TopOpenctopn 12942  tcpt 12957   Σg cgsu 12959  Xscprds 12967
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-mulcom 7997  ax-addass 7998  ax-mulass 7999  ax-distr 8000  ax-i2m1 8001  ax-0lt1 8002  ax-1rid 8003  ax-0id 8004  ax-rnegex 8005  ax-cnre 8007  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010  ax-pre-apti 8011  ax-pre-ltadd 8012
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-tp 3631  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-map 6718  df-ixp 6767  df-sup 7059  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-sub 8216  df-neg 8217  df-inn 9008  df-2 9066  df-3 9067  df-4 9068  df-5 9069  df-6 9070  df-7 9071  df-8 9072  df-9 9073  df-n0 9267  df-z 9344  df-dec 9475  df-uz 9619  df-fz 10101  df-struct 12705  df-ndx 12706  df-slot 12707  df-base 12709  df-plusg 12793  df-mulr 12794  df-sca 12796  df-vsca 12797  df-ip 12798  df-tset 12799  df-ple 12800  df-ds 12802  df-hom 12804  df-cco 12805  df-rest 12943  df-topn 12944  df-topgen 12962  df-pt 12963  df-prds 12969
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator