Theorem mvrsval 36437

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 6943	. . . . 5 ⊢ (𝑋 ∈ (mEx‘𝑇) → 𝑇 ∈ V)
3		mvrsval.e	. . . . 5 ⊢ 𝐸 = (mEx‘𝑇)
4	2, 3	eleq2s 2882	. . . 4 ⊢ (𝑋 ∈ 𝐸 → 𝑇 ∈ V)
5		fveq2 6908	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (mEx‘𝑡) = (mEx‘𝑇))
6	5, 3	eqtr4di 2816	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mEx‘𝑡) = 𝐸)
7		fveq2 6908	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (mVR‘𝑡) = (mVR‘𝑇))
8		mvrsval.v	. . . . . . . 8 ⊢ 𝑉 = (mVR‘𝑇)
9	7, 8	eqtr4di 2816	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (mVR‘𝑡) = 𝑉)
10	9	ineq2d 4120	. . . . . 6 ⊢ (𝑡 = 𝑇 → (ran (2nd ‘𝑒) ∩ (mVR‘𝑡)) = (ran (2nd ‘𝑒) ∩ 𝑉))
11	6, 10	mpteq12dv 5195	. . . . 5 ⊢ (𝑡 = 𝑇 → (𝑒 ∈ (mEx‘𝑡) ↦ (ran (2nd ‘𝑒) ∩ (mVR‘𝑡))) = (𝑒 ∈ 𝐸 ↦ (ran (2nd ‘𝑒) ∩ 𝑉)))
12		df-mvrs 36421	. . . . 5 ⊢ mVars = (𝑡 ∈ V ↦ (𝑒 ∈ (mEx‘𝑡) ↦ (ran (2nd ‘𝑒) ∩ (mVR‘𝑡))))
13	11, 12, 3	mptfvmpt 7257	. . . 4 ⊢ (𝑇 ∈ V → (mVars‘𝑇) = (𝑒 ∈ 𝐸 ↦ (ran (2nd ‘𝑒) ∩ 𝑉)))
14	4, 13	syl 18	. . 3 ⊢ (𝑋 ∈ 𝐸 → (mVars‘𝑇) = (𝑒 ∈ 𝐸 ↦ (ran (2nd ‘𝑒) ∩ 𝑉)))
15	1, 14	eqtrid 2810	. 2 ⊢ (𝑋 ∈ 𝐸 → 𝑊 = (𝑒 ∈ 𝐸 ↦ (ran (2nd ‘𝑒) ∩ 𝑉)))
16		fveq2 6908	. . . . 5 ⊢ (𝑒 = 𝑋 → (2nd ‘𝑒) = (2nd ‘𝑋))
17	16	rneqd 5927	. . . 4 ⊢ (𝑒 = 𝑋 → ran (2nd ‘𝑒) = ran (2nd ‘𝑋))
18	17	ineq1d 4119	. . 3 ⊢ (𝑒 = 𝑋 → (ran (2nd ‘𝑒) ∩ 𝑉) = (ran (2nd ‘𝑋) ∩ 𝑉))
19	18	adantl 487	. 2 ⊢ ((𝑋 ∈ 𝐸 ∧ 𝑒 = 𝑋) → (ran (2nd ‘𝑒) ∩ 𝑉) = (ran (2nd ‘𝑋) ∩ 𝑉))
20		id 23	. 2 ⊢ (𝑋 ∈ 𝐸 → 𝑋 ∈ 𝐸)
21		fvex 6921	. . . . 5 ⊢ (2nd ‘𝑋) ∈ V
22	21	rnex 7946	. . . 4 ⊢ ran (2nd ‘𝑋) ∈ V
23	22	inex1 5281	. . 3 ⊢ (ran (2nd ‘𝑋) ∩ 𝑉) ∈ V
24	23	a1i 11	. 2 ⊢ (𝑋 ∈ 𝐸 → (ran (2nd ‘𝑋) ∩ 𝑉) ∈ V)
25	15, 19, 20, 24	fvmptd 7024	1 ⊢ (𝑋 ∈ 𝐸 → (𝑊‘𝑋) = (ran (2nd ‘𝑋) ∩ 𝑉))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∩ cin 4092   ↦ cmpt 5189  ran crn 5656  ‘cfv 6558  2^nd c2nd 8024  mVRcmvar 36393  mExcmex 36399  mVarscmvrs 36401

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7775

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-mvrs 36421

This theorem is used by:  mvrsfpw  36438  msubvrs  36492