Theorem msubval 36112

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
msubval	⊢ ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) → ((𝑆‘𝐹)‘𝑋) = ⟨(1st ‘𝑋), ((𝑂‘𝐹)‘(2nd ‘𝑋))⟩)

Proof of Theorem msubval

Dummy variable 𝑒 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		msubffval.v	. . . 4 ⊢ 𝑉 = (mVR‘𝑇)
2		msubffval.r	. . . 4 ⊢ 𝑅 = (mREx‘𝑇)
3		msubffval.s	. . . 4 ⊢ 𝑆 = (mSubst‘𝑇)
4		msubffval.e	. . . 4 ⊢ 𝐸 = (mEx‘𝑇)
5		msubffval.o	. . . 4 ⊢ 𝑂 = (mRSubst‘𝑇)
6	1, 2, 3, 4, 5	msubfval 36111	. . 3 ⊢ ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉) → (𝑆‘𝐹) = (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), ((𝑂‘𝐹)‘(2nd ‘𝑒))⟩))
7	6	3adant3 1150	. 2 ⊢ ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) → (𝑆‘𝐹) = (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), ((𝑂‘𝐹)‘(2nd ‘𝑒))⟩))
8		simpr 490	. . . 4 ⊢ (((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) ∧ 𝑒 = 𝑋) → 𝑒 = 𝑋)
9	8	fveq2d 6886	. . 3 ⊢ (((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) ∧ 𝑒 = 𝑋) → (1st ‘𝑒) = (1st ‘𝑋))
10	8	fveq2d 6886	. . . 4 ⊢ (((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) ∧ 𝑒 = 𝑋) → (2nd ‘𝑒) = (2nd ‘𝑋))
11	10	fveq2d 6886	. . 3 ⊢ (((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) ∧ 𝑒 = 𝑋) → ((𝑂‘𝐹)‘(2nd ‘𝑒)) = ((𝑂‘𝐹)‘(2nd ‘𝑋)))
12	9, 11	opeq12d 4844	. 2 ⊢ (((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) ∧ 𝑒 = 𝑋) → ⟨(1st ‘𝑒), ((𝑂‘𝐹)‘(2nd ‘𝑒))⟩ = ⟨(1st ‘𝑋), ((𝑂‘𝐹)‘(2nd ‘𝑋))⟩)
13		simp3 1156	. 2 ⊢ ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) → 𝑋 ∈ 𝐸)
14		opex 5443	. . 3 ⊢ ⟨(1st ‘𝑋), ((𝑂‘𝐹)‘(2nd ‘𝑋))⟩ ∈ V
15	14	a1i 11	. 2 ⊢ ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) → ⟨(1st ‘𝑋), ((𝑂‘𝐹)‘(2nd ‘𝑋))⟩ ∈ V)
16	7, 12, 13, 15	fvmptd 6998	1 ⊢ ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) → ((𝑆‘𝐹)‘𝑋) = ⟨(1st ‘𝑋), ((𝑂‘𝐹)‘(2nd ‘𝑋))⟩)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  Vcvv 3453   ⊆ wss 3902  ⟨cop 4593   ↦ cmpt 5190  ⟶wf 6533  ‘cfv 6537  1^st c1st 7988  2^nd c2nd 7989  mVRcmvar 36048  mRExcmrex 36053  mExcmex 36054  mRSubstcmrsub 36057  mSubstcmsub 36058

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  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-ov 7420  df-oprab 7421  df-mpo 7422  df-pm 8833  df-msub 36078

This theorem is used by:  msubrsub  36113  msubty  36114  msubff1  36143