Theorem mvrsval 36356

Description: The set of variables in an expression. (Contributed by Mario Carneiro, 18-Jul-2016.)

Hypotheses

Ref	Expression
mvrsval.v	⊢ 𝑉 = (mVR‘𝑇)
mvrsval.e	⊢ 𝐸 = (mEx‘𝑇)
mvrsval.w	⊢ 𝑊 = (mVars‘𝑇)

Assertion

Ref	Expression
mvrsval	⊢ (𝑋 ∈ 𝐸 → (𝑊‘𝑋) = (ran (2nd ‘𝑋) ∩ 𝑉))

Proof of Theorem mvrsval

Dummy variables 𝑡 𝑒 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mvrsval.w	. . 3 ⊢ 𝑊 = (mVars‘𝑇)
2		elfvex 6920	. . . . 5 ⊢ (𝑋 ∈ (mEx‘𝑇) → 𝑇 ∈ V)
3		mvrsval.e	. . . . 5 ⊢ 𝐸 = (mEx‘𝑇)
4	2, 3	eleq2s 2878	. . . 4 ⊢ (𝑋 ∈ 𝐸 → 𝑇 ∈ V)
5		fveq2 6885	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (mEx‘𝑡) = (mEx‘𝑇))
6	5, 3	eqtr4di 2813	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mEx‘𝑡) = 𝐸)
7		fveq2 6885	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (mVR‘𝑡) = (mVR‘𝑇))
8		mvrsval.v	. . . . . . . 8 ⊢ 𝑉 = (mVR‘𝑇)
9	7, 8	eqtr4di 2813	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (mVR‘𝑡) = 𝑉)
10	9	ineq2d 4117	. . . . . 6 ⊢ (𝑡 = 𝑇 → (ran (2nd ‘𝑒) ∩ (mVR‘𝑡)) = (ran (2nd ‘𝑒) ∩ 𝑉))
11	6, 10	mpteq12dv 5191	. . . . 5 ⊢ (𝑡 = 𝑇 → (𝑒 ∈ (mEx‘𝑡) ↦ (ran (2nd ‘𝑒) ∩ (mVR‘𝑡))) = (𝑒 ∈ 𝐸 ↦ (ran (2nd ‘𝑒) ∩ 𝑉)))
12		df-mvrs 36340	. . . . 5 ⊢ mVars = (𝑡 ∈ V ↦ (𝑒 ∈ (mEx‘𝑡) ↦ (ran (2nd ‘𝑒) ∩ (mVR‘𝑡))))
13	11, 12, 3	mptfvmpt 7234	. . . 4 ⊢ (𝑇 ∈ V → (mVars‘𝑇) = (𝑒 ∈ 𝐸 ↦ (ran (2nd ‘𝑒) ∩ 𝑉)))
14	4, 13	syl 18	. . 3 ⊢ (𝑋 ∈ 𝐸 → (mVars‘𝑇) = (𝑒 ∈ 𝐸 ↦ (ran (2nd ‘𝑒) ∩ 𝑉)))
15	1, 14	eqtrid 2807	. 2 ⊢ (𝑋 ∈ 𝐸 → 𝑊 = (𝑒 ∈ 𝐸 ↦ (ran (2nd ‘𝑒) ∩ 𝑉)))
16		fveq2 6885	. . . . 5 ⊢ (𝑒 = 𝑋 → (2nd ‘𝑒) = (2nd ‘𝑋))
17	16	rneqd 5919	. . . 4 ⊢ (𝑒 = 𝑋 → ran (2nd ‘𝑒) = ran (2nd ‘𝑋))
18	17	ineq1d 4116	. . 3 ⊢ (𝑒 = 𝑋 → (ran (2nd ‘𝑒) ∩ 𝑉) = (ran (2nd ‘𝑋) ∩ 𝑉))
19	18	adantl 487	. 2 ⊢ ((𝑋 ∈ 𝐸 ∧ 𝑒 = 𝑋) → (ran (2nd ‘𝑒) ∩ 𝑉) = (ran (2nd ‘𝑋) ∩ 𝑉))
20		id 23	. 2 ⊢ (𝑋 ∈ 𝐸 → 𝑋 ∈ 𝐸)
21		fvex 6898	. . . . 5 ⊢ (2nd ‘𝑋) ∈ V
22	21	rnex 7922	. . . 4 ⊢ ran (2nd ‘𝑋) ∈ V
23	22	inex1 5276	. . 3 ⊢ (ran (2nd ‘𝑋) ∩ 𝑉) ∈ V
24	23	a1i 11	. 2 ⊢ (𝑋 ∈ 𝐸 → (ran (2nd ‘𝑋) ∩ 𝑉) ∈ V)
25	15, 19, 20, 24	fvmptd 7001	1 ⊢ (𝑋 ∈ 𝐸 → (𝑊‘𝑋) = (ran (2nd ‘𝑋) ∩ 𝑉))

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ∩ cin 4089   ↦ cmpt 5185  ran crn 5651  ‘cfv 6538  2^nd c2nd 8000  mVRcmvar 36312  mExcmex 36318  mVarscmvrs 36320

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-mvrs 36340

This theorem is used by:  mvrsfpw  36357  msubvrs  36411