Theorem mrsubfval 35495

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 35494	. . . . 5 ⊢ (𝑇 ∈ V → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
7	6	adantr 480	. . . 4 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
8		dmeq 5867	. . . . . . . . . . 11 ⊢ (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
9		fdm 6697	. . . . . . . . . . . 12 ⊢ (𝐹:𝐴⟶𝑅 → dom 𝐹 = 𝐴)
10	9	ad2antrl 728	. . . . . . . . . . 11 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → dom 𝐹 = 𝐴)
11	8, 10	sylan9eqr 2786	. . . . . . . . . 10 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → dom 𝑓 = 𝐴)
12	11	eleq2d 2814	. . . . . . . . 9 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → (𝑣 ∈ dom 𝑓 ↔ 𝑣 ∈ 𝐴))
13		simpr 484	. . . . . . . . . 10 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → 𝑓 = 𝐹)
14	13	fveq1d 6860	. . . . . . . . 9 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → (𝑓‘𝑣) = (𝐹‘𝑣))
15	12, 14	ifbieq1d 4513	. . . . . . . 8 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩) = if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩))
16	15	mpteq2dv 5201	. . . . . . 7 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → (𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) = (𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)))
17	16	coeq1d 5825	. . . . . 6 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒) = ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))
18	17	oveq2d 7403	. . . . 5 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)) = (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))
19	18	mpteq2dv 5201	. . . 4 ⊢ (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
20	3	fvexi 6872	. . . . . 6 ⊢ 𝑅 ∈ V
21	20	a1i 11	. . . . 5 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝑅 ∈ V)
22	2	fvexi 6872	. . . . . 6 ⊢ 𝑉 ∈ V
23	22	a1i 11	. . . . 5 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝑉 ∈ V)
24		simprl 770	. . . . 5 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝐹:𝐴⟶𝑅)
25		simprr 772	. . . . 5 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝐴 ⊆ 𝑉)
26		elpm2r 8818	. . . . 5 ⊢ (((𝑅 ∈ V ∧ 𝑉 ∈ V) ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝐹 ∈ (𝑅 ↑pm 𝑉))
27	21, 23, 24, 25, 26	syl22anc 838	. . . 4 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝐹 ∈ (𝑅 ↑pm 𝑉))
28	20	mptex 7197	. . . . 5 ⊢ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) ∈ V
29	28	a1i 11	. . . 4 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) ∈ V)
30	7, 19, 27, 29	fvmptd 6975	. . 3 ⊢ ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → (𝑆‘𝐹) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
31	30	ex 412	. 2 ⊢ (𝑇 ∈ V → ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉) → (𝑆‘𝐹) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
32		0fv 6902	. . . 4 ⊢ (∅‘𝐹) = ∅
33		fvprc 6850	. . . . . 6 ⊢ (¬ 𝑇 ∈ V → (mRSubst‘𝑇) = ∅)
34	4, 33	eqtrid 2776	. . . . 5 ⊢ (¬ 𝑇 ∈ V → 𝑆 = ∅)
35	34	fveq1d 6860	. . . 4 ⊢ (¬ 𝑇 ∈ V → (𝑆‘𝐹) = (∅‘𝐹))
36		fvprc 6850	. . . . . . 7 ⊢ (¬ 𝑇 ∈ V → (mREx‘𝑇) = ∅)
37	3, 36	eqtrid 2776	. . . . . 6 ⊢ (¬ 𝑇 ∈ V → 𝑅 = ∅)
38	37	mpteq1d 5197	. . . . 5 ⊢ (¬ 𝑇 ∈ V → (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = (𝑒 ∈ ∅ ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
39		mpt0 6660	. . . . 5 ⊢ (𝑒 ∈ ∅ ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = ∅
40	38, 39	eqtrdi 2780	. . . 4 ⊢ (¬ 𝑇 ∈ V → (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = ∅)
41	32, 35, 40	3eqtr4a 2790	. . 3 ⊢ (¬ 𝑇 ∈ V → (𝑆‘𝐹) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
42	41	a1d 25	. 2 ⊢ (¬ 𝑇 ∈ V → ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉) → (𝑆‘𝐹) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
43	31, 42	pm2.61i 182	1 ⊢ ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉) → (𝑆‘𝐹) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  Vcvv 3447   ∪ cun 3912   ⊆ wss 3914  ∅c0 4296  ifcif 4488   ↦ cmpt 5188  dom cdm 5638   ∘ ccom 5642  ⟶wf 6507  ‘cfv 6511  (class class class)co 7387   ↑_pm cpm 8800  ⟨“cs1 14560   Σ_g cgsu 17403  freeMndcfrmd 18774  mCNcmcn 35447  mVRcmvar 35448  mRExcmrex 35453  mRSubstcmrsub 35457

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-pm 8802  df-mrsub 35477

This theorem is referenced by:  mrsubval  35496  mrsubrn  35500  elmrsubrn  35507