Theorem psrvscafval 19211

Description: The scalar multiplication operation of the multivariate power series structure. (Contributed by Mario Carneiro, 28-Dec-2014.) (Revised by Mario Carneiro, 2-Oct-2015.)

Hypotheses

Ref	Expression
psrvsca.s	⊢ 𝑆 = (𝐼 mPwSer 𝑅)
psrvsca.n	⊢ ∙ = ( ·𝑠 ‘𝑆)
psrvsca.k	⊢ 𝐾 = (Base‘𝑅)
psrvsca.b	⊢ 𝐵 = (Base‘𝑆)
psrvsca.m	⊢ · = (.r‘𝑅)
psrvsca.d	⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}

Assertion

Ref	Expression
psrvscafval	⊢ ∙ = (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓))

Distinct variable groups:   𝑥,𝑓,𝐵   𝑓,ℎ,𝐼,𝑥   𝑓,𝐾,𝑥   𝐷,𝑓,𝑥   𝑅,𝑓,𝑥   · ,𝑓,𝑥   ∙ ,𝑓,𝑥

Allowed substitution hints:   𝐵(ℎ)   𝐷(ℎ)   𝑅(ℎ)   𝑆(𝑥,𝑓,ℎ)   ∙ (ℎ)   · (ℎ)   𝐾(ℎ)

Proof of Theorem psrvscafval

