Theorem msubff 36109

Description: A substitution is a function from 𝐸 to 𝐸. (Contributed by Mario Carneiro, 18-Jul-2016.)

Hypotheses

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

Assertion

Ref	Expression
msubff	⊢ (𝑇 ∈ 𝑊 → 𝑆:(𝑅 ↑pm 𝑉)⟶(𝐸 ↑m 𝐸))

Proof of Theorem msubff

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

Step	Hyp	Ref	Expression
1		xp1st 8018	. . . . . . . . 9 ⊢ (𝑒 ∈ ((mTC‘𝑇) × 𝑅) → (1st ‘𝑒) ∈ (mTC‘𝑇))
2		eqid 2760	. . . . . . . . . 10 ⊢ (mTC‘𝑇) = (mTC‘𝑇)
3		msubff.e	. . . . . . . . . 10 ⊢ 𝐸 = (mEx‘𝑇)
4		msubff.r	. . . . . . . . . 10 ⊢ 𝑅 = (mREx‘𝑇)
5	2, 3, 4	mexval 36081	. . . . . . . . 9 ⊢ 𝐸 = ((mTC‘𝑇) × 𝑅)
6	1, 5	eleq2s 2878	. . . . . . . 8 ⊢ (𝑒 ∈ 𝐸 → (1st ‘𝑒) ∈ (mTC‘𝑇))
7	6	adantl 487	. . . . . . 7 ⊢ (((𝑇 ∈ 𝑊 ∧ 𝑓 ∈ (𝑅 ↑pm 𝑉)) ∧ 𝑒 ∈ 𝐸) → (1st ‘𝑒) ∈ (mTC‘𝑇))
8		msubff.v	. . . . . . . . . . 11 ⊢ 𝑉 = (mVR‘𝑇)
9		eqid 2760	. . . . . . . . . . 11 ⊢ (mRSubst‘𝑇) = (mRSubst‘𝑇)
10	8, 4, 9	mrsubff 36091	. . . . . . . . . 10 ⊢ (𝑇 ∈ 𝑊 → (mRSubst‘𝑇):(𝑅 ↑pm 𝑉)⟶(𝑅 ↑m 𝑅))
11	10	ffvelcdmda 7077	. . . . . . . . 9 ⊢ ((𝑇 ∈ 𝑊 ∧ 𝑓 ∈ (𝑅 ↑pm 𝑉)) → ((mRSubst‘𝑇)‘𝑓) ∈ (𝑅 ↑m 𝑅))
12		elmapi 8848	. . . . . . . . 9 ⊢ (((mRSubst‘𝑇)‘𝑓) ∈ (𝑅 ↑m 𝑅) → ((mRSubst‘𝑇)‘𝑓):𝑅⟶𝑅)
13	11, 12	syl 18	. . . . . . . 8 ⊢ ((𝑇 ∈ 𝑊 ∧ 𝑓 ∈ (𝑅 ↑pm 𝑉)) → ((mRSubst‘𝑇)‘𝑓):𝑅⟶𝑅)
14		xp2nd 8019	. . . . . . . . 9 ⊢ (𝑒 ∈ ((mTC‘𝑇) × 𝑅) → (2nd ‘𝑒) ∈ 𝑅)
15	14, 5	eleq2s 2878	. . . . . . . 8 ⊢ (𝑒 ∈ 𝐸 → (2nd ‘𝑒) ∈ 𝑅)
16		ffvelcdm 7074	. . . . . . . 8 ⊢ ((((mRSubst‘𝑇)‘𝑓):𝑅⟶𝑅 ∧ (2nd ‘𝑒) ∈ 𝑅) → (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒)) ∈ 𝑅)
17	13, 15, 16	syl2an 608	. . . . . . 7 ⊢ (((𝑇 ∈ 𝑊 ∧ 𝑓 ∈ (𝑅 ↑pm 𝑉)) ∧ 𝑒 ∈ 𝐸) → (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒)) ∈ 𝑅)
18		opelxp 5691	. . . . . . 7 ⊢ (⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩ ∈ ((mTC‘𝑇) × 𝑅) ↔ ((1st ‘𝑒) ∈ (mTC‘𝑇) ∧ (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒)) ∈ 𝑅))
19	7, 17, 18	sylanbrc 595	. . . . . 6 ⊢ (((𝑇 ∈ 𝑊 ∧ 𝑓 ∈ (𝑅 ↑pm 𝑉)) ∧ 𝑒 ∈ 𝐸) → ⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩ ∈ ((mTC‘𝑇) × 𝑅))
20	19, 5	eleqtrrdi 2871	. . . . 5 ⊢ (((𝑇 ∈ 𝑊 ∧ 𝑓 ∈ (𝑅 ↑pm 𝑉)) ∧ 𝑒 ∈ 𝐸) → ⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩ ∈ 𝐸)
21	20	fmpttd 7108	. . . 4 ⊢ ((𝑇 ∈ 𝑊 ∧ 𝑓 ∈ (𝑅 ↑pm 𝑉)) → (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩):𝐸⟶𝐸)
22	3	fvexi 6892	. . . . 5 ⊢ 𝐸 ∈ V
23	22, 22	elmap 8878	. . . 4 ⊢ ((𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩) ∈ (𝐸 ↑m 𝐸) ↔ (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩):𝐸⟶𝐸)
24	21, 23	sylibr 237	. . 3 ⊢ ((𝑇 ∈ 𝑊 ∧ 𝑓 ∈ (𝑅 ↑pm 𝑉)) → (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩) ∈ (𝐸 ↑m 𝐸))
25	24	fmpttd 7108	. 2 ⊢ (𝑇 ∈ 𝑊 → (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩)):(𝑅 ↑pm 𝑉)⟶(𝐸 ↑m 𝐸))
26		msubff.s	. . . 4 ⊢ 𝑆 = (mSubst‘𝑇)
27	8, 4, 26, 3, 9	msubffval 36102	. . 3 ⊢ (𝑇 ∈ 𝑊 → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩)))
28	27	feq1d 6684	. 2 ⊢ (𝑇 ∈ 𝑊 → (𝑆:(𝑅 ↑pm 𝑉)⟶(𝐸 ↑m 𝐸) ↔ (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩)):(𝑅 ↑pm 𝑉)⟶(𝐸 ↑m 𝐸)))
29	25, 28	mpbird 260	1 ⊢ (𝑇 ∈ 𝑊 → 𝑆:(𝑅 ↑pm 𝑉)⟶(𝐸 ↑m 𝐸))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ⟨cop 4590   ↦ cmpt 5186   × cxp 5653  ⟶wf 6529  ‘cfv 6533  (class class class)co 7413  1^st c1st 7984  2^nd c2nd 7985   ↑_m cmap 8826   ↑_pm cpm 8827  mVRcmvar 36040  mTCcmtc 36043  mRExcmrex 36045  mExcmex 36046  mRSubstcmrsub 36049  mSubstcmsub 36050

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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736  ax-cnex 11180  ax-resscn 11181  ax-1cn 11182  ax-icn 11183  ax-addcl 11184  ax-addrcl 11185  ax-mulcl 11186  ax-mulrcl 11187  ax-mulcom 11188  ax-addass 11189  ax-mulass 11190  ax-distr 11191  ax-i2m1 11192  ax-1ne0 11193  ax-1rid 11194  ax-rnegex 11195  ax-rrecex 11196  ax-cnre 11197  ax-pre-lttri 11198  ax-pre-lttrn 11199  ax-pre-ltadd 11200  ax-pre-mulgt0 11201

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  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-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-1o 8455  df-er 8696  df-map 8828  df-pm 8829  df-en 8953  df-dom 8954  df-sdom 8955  df-fin 8956  df-card 9944  df-pnf 11269  df-mnf 11270  df-xr 11271  df-ltxr 11272  df-le 11273  df-sub 11467  df-neg 11468  df-nn 12258  df-2 12327  df-n0 12529  df-z 12616  df-uz 12888  df-fz 13562  df-fzo 13710  df-seq 14066  df-hash 14395  df-word 14579  df-concat 14636  df-s1 14663  df-struct 17239  df-sets 17256  df-slot 17274  df-ndx 17286  df-base 17302  df-ress 17323  df-plusg 17355  df-0g 17526  df-gsum 17527  df-mgm 18730  df-sgrp 18821  df-mnd 18837  df-submnd 18892  df-frmd 18958  df-mrex 36065  df-mex 36066  df-mrsub 36069  df-msub 36070

This theorem is used by:  msubf  36111  msubff1  36135  mclsind  36149