prdsplusg - Metamath Proof Explorer

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

Theorem prdsplusg 17439

Description: Addition in a structure product. (Contributed by Stefan O'Rear, 3-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	⊢ 𝑃 = (𝑆X_s𝑅)
prdsbas.s	⊢ (𝜑 → 𝑆 ∈ 𝑉)
prdsbas.r	⊢ (𝜑 → 𝑅 ∈ 𝑊)
prdsbas.b	⊢ 𝐵 = (Base‘𝑃)
prdsbas.i	⊢ (𝜑 → dom 𝑅 = 𝐼)
prdsplusg.b	⊢ + = (+_g‘𝑃)

**Assertion**
Ref	Expression
prdsplusg	⊢ (𝜑 → + = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)))))

Distinct variable groups: 𝑓,𝑔,𝑥,𝐵 𝜑,𝑓,𝑔,𝑥 𝑓,𝐼,𝑔,𝑥 𝑃,𝑓,𝑔,𝑥 𝑅,𝑓,𝑔,𝑥 𝑆,𝑓,𝑔,𝑥 Allowed substitution hints: + (𝑥,𝑓,𝑔) 𝑉(𝑥,𝑓,𝑔) 𝑊(𝑥,𝑓,𝑔)

Proof of Theorem prdsplusg Dummy variables 𝑎 𝑐 𝑑 𝑒 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prdsbas.p	. . 3 ⊢ 𝑃 = (𝑆X_s𝑅)
2		eqid 2725	. . 3 ⊢ (Base‘𝑆) = (Base‘𝑆)
3		prdsbas.i	. . 3 ⊢ (𝜑 → dom 𝑅 = 𝐼)
4		prdsbas.s	. . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝑉)
5		prdsbas.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑊)
6		prdsbas.b	. . . 4 ⊢ 𝐵 = (Base‘𝑃)
7	1, 4, 5, 6, 3	prdsbas 17438	. . 3 ⊢ (𝜑 → 𝐵 = X𝑥 ∈ 𝐼 (Base‘(𝑅‘𝑥)))
8		eqidd 2726	. . 3 ⊢ (𝜑 → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)))) = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)))))
9		eqidd 2726	. . 3 ⊢ (𝜑 → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(._r‘(𝑅‘𝑥))(𝑔‘𝑥)))) = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(._r‘(𝑅‘𝑥))(𝑔‘𝑥)))))
10		eqidd 2726	. . 3 ⊢ (𝜑 → (𝑓 ∈ (Base‘𝑆), 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·_𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)))) = (𝑓 ∈ (Base‘𝑆), 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·_𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥)))))
11		eqidd 2726	. . 3 ⊢ (𝜑 → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑆 Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·_𝑖‘(𝑅‘𝑥))(𝑔‘𝑥))))) = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑆 Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·_𝑖‘(𝑅‘𝑥))(𝑔‘𝑥))))))
12		eqidd 2726	. . 3 ⊢ (𝜑 → (∏_t‘(TopOpen ∘ 𝑅)) = (∏_t‘(TopOpen ∘ 𝑅)))
13		eqidd 2726	. . 3 ⊢ (𝜑 → {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))} = {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))})
14		eqidd 2726	. . 3 ⊢ (𝜑 → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(dist‘(𝑅‘𝑥))(𝑔‘𝑥))) ∪ {0}), ℝ^, < )) = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(dist‘(𝑅‘𝑥))(𝑔‘𝑥))) ∪ {0}), ℝ^, < )))
15		eqidd 2726	. . 3 ⊢ (𝜑 → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥))) = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥))))
16		eqidd 2726	. . 3 ⊢ (𝜑 → (𝑎 ∈ (𝐵 × 𝐵), 𝑐 ∈ 𝐵 ↦ (𝑑 ∈ ((2^nd ‘𝑎)(𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))𝑐), 𝑒 ∈ ((𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))‘𝑎) ↦ (𝑥 ∈ 𝐼 ↦ ((𝑑‘𝑥)(⟨((1^st ‘𝑎)‘𝑥), ((2^nd ‘𝑎)‘𝑥)⟩(comp‘(𝑅‘𝑥))(𝑐‘𝑥))(𝑒‘𝑥))))) = (𝑎 ∈ (𝐵 × 𝐵), 𝑐 ∈ 𝐵 ↦ (𝑑 ∈ ((2^nd ‘𝑎)(𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))𝑐), 𝑒 ∈ ((𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))‘𝑎) ↦ (𝑥 ∈ 𝐼 ↦ ((𝑑‘𝑥)(⟨((1^st ‘𝑎)‘𝑥), ((2^nd ‘𝑎)‘𝑥)⟩(comp‘(𝑅‘𝑥))(𝑐‘𝑥))(𝑒‘𝑥))))))
17	1, 2, 3, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 4, 5	prdsval 17436	. 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), (𝑎 ∈ (𝐵 × 𝐵), 𝑐 ∈ 𝐵 ↦ (𝑑 ∈ ((2^nd ‘𝑎)(𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))𝑐), 𝑒 ∈ ((𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))‘𝑎) ↦ (𝑥 ∈ 𝐼 ↦ ((𝑑‘𝑥)(⟨((1^st ‘𝑎)‘𝑥), ((2^nd ‘𝑎)‘𝑥)⟩(comp‘(𝑅‘𝑥))(𝑐‘𝑥))(𝑒‘𝑥)))))⟩})))
18		prdsplusg.b	. 2 ⊢ + = (+_g‘𝑃)
19		plusgid 17259	. 2 ⊢ +_g = Slot (+_g‘ndx)
20		ovssunirn 7452	. . . . . . . . . . 11 ⊢ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)) ⊆ ∪ ran (+_g‘(𝑅‘𝑥))
21	19	strfvss 17155	. . . . . . . . . . . . 13 ⊢ (+_g‘(𝑅‘𝑥)) ⊆ ∪ ran (𝑅‘𝑥)
22		fvssunirn 6925	. . . . . . . . . . . . . 14 ⊢ (𝑅‘𝑥) ⊆ ∪ ran 𝑅
23		rnss 5935	. . . . . . . . . . . . . 14 ⊢ ((𝑅‘𝑥) ⊆ ∪ ran 𝑅 → ran (𝑅‘𝑥) ⊆ ran ∪ ran 𝑅)
24		uniss 4911	. . . . . . . . . . . . . 14 ⊢ (ran (𝑅‘𝑥) ⊆ ran ∪ ran 𝑅 → ∪ ran (𝑅‘𝑥) ⊆ ∪ ran ∪ ran 𝑅)
25	22, 23, 24	mp2b 10	. . . . . . . . . . . . 13 ⊢ ∪ ran (𝑅‘𝑥) ⊆ ∪ ran ∪ ran 𝑅
26	21, 25	sstri 3982	. . . . . . . . . . . 12 ⊢ (+_g‘(𝑅‘𝑥)) ⊆ ∪ ran ∪ ran 𝑅
27		rnss 5935	. . . . . . . . . . . 12 ⊢ ((+_g‘(𝑅‘𝑥)) ⊆ ∪ ran ∪ ran 𝑅 → ran (+_g‘(𝑅‘𝑥)) ⊆ ran ∪ ran ∪ ran 𝑅)
28		uniss 4911	. . . . . . . . . . . 12 ⊢ (ran (+_g‘(𝑅‘𝑥)) ⊆ ran ∪ ran ∪ ran 𝑅 → ∪ ran (+_g‘(𝑅‘𝑥)) ⊆ ∪ ran ∪ ran ∪ ran 𝑅)
29	26, 27, 28	mp2b 10	. . . . . . . . . . 11 ⊢ ∪ ran (+_g‘(𝑅‘𝑥)) ⊆ ∪ ran ∪ ran ∪ ran 𝑅
30	20, 29	sstri 3982	. . . . . . . . . 10 ⊢ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)) ⊆ ∪ ran ∪ ran ∪ ran 𝑅
31		ovex 7449	. . . . . . . . . . 11 ⊢ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)) ∈ V
32	31	elpw 4602	. . . . . . . . . 10 ⊢ (((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)) ∈ 𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↔ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)) ⊆ ∪ ran ∪ ran ∪ ran 𝑅)
33	30, 32	mpbir 230	. . . . . . . . 9 ⊢ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)) ∈ 𝒫 ∪ ran ∪ ran ∪ ran 𝑅
34	33	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)) ∈ 𝒫 ∪ ran ∪ ran ∪ ran 𝑅)
35	34	fmpttd 7120	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥))):𝐼⟶𝒫 ∪ ran ∪ ran ∪ ran 𝑅)
36		rnexg 7908	. . . . . . . . . . 11 ⊢ (𝑅 ∈ 𝑊 → ran 𝑅 ∈ V)
37		uniexg 7743	. . . . . . . . . . 11 ⊢ (ran 𝑅 ∈ V → ∪ ran 𝑅 ∈ V)
38	5, 36, 37	3syl 18	. . . . . . . . . 10 ⊢ (𝜑 → ∪ ran 𝑅 ∈ V)
39		rnexg 7908	. . . . . . . . . 10 ⊢ (∪ ran 𝑅 ∈ V → ran ∪ ran 𝑅 ∈ V)
40		uniexg 7743	. . . . . . . . . 10 ⊢ (ran ∪ ran 𝑅 ∈ V → ∪ ran ∪ ran 𝑅 ∈ V)
41	38, 39, 40	3syl 18	. . . . . . . . 9 ⊢ (𝜑 → ∪ ran ∪ ran 𝑅 ∈ V)
42		rnexg 7908	. . . . . . . . 9 ⊢ (∪ ran ∪ ran 𝑅 ∈ V → ran ∪ ran ∪ ran 𝑅 ∈ V)
43		uniexg 7743	. . . . . . . . 9 ⊢ (ran ∪ ran ∪ ran 𝑅 ∈ V → ∪ ran ∪ ran ∪ ran 𝑅 ∈ V)
44		pwexg 5372	. . . . . . . . 9 ⊢ (∪ ran ∪ ran ∪ ran 𝑅 ∈ V → 𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ∈ V)
45	41, 42, 43, 44	4syl 19	. . . . . . . 8 ⊢ (𝜑 → 𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ∈ V)
46	5	dmexd 7909	. . . . . . . . 9 ⊢ (𝜑 → dom 𝑅 ∈ V)
47	3, 46	eqeltrrd 2826	. . . . . . . 8 ⊢ (𝜑 → 𝐼 ∈ V)
48	45, 47	elmapd 8857	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥))) ∈ (𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑_m 𝐼) ↔ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥))):𝐼⟶𝒫 ∪ ran ∪ ran ∪ ran 𝑅))
49	35, 48	mpbird 256	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥))) ∈ (𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑_m 𝐼))
50	49	ralrimivw 3140	. . . . 5 ⊢ (𝜑 → ∀𝑔 ∈ 𝐵 (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥))) ∈ (𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑_m 𝐼))
51	50	ralrimivw 3140	. . . 4 ⊢ (𝜑 → ∀𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥))) ∈ (𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑_m 𝐼))
52		eqid 2725	. . . . 5 ⊢ (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)))) = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥))))
53	52	fmpo 8070	. . . 4 ⊢ (∀𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥))) ∈ (𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑_m 𝐼) ↔ (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)))):(𝐵 × 𝐵)⟶(𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑_m 𝐼))
54	51, 53	sylib 217	. . 3 ⊢ (𝜑 → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)))):(𝐵 × 𝐵)⟶(𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑_m 𝐼))
55	6	fvexi 6906	. . . . 5 ⊢ 𝐵 ∈ V
56	55, 55	xpex 7753	. . . 4 ⊢ (𝐵 × 𝐵) ∈ V
57		ovex 7449	. . . 4 ⊢ (𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑_m 𝐼) ∈ V
58		fex2 7939	. . . 4 ⊢ (((𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)))):(𝐵 × 𝐵)⟶(𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑_m 𝐼) ∧ (𝐵 × 𝐵) ∈ V ∧ (𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑_m 𝐼) ∈ V) → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)))) ∈ V)
59	56, 57, 58	mp3an23 1449	. . 3 ⊢ ((𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)))):(𝐵 × 𝐵)⟶(𝒫 ∪ ran ∪ ran ∪ ran 𝑅 ↑_m 𝐼) → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)))) ∈ V)
60	54, 59	syl 17	. 2 ⊢ (𝜑 → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)))) ∈ V)
61		snsstp2 4816	. . . 4 ⊢ {⟨(+_g‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩} ⊆ {⟨(Base‘ndx), 𝐵⟩, ⟨(+_g‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩, ⟨(._r‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(._r‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩}
62		ssun1 4166	. . . 4 ⊢ {⟨(Base‘ndx), 𝐵⟩, ⟨(+_g‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩, ⟨(._r‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(._r‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+_g‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩, ⟨(._r‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(._r‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·_𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·_𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩, ⟨(·_𝑖‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑆 Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·_𝑖‘(𝑅‘𝑥))(𝑔‘𝑥)))))⟩})
63	61, 62	sstri 3982	. . 3 ⊢ {⟨(+_g‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+_g‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩, ⟨(._r‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(._r‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·_𝑠 ‘ndx), (𝑓 ∈ (Base‘𝑆), 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ (𝑓( ·_𝑠 ‘(𝑅‘𝑥))(𝑔‘𝑥))))⟩, ⟨(·_𝑖‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑆 Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·_𝑖‘(𝑅‘𝑥))(𝑔‘𝑥)))))⟩})
64		ssun1 4166	. . 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), (𝑎 ∈ (𝐵 × 𝐵), 𝑐 ∈ 𝐵 ↦ (𝑑 ∈ ((2^nd ‘𝑎)(𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))𝑐), 𝑒 ∈ ((𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))‘𝑎) ↦ (𝑥 ∈ 𝐼 ↦ ((𝑑‘𝑥)(⟨((1^st ‘𝑎)‘𝑥), ((2^nd ‘𝑎)‘𝑥)⟩(comp‘(𝑅‘𝑥))(𝑐‘𝑥))(𝑒‘𝑥)))))⟩}))
65	63, 64	sstri 3982	. 2 ⊢ {⟨(+_g‘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), (𝑎 ∈ (𝐵 × 𝐵), 𝑐 ∈ 𝐵 ↦ (𝑑 ∈ ((2^nd ‘𝑎)(𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))𝑐), 𝑒 ∈ ((𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ X𝑥 ∈ 𝐼 ((𝑓‘𝑥)(Hom ‘(𝑅‘𝑥))(𝑔‘𝑥)))‘𝑎) ↦ (𝑥 ∈ 𝐼 ↦ ((𝑑‘𝑥)(⟨((1^st ‘𝑎)‘𝑥), ((2^nd ‘𝑎)‘𝑥)⟩(comp‘(𝑅‘𝑥))(𝑐‘𝑥))(𝑒‘𝑥)))))⟩}))
66	17, 18, 19, 60, 65	prdsbaslem 17434	1 ⊢ (𝜑 → + = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(+_g‘(𝑅‘𝑥))(𝑔‘𝑥)))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ∀wral 3051 Vcvv 3463 ∪ cun 3937 ⊆ wss 3939 𝒫 cpw 4598 {csn 4624 {cpr 4626 {ctp 4628 ⟨cop 4630 ∪ cuni 4903 class class class wbr 5143 {copab 5205 ↦ cmpt 5226 × cxp 5670 dom cdm 5672 ran crn 5673 ∘ ccom 5676 ⟶wf 6539 ‘cfv 6543 (class class class)co 7416 ∈ cmpo 7418 1^st c1st 7989 2^nd c2nd 7990 ↑_m cmap 8843 Xcixp 8914 supcsup 9463 0cc0 11138 ℝ^*cxr 11277 < clt 11278 ndxcnx 17161 Basecbs 17179 +_gcplusg 17232 ._rcmulr 17233 Scalarcsca 17235 ·_𝑠 cvsca 17236 ·_𝑖cip 17237 TopSetcts 17238 lecple 17239 distcds 17241 Hom chom 17243 compcco 17244 TopOpenctopn 17402 ∏_tcpt 17419 Σ_g cgsu 17421 X_scprds 17426

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5294 ax-nul 5301 ax-pow 5359 ax-pr 5423 ax-un 7738 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3769 df-csb 3885 df-dif 3942 df-un 3944 df-in 3946 df-ss 3956 df-pss 3959 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-tp 4629 df-op 4631 df-uni 4904 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5227 df-tr 5261 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7372 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7869 df-1st 7991 df-2nd 7992 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8723 df-map 8845 df-ixp 8915 df-en 8963 df-dom 8964 df-sdom 8965 df-fin 8966 df-sup 9465 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-nn 12243 df-2 12305 df-3 12306 df-4 12307 df-5 12308 df-6 12309 df-7 12310 df-8 12311 df-9 12312 df-n0 12503 df-z 12589 df-dec 12708 df-uz 12853 df-fz 13517 df-struct 17115 df-slot 17150 df-ndx 17162 df-base 17180 df-plusg 17245 df-mulr 17246 df-sca 17248 df-vsca 17249 df-ip 17250 df-tset 17251 df-ple 17252 df-ds 17254 df-hom 17256 df-cco 17257 df-prds 17428

This theorem is referenced by: prdsmulr 17440 prdsvsca 17441 prdsip 17442 prdsle 17443 prdsds 17445 prdstset 17447 prdshom 17448 prdsco 17449 prdsplusgval 17454 prdsmgp 20095

W3C validator