Theorem mrsubffval 30658

Description: The substitution of some variables for expressions in a raw expression. (Contributed by Mario Carneiro, 18-Jul-2016.)

Hypotheses

Ref	Expression
mrsubffval.c	⊢ 𝐶 = (mCN‘𝑇)
mrsubffval.v	⊢ 𝑉 = (mVR‘𝑇)
mrsubffval.r	⊢ 𝑅 = (mREx‘𝑇)
mrsubffval.s	⊢ 𝑆 = (mRSubst‘𝑇)
mrsubffval.g	⊢ 𝐺 = (freeMnd‘(𝐶 ∪ 𝑉))

Assertion

Ref	Expression
mrsubffval	⊢ (𝑇 ∈ 𝑊 → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))

Distinct variable groups:   𝑒,𝑓,𝑣,𝐶   𝑅,𝑒,𝑓,𝑣   𝑒,𝐺,𝑓   𝑇,𝑒,𝑓,𝑣   𝑒,𝑉,𝑓,𝑣

Allowed substitution hints:   𝑆(𝑣,𝑒,𝑓)   𝐺(𝑣)   𝑊(𝑣,𝑒,𝑓)

Proof of Theorem mrsubffval

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mrsubffval.s	. 2 ⊢ 𝑆 = (mRSubst‘𝑇)
2		elex 3185	. . 3 ⊢ (𝑇 ∈ 𝑊 → 𝑇 ∈ V)
3		fveq2 6103	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (mREx‘𝑡) = (mREx‘𝑇))
4		mrsubffval.r	. . . . . . 7 ⊢ 𝑅 = (mREx‘𝑇)
5	3, 4	syl6eqr 2662	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mREx‘𝑡) = 𝑅)
6		fveq2 6103	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (mVR‘𝑡) = (mVR‘𝑇))
7		mrsubffval.v	. . . . . . 7 ⊢ 𝑉 = (mVR‘𝑇)
8	6, 7	syl6eqr 2662	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mVR‘𝑡) = 𝑉)
9	5, 8	oveq12d 6567	. . . . 5 ⊢ (𝑡 = 𝑇 → ((mREx‘𝑡) ↑pm (mVR‘𝑡)) = (𝑅 ↑pm 𝑉))
10		fveq2 6103	. . . . . . . . . . 11 ⊢ (𝑡 = 𝑇 → (mCN‘𝑡) = (mCN‘𝑇))
11		mrsubffval.c	. . . . . . . . . . 11 ⊢ 𝐶 = (mCN‘𝑇)
12	10, 11	syl6eqr 2662	. . . . . . . . . 10 ⊢ (𝑡 = 𝑇 → (mCN‘𝑡) = 𝐶)
13	12, 8	uneq12d 3730	. . . . . . . . 9 ⊢ (𝑡 = 𝑇 → ((mCN‘𝑡) ∪ (mVR‘𝑡)) = (𝐶 ∪ 𝑉))
14	13	fveq2d 6107	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) = (freeMnd‘(𝐶 ∪ 𝑉)))
15		mrsubffval.g	. . . . . . . 8 ⊢ 𝐺 = (freeMnd‘(𝐶 ∪ 𝑉))
16	14, 15	syl6eqr 2662	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) = 𝐺)
17	13	mpteq1d 4666	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) = (𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)))
18	17	coeq1d 5205	. . . . . . 7 ⊢ (𝑡 = 𝑇 → ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒) = ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))
19	16, 18	oveq12d 6567	. . . . . 6 ⊢ (𝑡 = 𝑇 → ((freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) Σg ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)) = (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))
20	5, 19	mpteq12dv 4663	. . . . 5 ⊢ (𝑡 = 𝑇 → (𝑒 ∈ (mREx‘𝑡) ↦ ((freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) Σg ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
21	9, 20	mpteq12dv 4663	. . . 4 ⊢ (𝑡 = 𝑇 → (𝑓 ∈ ((mREx‘𝑡) ↑pm (mVR‘𝑡)) ↦ (𝑒 ∈ (mREx‘𝑡) ↦ ((freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) Σg ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))) = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
22		df-mrsub 30641	. . . 4 ⊢ mRSubst = (𝑡 ∈ V ↦ (𝑓 ∈ ((mREx‘𝑡) ↑pm (mVR‘𝑡)) ↦ (𝑒 ∈ (mREx‘𝑡) ↦ ((freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) Σg ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
23		ovex 6577	. . . . 5 ⊢ (𝑅 ↑pm 𝑉) ∈ V
24	23	mptex 6390	. . . 4 ⊢ (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))) ∈ V
25	21, 22, 24	fvmpt 6191	. . 3 ⊢ (𝑇 ∈ V → (mRSubst‘𝑇) = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
26	2, 25	syl 17	. 2 ⊢ (𝑇 ∈ 𝑊 → (mRSubst‘𝑇) = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
27	1, 26	syl5eq 2656	1 ⊢ (𝑇 ∈ 𝑊 → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))

Syntax hints:   → wi 4   = wceq 1475   ∈ wcel 1977  Vcvv 3173   ∪ cun 3538  ifcif 4036   ↦ cmpt 4643  dom cdm 5038   ∘ ccom 5042  ‘cfv 5804  (class class class)co 6549   ↑_pm cpm 7745  ⟨“cs1 13149   Σ_g cgsu 15924  freeMndcfrmd 17207  mCNcmcn 30611  mVRcmvar 30612  mRExcmrex 30617  mRSubstcmrsub 30621

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-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-pr 4833

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  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-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-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  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-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-mrsub 30641

This theorem is referenced by:  mrsubfval  30659  mrsubff  30663