Theorem mrsubffval 31404

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 3212	. . 3 ⊢ (𝑇 ∈ 𝑊 → 𝑇 ∈ V)
3		fveq2 6191	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (mREx‘𝑡) = (mREx‘𝑇))
4		mrsubffval.r	. . . . . . 7 ⊢ 𝑅 = (mREx‘𝑇)
5	3, 4	syl6eqr 2674	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mREx‘𝑡) = 𝑅)
6		fveq2 6191	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (mVR‘𝑡) = (mVR‘𝑇))
7		mrsubffval.v	. . . . . . 7 ⊢ 𝑉 = (mVR‘𝑇)
8	6, 7	syl6eqr 2674	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mVR‘𝑡) = 𝑉)
9	5, 8	oveq12d 6668	. . . . 5 ⊢ (𝑡 = 𝑇 → ((mREx‘𝑡) ↑pm (mVR‘𝑡)) = (𝑅 ↑pm 𝑉))
10		fveq2 6191	. . . . . . . . . . 11 ⊢ (𝑡 = 𝑇 → (mCN‘𝑡) = (mCN‘𝑇))
11		mrsubffval.c	. . . . . . . . . . 11 ⊢ 𝐶 = (mCN‘𝑇)
12	10, 11	syl6eqr 2674	. . . . . . . . . 10 ⊢ (𝑡 = 𝑇 → (mCN‘𝑡) = 𝐶)
13	12, 8	uneq12d 3768	. . . . . . . . 9 ⊢ (𝑡 = 𝑇 → ((mCN‘𝑡) ∪ (mVR‘𝑡)) = (𝐶 ∪ 𝑉))
14	13	fveq2d 6195	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) = (freeMnd‘(𝐶 ∪ 𝑉)))
15		mrsubffval.g	. . . . . . . 8 ⊢ 𝐺 = (freeMnd‘(𝐶 ∪ 𝑉))
16	14, 15	syl6eqr 2674	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) = 𝐺)
17	13	mpteq1d 4738	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) = (𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)))
18	17	coeq1d 5283	. . . . . . 7 ⊢ (𝑡 = 𝑇 → ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒) = ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))
19	16, 18	oveq12d 6668	. . . . . 6 ⊢ (𝑡 = 𝑇 → ((freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) Σg ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)) = (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))
20	5, 19	mpteq12dv 4733	. . . . 5 ⊢ (𝑡 = 𝑇 → (𝑒 ∈ (mREx‘𝑡) ↦ ((freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) Σg ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
21	9, 20	mpteq12dv 4733	. . . 4 ⊢ (𝑡 = 𝑇 → (𝑓 ∈ ((mREx‘𝑡) ↑pm (mVR‘𝑡)) ↦ (𝑒 ∈ (mREx‘𝑡) ↦ ((freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) Σg ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))) = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
22		df-mrsub 31387	. . . 4 ⊢ mRSubst = (𝑡 ∈ V ↦ (𝑓 ∈ ((mREx‘𝑡) ↑pm (mVR‘𝑡)) ↦ (𝑒 ∈ (mREx‘𝑡) ↦ ((freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) Σg ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
23		ovex 6678	. . . . 5 ⊢ (𝑅 ↑pm 𝑉) ∈ V
24	23	mptex 6486	. . . 4 ⊢ (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))) ∈ V
25	21, 22, 24	fvmpt 6282	. . 3 ⊢ (𝑇 ∈ V → (mRSubst‘𝑇) = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
26	2, 25	syl 17	. 2 ⊢ (𝑇 ∈ 𝑊 → (mRSubst‘𝑇) = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
27	1, 26	syl5eq 2668	1 ⊢ (𝑇 ∈ 𝑊 → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))

Syntax hints:   → wi 4   = wceq 1483   ∈ wcel 1990  Vcvv 3200   ∪ cun 3572  ifcif 4086   ↦ cmpt 4729  dom cdm 5114   ∘ ccom 5118  ‘cfv 5888  (class class class)co 6650   ↑_pm cpm 7858  ⟨“cs1 13294   Σ_g cgsu 16101  freeMndcfrmd 17384  mCNcmcn 31357  mVRcmvar 31358  mRExcmrex 31363  mRSubstcmrsub 31367

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-mrsub 31387

This theorem is referenced by:  mrsubfval  31405  mrsubff  31409