Theorem mrsubfval 30659

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
mrsubfval	⊢ ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉) → (𝑆‘𝐹) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))

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

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

Proof of Theorem mrsubfval

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mrsubffval.c	. . . . . 6 ⊢ 𝐶 = (mCN‘𝑇)
2		mrsubffval.v	. . . . . 6 ⊢ 𝑉 = (mVR‘𝑇)
3		mrsubffval.r	. . . . . 6 ⊢ 𝑅 = (mREx‘𝑇)
4		mrsubffval.s	. . . . . 6 ⊢ 𝑆 = (mRSubst‘𝑇)
5		mrsubffval.g	. . . . . 6 ⊢ 𝐺 = (freeMnd‘(𝐶 ∪ 𝑉))
6	1, 2, 3, 4, 5	mrsubffval 30658	. . . . 5 ⊢ (𝑇 ∈ V → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
7	6	adantr 480	. . . 4 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
8		dmeq 5246	. . . . . . . . . . 11 ⊢ (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
9		fdm 5964	. . . . . . . . . . . 12 ⊢ (𝐹:𝐴⟶𝑅 → dom 𝐹 = 𝐴)
10	9	ad2antrl 760	. . . . . . . . . . 11 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → dom 𝐹 = 𝐴)
11	8, 10	sylan9eqr 2666	. . . . . . . . . 10 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → dom 𝑓 = 𝐴)
12	11	eleq2d 2673	. . . . . . . . 9 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → (𝑣 ∈ dom 𝑓 ↔ 𝑣 ∈ 𝐴))
13		simpr 476	. . . . . . . . . 10 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → 𝑓 = 𝐹)
14	13	fveq1d 6105	. . . . . . . . 9 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → (𝑓‘𝑣) = (𝐹‘𝑣))
15	12, 14	ifbieq1d 4059	. . . . . . . 8 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩) = if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩))
16	15	mpteq2dv 4673	. . . . . . 7 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → (𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) = (𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)))
17	16	coeq1d 5205	. . . . . 6 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒) = ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))
18	17	oveq2d 6565	. . . . 5 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)) = (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))
19	18	mpteq2dv 4673	. . . 4 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
20		fvex 6113	. . . . . . 7 ⊢ (mREx‘𝑇) ∈ V
21	3, 20	eqeltri 2684	. . . . . 6 ⊢ 𝑅 ∈ V
22	21	a1i 11	. . . . 5 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝑅 ∈ V)
23		fvex 6113	. . . . . . 7 ⊢ (mVR‘𝑇) ∈ V
24	2, 23	eqeltri 2684	. . . . . 6 ⊢ 𝑉 ∈ V
25	24	a1i 11	. . . . 5 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝑉 ∈ V)
26		simprl 790	. . . . 5 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝐹:𝐴⟶𝑅)
27		simprr 792	. . . . 5 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝐴 ⊆ 𝑉)
28		elpm2r 7761	. . . . 5 ⊢ (((𝑅 ∈ V ∧ 𝑉 ∈ V) ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝐹 ∈ (𝑅 ↑pm 𝑉))
29	22, 25, 26, 27, 28	syl22anc 1319	. . . 4 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝐹 ∈ (𝑅 ↑pm 𝑉))
30	21	mptex 6390	. . . . 5 ⊢ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) ∈ V
31	30	a1i 11	. . . 4 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) ∈ V)
32	7, 19, 29, 31	fvmptd 6197	. . 3 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → (𝑆‘𝐹) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
33	32	ex 449	. 2 ⊢ (𝑇 ∈ V → ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉) → (𝑆‘𝐹) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
34		0fv 6137	. . . 4 ⊢ (∅‘𝐹) = ∅
35		fvprc 6097	. . . . . 6 ⊢ (¬ 𝑇 ∈ V → (mRSubst‘𝑇) = ∅)
36	4, 35	syl5eq 2656	. . . . 5 ⊢ (¬ 𝑇 ∈ V → 𝑆 = ∅)
37	36	fveq1d 6105	. . . 4 ⊢ (¬ 𝑇 ∈ V → (𝑆‘𝐹) = (∅‘𝐹))
38		fvprc 6097	. . . . . . 7 ⊢ (¬ 𝑇 ∈ V → (mREx‘𝑇) = ∅)
39	3, 38	syl5eq 2656	. . . . . 6 ⊢ (¬ 𝑇 ∈ V → 𝑅 = ∅)
40	39	mpteq1d 4666	. . . . 5 ⊢ (¬ 𝑇 ∈ V → (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = (𝑒 ∈ ∅ ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
41		mpt0 5934	. . . . 5 ⊢ (𝑒 ∈ ∅ ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = ∅
42	40, 41	syl6eq 2660	. . . 4 ⊢ (¬ 𝑇 ∈ V → (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = ∅)
43	34, 37, 42	3eqtr4a 2670	. . 3 ⊢ (¬ 𝑇 ∈ V → (𝑆‘𝐹) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
44	43	a1d 25	. 2 ⊢ (¬ 𝑇 ∈ V → ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉) → (𝑆‘𝐹) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
45	33, 44	pm2.61i 175	1 ⊢ ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉) → (𝑆‘𝐹) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  Vcvv 3173   ∪ cun 3538   ⊆ wss 3540  ∅c0 3874  ifcif 4036   ↦ cmpt 4643  dom cdm 5038   ∘ ccom 5042  ⟶wf 5800  ‘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-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

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-pw 4110  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-oprab 6553  df-mpt2 6554  df-pm 7747  df-mrsub 30641

This theorem is referenced by:  mrsubval  30660  mrsubrn  30664  elmrsubrn  30671