Theorem mvhfval 36277

Description: Value of the function mapping variables to their corresponding variable expressions. (Contributed by Mario Carneiro, 18-Jul-2016.)

Hypotheses

Ref	Expression
mvhfval.v	⊢ 𝑉 = (mVR‘𝑇)
mvhfval.y	⊢ 𝑌 = (mType‘𝑇)
mvhfval.h	⊢ 𝐻 = (mVH‘𝑇)

Assertion

Ref	Expression
mvhfval	⊢ 𝐻 = (𝑣 ∈ 𝑉 ↦ ⟨(𝑌‘𝑣), ⟨“𝑣”⟩⟩)

Distinct variable groups:   𝑣,𝑇   𝑣,𝑉   𝑣,𝑌

Allowed substitution hint:   𝐻(𝑣)

Proof of Theorem mvhfval

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mvhfval.h	. 2 ⊢ 𝐻 = (mVH‘𝑇)
2		fveq2 6883	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mVR‘𝑡) = (mVR‘𝑇))
3		mvhfval.v	. . . . . 6 ⊢ 𝑉 = (mVR‘𝑇)
4	2, 3	eqtr4di 2814	. . . . 5 ⊢ (𝑡 = 𝑇 → (mVR‘𝑡) = 𝑉)
5		fveq2 6883	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (mType‘𝑡) = (mType‘𝑇))
6		mvhfval.y	. . . . . . . 8 ⊢ 𝑌 = (mType‘𝑇)
7	5, 6	eqtr4di 2814	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (mType‘𝑡) = 𝑌)
8	7	fveq1d 6885	. . . . . 6 ⊢ (𝑡 = 𝑇 → ((mType‘𝑡)‘𝑣) = (𝑌‘𝑣))
9	8	opeq1d 4839	. . . . 5 ⊢ (𝑡 = 𝑇 → ⟨((mType‘𝑡)‘𝑣), ⟨“𝑣”⟩⟩ = ⟨(𝑌‘𝑣), ⟨“𝑣”⟩⟩)
10	4, 9	mpteq12dv 5192	. . . 4 ⊢ (𝑡 = 𝑇 → (𝑣 ∈ (mVR‘𝑡) ↦ ⟨((mType‘𝑡)‘𝑣), ⟨“𝑣”⟩⟩) = (𝑣 ∈ 𝑉 ↦ ⟨(𝑌‘𝑣), ⟨“𝑣”⟩⟩))
11		df-mvh 36236	. . . 4 ⊢ mVH = (𝑡 ∈ V ↦ (𝑣 ∈ (mVR‘𝑡) ↦ ⟨((mType‘𝑡)‘𝑣), ⟨“𝑣”⟩⟩))
12	10, 11, 3	mptfvmpt 7232	. . 3 ⊢ (𝑇 ∈ V → (mVH‘𝑇) = (𝑣 ∈ 𝑉 ↦ ⟨(𝑌‘𝑣), ⟨“𝑣”⟩⟩))
13		mpt0 6679	. . . . 5 ⊢ (𝑣 ∈ ∅ ↦ ⟨(𝑌‘𝑣), ⟨“𝑣”⟩⟩) = ∅
14	13	eqcomi 2770	. . . 4 ⊢ ∅ = (𝑣 ∈ ∅ ↦ ⟨(𝑌‘𝑣), ⟨“𝑣”⟩⟩)
15		fvprc 6875	. . . 4 ⊢ (¬ 𝑇 ∈ V → (mVH‘𝑇) = ∅)
16		fvprc 6875	. . . . . 6 ⊢ (¬ 𝑇 ∈ V → (mVR‘𝑇) = ∅)
17	3, 16	eqtrid 2808	. . . . 5 ⊢ (¬ 𝑇 ∈ V → 𝑉 = ∅)
18	17	mpteq1d 5195	. . . 4 ⊢ (¬ 𝑇 ∈ V → (𝑣 ∈ 𝑉 ↦ ⟨(𝑌‘𝑣), ⟨“𝑣”⟩⟩) = (𝑣 ∈ ∅ ↦ ⟨(𝑌‘𝑣), ⟨“𝑣”⟩⟩))
19	14, 15, 18	3eqtr4a 2822	. . 3 ⊢ (¬ 𝑇 ∈ V → (mVH‘𝑇) = (𝑣 ∈ 𝑉 ↦ ⟨(𝑌‘𝑣), ⟨“𝑣”⟩⟩))
20	12, 19	pm2.61i 184	. 2 ⊢ (mVH‘𝑇) = (𝑣 ∈ 𝑉 ↦ ⟨(𝑌‘𝑣), ⟨“𝑣”⟩⟩)
21	1, 20	eqtri 2784	1 ⊢ 𝐻 = (𝑣 ∈ 𝑉 ↦ ⟨(𝑌‘𝑣), ⟨“𝑣”⟩⟩)

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ∅c0 4279  ⟨cop 4590   ↦ cmpt 5186  ‘cfv 6537  ⟨“cs1 14735  mVRcmvar 36205  mTypecmty 36206  mVHcmvh 36216

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 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-mvh 36236

This theorem is used by:  mvhval  36278  mvhf  36302