Dummy variables 𝑔 𝑘 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		psrvsca.s	. . . . 5 ⊢ 𝑆 = (𝐼 mPwSer 𝑅)
2		psrvsca.k	. . . . 5 ⊢ 𝐾 = (Base‘𝑅)
3		eqid 2610	. . . . 5 ⊢ (+g‘𝑅) = (+g‘𝑅)
4		psrvsca.m	. . . . 5 ⊢ · = (.r‘𝑅)
5		eqid 2610	. . . . 5 ⊢ (TopOpen‘𝑅) = (TopOpen‘𝑅)
6		psrvsca.d	. . . . 5 ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}
7		psrvsca.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑆)
8		simpl 472	. . . . . 6 ⊢ ((𝐼 ∈ V ∧ 𝑅 ∈ V) → 𝐼 ∈ V)
9	1, 2, 6, 7, 8	psrbas 19199	. . . . 5 ⊢ ((𝐼 ∈ V ∧ 𝑅 ∈ V) → 𝐵 = (𝐾 ↑𝑚 𝐷))
10		eqid 2610	. . . . . 6 ⊢ (+g‘𝑆) = (+g‘𝑆)
11	1, 7, 3, 10	psrplusg 19202	. . . . 5 ⊢ (+g‘𝑆) = ( ∘𝑓 (+g‘𝑅) ↾ (𝐵 × 𝐵))
12		eqid 2610	. . . . . 6 ⊢ (.r‘𝑆) = (.r‘𝑆)
13	1, 7, 4, 12, 6	psrmulr 19205	. . . . 5 ⊢ (.r‘𝑆) = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑘 ∈ 𝐷 ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘𝑟 ≤ 𝑘} ↦ ((𝑓‘𝑥) · (𝑔‘(𝑘 ∘𝑓 − 𝑥)))))))
14		eqid 2610	. . . . 5 ⊢ (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓)) = (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓))
15		eqidd 2611	. . . . 5 ⊢ ((𝐼 ∈ V ∧ 𝑅 ∈ V) → (∏t‘(𝐷 × {(TopOpen‘𝑅)})) = (∏t‘(𝐷 × {(TopOpen‘𝑅)})))
16		simpr 476	. . . . 5 ⊢ ((𝐼 ∈ V ∧ 𝑅 ∈ V) → 𝑅 ∈ V)
17	1, 2, 3, 4, 5, 6, 9, 11, 13, 14, 15, 8, 16	psrval 19183	. . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑅 ∈ V) → 𝑆 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g‘𝑆)⟩, ⟨(.r‘ndx), (.r‘𝑆)⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘(𝐷 × {(TopOpen‘𝑅)}))⟩}))
18	17	fveq2d 6107	. . 3 ⊢ ((𝐼 ∈ V ∧ 𝑅 ∈ V) → ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g‘𝑆)⟩, ⟨(.r‘ndx), (.r‘𝑆)⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘(𝐷 × {(TopOpen‘𝑅)}))⟩})))
19		psrvsca.n	. . 3 ⊢ ∙ = ( ·𝑠 ‘𝑆)
20		fvex 6113	. . . . . 6 ⊢ (Base‘𝑅) ∈ V
21	2, 20	eqeltri 2684	. . . . 5 ⊢ 𝐾 ∈ V
22		fvex 6113	. . . . . 6 ⊢ (Base‘𝑆) ∈ V
23	7, 22	eqeltri 2684	. . . . 5 ⊢ 𝐵 ∈ V
24	21, 23	mpt2ex 7136	. . . 4 ⊢ (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓)) ∈ V
25		psrvalstr 19184	. . . . 5 ⊢ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g‘𝑆)⟩, ⟨(.r‘ndx), (.r‘𝑆)⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘(𝐷 × {(TopOpen‘𝑅)}))⟩}) Struct ⟨1, 9⟩
26		vscaid 15839	. . . . 5 ⊢ ·𝑠 = Slot ( ·𝑠 ‘ndx)
27		snsstp2 4288	. . . . . 6 ⊢ {⟨( ·𝑠 ‘ndx), (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓))⟩} ⊆ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘(𝐷 × {(TopOpen‘𝑅)}))⟩}
28		ssun2 3739	. . . . . 6 ⊢ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘(𝐷 × {(TopOpen‘𝑅)}))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g‘𝑆)⟩, ⟨(.r‘ndx), (.r‘𝑆)⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘(𝐷 × {(TopOpen‘𝑅)}))⟩})
29	27, 28	sstri 3577	. . . . 5 ⊢ {⟨( ·𝑠 ‘ndx), (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓))⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g‘𝑆)⟩, ⟨(.r‘ndx), (.r‘𝑆)⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘(𝐷 × {(TopOpen‘𝑅)}))⟩})
30	25, 26, 29	strfv 15735	. . . 4 ⊢ ((𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓)) ∈ V → (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓)) = ( ·𝑠 ‘({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g‘𝑆)⟩, ⟨(.r‘ndx), (.r‘𝑆)⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘(𝐷 × {(TopOpen‘𝑅)}))⟩})))
31	24, 30	ax-mp 5	. . 3 ⊢ (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓)) = ( ·𝑠 ‘({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g‘𝑆)⟩, ⟨(.r‘ndx), (.r‘𝑆)⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘(𝐷 × {(TopOpen‘𝑅)}))⟩}))
32	18, 19, 31	3eqtr4g 2669	. 2 ⊢ ((𝐼 ∈ V ∧ 𝑅 ∈ V) → ∙ = (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓)))
33		eqid 2610	. . . . . 6 ⊢ ∅ = ∅
34		fn0 5924	. . . . . 6 ⊢ (∅ Fn ∅ ↔ ∅ = ∅)
35	33, 34	mpbir 220	. . . . 5 ⊢ ∅ Fn ∅
36		reldmpsr 19182	. . . . . . . . . 10 ⊢ Rel dom mPwSer
37	36	ovprc 6581	. . . . . . . . 9 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPwSer 𝑅) = ∅)
38	1, 37	syl5eq 2656	. . . . . . . 8 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → 𝑆 = ∅)
39	38	fveq2d 6107	. . . . . . 7 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘∅))
40		df-vsca 15785	. . . . . . . 8 ⊢ ·𝑠 = Slot 6
41	40	str0 15739	. . . . . . 7 ⊢ ∅ = ( ·𝑠 ‘∅)
42	39, 19, 41	3eqtr4g 2669	. . . . . 6 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → ∙ = ∅)
43	36, 1, 7	elbasov 15749	. . . . . . . . . 10 ⊢ (𝑓 ∈ 𝐵 → (𝐼 ∈ V ∧ 𝑅 ∈ V))
44	43	con3i 149	. . . . . . . . 9 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → ¬ 𝑓 ∈ 𝐵)
45	44	eq0rdv 3931	. . . . . . . 8 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → 𝐵 = ∅)
46	45	xpeq2d 5063	. . . . . . 7 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐾 × 𝐵) = (𝐾 × ∅))
47		xp0 5471	. . . . . . 7 ⊢ (𝐾 × ∅) = ∅
48	46, 47	syl6eq 2660	. . . . . 6 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐾 × 𝐵) = ∅)
49	42, 48	fneq12d 5897	. . . . 5 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → ( ∙ Fn (𝐾 × 𝐵) ↔ ∅ Fn ∅))
50	35, 49	mpbiri 247	. . . 4 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → ∙ Fn (𝐾 × 𝐵))
51		fnov 6666	. . . 4 ⊢ ( ∙ Fn (𝐾 × 𝐵) ↔ ∙ = (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ (𝑥 ∙ 𝑓)))
52	50, 51	sylib 207	. . 3 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → ∙ = (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ (𝑥 ∙ 𝑓)))
53	44	pm2.21d 117	. . . . . 6 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝑓 ∈ 𝐵 → ((𝐷 × {𝑥}) ∘𝑓 · 𝑓) = (𝑥 ∙ 𝑓)))
54	53	a1d 25	. . . . 5 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝑥 ∈ 𝐾 → (𝑓 ∈ 𝐵 → ((𝐷 × {𝑥}) ∘𝑓 · 𝑓) = (𝑥 ∙ 𝑓))))
55	54	3imp 1249	. . . 4 ⊢ ((¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) ∧ 𝑥 ∈ 𝐾 ∧ 𝑓 ∈ 𝐵) → ((𝐷 × {𝑥}) ∘𝑓 · 𝑓) = (𝑥 ∙ 𝑓))
56	55	mpt2eq3dva 6617	. . 3 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓)) = (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ (𝑥 ∙ 𝑓)))
57	52, 56	eqtr4d 2647	. 2 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → ∙ = (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓)))
58	32, 57	pm2.61i 175	1 ⊢ ∙ = (𝑥 ∈ 𝐾, 𝑓 ∈ 𝐵 ↦ ((𝐷 × {𝑥}) ∘𝑓 · 𝑓))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  {crab 2900  Vcvv 3173   ∪ cun 3538  ∅c0 3874  {csn 4125  {ctp 4129  ⟨cop 4131   × cxp 5036  ^◡ccnv 5037   “ cima 5041   Fn wfn 5799  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551   ∘_𝑓 cof 6793   ↑_𝑚 cmap 7744  Fincfn 7841  1c1 9816  ℕcn 10897  6c6 10951  9c9 10954  ℕ₀cn0 11169  ndxcnx 15692  Basecbs 15695  +_gcplusg 15768  ._rcmulr 15769  Scalarcsca 15771   ·_𝑠 cvsca 15772  TopSetcts 15774  TopOpenctopn 15905  ∏_tcpt 15922   mPwSer cmps 19172

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-of 6795  df-om 6958  df-1st 7059  df-2nd 7060  df-supp 7183  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-map 7746  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-fsupp 8159  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-3 10957  df-4 10958  df-5 10959  df-6 10960  df-7 10961  df-8 10962  df-9 10963  df-n0 11170  df-z 11255  df-uz 11564  df-fz 12198  df-struct 15697  df-ndx 15698  df-slot 15699  df-base 15700  df-plusg 15781  df-mulr 15782  df-sca 15784  df-vsca 15785  df-tset 15787  df-psr 19177

This theorem is referenced by:  psrvsca  19212