Theorem msubffval 36257

Description: A substitution applied to an expression. (Contributed by Mario Carneiro, 18-Jul-2016.)

Hypotheses

Ref	Expression
msubffval.v	⊢ 𝑉 = (mVR‘𝑇)
msubffval.r	⊢ 𝑅 = (mREx‘𝑇)
msubffval.s	⊢ 𝑆 = (mSubst‘𝑇)
msubffval.e	⊢ 𝐸 = (mEx‘𝑇)
msubffval.o	⊢ 𝑂 = (mRSubst‘𝑇)

Assertion

Ref	Expression
msubffval	⊢ (𝑇 ∈ 𝑊 → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), ((𝑂‘𝑓)‘(2nd ‘𝑒))⟩)))

Distinct variable groups:   𝑒,𝑓,𝐸   𝑒,𝑂,𝑓   𝑅,𝑒,𝑓   𝑇,𝑒,𝑓   𝑒,𝑉,𝑓

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

Proof of Theorem msubffval

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3472	. 2 ⊢ (𝑇 ∈ 𝑊 → 𝑇 ∈ V)
2		msubffval.s	. . 3 ⊢ 𝑆 = (mSubst‘𝑇)
3		fveq2 6877	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (mREx‘𝑡) = (mREx‘𝑇))
4		msubffval.r	. . . . . . 7 ⊢ 𝑅 = (mREx‘𝑇)
5	3, 4	eqtr4di 2814	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mREx‘𝑡) = 𝑅)
6		fveq2 6877	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (mVR‘𝑡) = (mVR‘𝑇))
7		msubffval.v	. . . . . . 7 ⊢ 𝑉 = (mVR‘𝑇)
8	6, 7	eqtr4di 2814	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mVR‘𝑡) = 𝑉)
9	5, 8	oveq12d 7430	. . . . 5 ⊢ (𝑡 = 𝑇 → ((mREx‘𝑡) ↑pm (mVR‘𝑡)) = (𝑅 ↑pm 𝑉))
10		fveq2 6877	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (mEx‘𝑡) = (mEx‘𝑇))
11		msubffval.e	. . . . . . 7 ⊢ 𝐸 = (mEx‘𝑇)
12	10, 11	eqtr4di 2814	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mEx‘𝑡) = 𝐸)
13		fveq2 6877	. . . . . . . . . 10 ⊢ (𝑡 = 𝑇 → (mRSubst‘𝑡) = (mRSubst‘𝑇))
14		msubffval.o	. . . . . . . . . 10 ⊢ 𝑂 = (mRSubst‘𝑇)
15	13, 14	eqtr4di 2814	. . . . . . . . 9 ⊢ (𝑡 = 𝑇 → (mRSubst‘𝑡) = 𝑂)
16	15	fveq1d 6879	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → ((mRSubst‘𝑡)‘𝑓) = (𝑂‘𝑓))
17	16	fveq1d 6879	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (((mRSubst‘𝑡)‘𝑓)‘(2nd ‘𝑒)) = ((𝑂‘𝑓)‘(2nd ‘𝑒)))
18	17	opeq2d 4840	. . . . . 6 ⊢ (𝑡 = 𝑇 → ⟨(1st ‘𝑒), (((mRSubst‘𝑡)‘𝑓)‘(2nd ‘𝑒))⟩ = ⟨(1st ‘𝑒), ((𝑂‘𝑓)‘(2nd ‘𝑒))⟩)
19	12, 18	mpteq12dv 5192	. . . . 5 ⊢ (𝑡 = 𝑇 → (𝑒 ∈ (mEx‘𝑡) ↦ ⟨(1st ‘𝑒), (((mRSubst‘𝑡)‘𝑓)‘(2nd ‘𝑒))⟩) = (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), ((𝑂‘𝑓)‘(2nd ‘𝑒))⟩))
20	9, 19	mpteq12dv 5192	. . . 4 ⊢ (𝑡 = 𝑇 → (𝑓 ∈ ((mREx‘𝑡) ↑pm (mVR‘𝑡)) ↦ (𝑒 ∈ (mEx‘𝑡) ↦ ⟨(1st ‘𝑒), (((mRSubst‘𝑡)‘𝑓)‘(2nd ‘𝑒))⟩)) = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), ((𝑂‘𝑓)‘(2nd ‘𝑒))⟩)))
21		df-msub 36225	. . . 4 ⊢ mSubst = (𝑡 ∈ V ↦ (𝑓 ∈ ((mREx‘𝑡) ↑pm (mVR‘𝑡)) ↦ (𝑒 ∈ (mEx‘𝑡) ↦ ⟨(1st ‘𝑒), (((mRSubst‘𝑡)‘𝑓)‘(2nd ‘𝑒))⟩)))
22		ovex 7445	. . . . 5 ⊢ (𝑅 ↑pm 𝑉) ∈ V
23	22	mptex 7221	. . . 4 ⊢ (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), ((𝑂‘𝑓)‘(2nd ‘𝑒))⟩)) ∈ V
24	20, 21, 23	fvmpt 6985	. . 3 ⊢ (𝑇 ∈ V → (mSubst‘𝑇) = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), ((𝑂‘𝑓)‘(2nd ‘𝑒))⟩)))
25	2, 24	eqtrid 2808	. 2 ⊢ (𝑇 ∈ V → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), ((𝑂‘𝑓)‘(2nd ‘𝑒))⟩)))
26	1, 25	syl 18	1 ⊢ (𝑇 ∈ 𝑊 → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), ((𝑂‘𝑓)‘(2nd ‘𝑒))⟩)))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ⟨cop 4590   ↦ cmpt 5186  ‘cfv 6531  (class class class)co 7412  1^st c1st 7988  2^nd c2nd 7989   ↑_pm cpm 8832  mVRcmvar 36195  mRExcmrex 36200  mExcmex 36201  mRSubstcmrsub 36204  mSubstcmsub 36205

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-msub 36225

This theorem is used by:  msubfval  36258  elmsubrn  36262  msubrn  36263  msubff  36264