Theorem msubff 36274

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 8031	. . . . . . . . 9 ⊢ (𝑒 ∈ ((mTC‘𝑇) × 𝑅) → (1st ‘𝑒) ∈ (mTC‘𝑇))
2		eqid 2761	. . . . . . . . . 10 ⊢ (mTC‘𝑇) = (mTC‘𝑇)
3		msubff.e	. . . . . . . . . 10 ⊢ 𝐸 = (mEx‘𝑇)
4		msubff.r	. . . . . . . . . 10 ⊢ 𝑅 = (mREx‘𝑇)
5	2, 3, 4	mexval 36246	. . . . . . . . 9 ⊢ 𝐸 = ((mTC‘𝑇) × 𝑅)
6	1, 5	eleq2s 2879	. . . . . . . 8 ⊢ (𝑒 ∈ 𝐸 → (1st ‘𝑒) ∈ (mTC‘𝑇))
7	6	adantl 487	. . . . . . 7 ⊢ (((𝑇 ∈ 𝑊 ∧ 𝑓 ∈ (𝑅 ↑pm 𝑉)) ∧ 𝑒 ∈ 𝐸) → (1st ‘𝑒) ∈ (mTC‘𝑇))
8		msubff.v	. . . . . . . . . . 11 ⊢ 𝑉 = (mVR‘𝑇)
9		eqid 2761	. . . . . . . . . . 11 ⊢ (mRSubst‘𝑇) = (mRSubst‘𝑇)
10	8, 4, 9	mrsubff 36256	. . . . . . . . . 10 ⊢ (𝑇 ∈ 𝑊 → (mRSubst‘𝑇):(𝑅 ↑pm 𝑉)⟶(𝑅 ↑m 𝑅))
11	10	ffvelcdmda 7082	. . . . . . . . 9 ⊢ ((𝑇 ∈ 𝑊 ∧ 𝑓 ∈ (𝑅 ↑pm 𝑉)) → ((mRSubst‘𝑇)‘𝑓) ∈ (𝑅 ↑m 𝑅))
12		elmapi 8862	. . . . . . . . 9 ⊢ (((mRSubst‘𝑇)‘𝑓) ∈ (𝑅 ↑m 𝑅) → ((mRSubst‘𝑇)‘𝑓):𝑅⟶𝑅)
13	11, 12	syl 18	. . . . . . . 8 ⊢ ((𝑇 ∈ 𝑊 ∧ 𝑓 ∈ (𝑅 ↑pm 𝑉)) → ((mRSubst‘𝑇)‘𝑓):𝑅⟶𝑅)
14		xp2nd 8032	. . . . . . . . 9 ⊢ (𝑒 ∈ ((mTC‘𝑇) × 𝑅) → (2nd ‘𝑒) ∈ 𝑅)
15	14, 5	eleq2s 2879	. . . . . . . 8 ⊢ (𝑒 ∈ 𝐸 → (2nd ‘𝑒) ∈ 𝑅)
16		ffvelcdm 7079	. . . . . . . 8 ⊢ ((((mRSubst‘𝑇)‘𝑓):𝑅⟶𝑅 ∧ (2nd ‘𝑒) ∈ 𝑅) → (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒)) ∈ 𝑅)
17	13, 15, 16	syl2an 608	. . . . . . 7 ⊢ (((𝑇 ∈ 𝑊 ∧ 𝑓 ∈ (𝑅 ↑pm 𝑉)) ∧ 𝑒 ∈ 𝐸) → (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒)) ∈ 𝑅)
18		opelxp 5687	. . . . . . 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 2872	. . . . 5 ⊢ (((𝑇 ∈ 𝑊 ∧ 𝑓 ∈ (𝑅 ↑pm 𝑉)) ∧ 𝑒 ∈ 𝐸) → ⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩ ∈ 𝐸)
21	20	fmpttd 7113	. . . 4 ⊢ ((𝑇 ∈ 𝑊 ∧ 𝑓 ∈ (𝑅 ↑pm 𝑉)) → (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩):𝐸⟶𝐸)
22	3	fvexi 6897	. . . . 5 ⊢ 𝐸 ∈ V
23	22, 22	elmap 8892	. . . 4 ⊢ ((𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩) ∈ (𝐸 ↑m 𝐸) ↔ (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩):𝐸⟶𝐸)
24	21, 23	sylibr 237	. . 3 ⊢ ((𝑇 ∈ 𝑊 ∧ 𝑓 ∈ (𝑅 ↑pm 𝑉)) → (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩) ∈ (𝐸 ↑m 𝐸))
25	24	fmpttd 7113	. 2 ⊢ (𝑇 ∈ 𝑊 → (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩)):(𝑅 ↑pm 𝑉)⟶(𝐸 ↑m 𝐸))
26		msubff.s	. . . 4 ⊢ 𝑆 = (mSubst‘𝑇)
27	8, 4, 26, 3, 9	msubffval 36267	. . 3 ⊢ (𝑇 ∈ 𝑊 → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝐸 ↦ ⟨(1st ‘𝑒), (((mRSubst‘𝑇)‘𝑓)‘(2nd ‘𝑒))⟩)))
28	27	feq1d 6689	. 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 5649  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418  1^st c1st 7997  2^nd c2nd 7998   ↑_m cmap 8840   ↑_pm cpm 8841  mVRcmvar 36205  mTCcmtc 36208  mRExcmrex 36210  mExcmex 36211  mRSubstcmrsub 36214  mSubstcmsub 36215

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-pow 5327  ax-pr 5391  ax-un 7749  ax-cnex 11249  ax-resscn 11250  ax-1cn 11251  ax-icn 11252  ax-addcl 11253  ax-addrcl 11254  ax-mulcl 11255  ax-mulrcl 11256  ax-mulcom 11257  ax-addass 11258  ax-mulass 11259  ax-distr 11260  ax-i2m1 11261  ax-1ne0 11262  ax-1rid 11263  ax-rnegex 11264  ax-rrecex 11265  ax-cnre 11266  ax-pre-lttri 11267  ax-pre-lttrn 11268  ax-pre-ltadd 11269  ax-pre-mulgt0 11270

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  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-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 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  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-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  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-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-1o 8469  df-er 8710  df-map 8842  df-pm 8843  df-en 8967  df-dom 8968  df-sdom 8969  df-fin 8970  df-card 10013  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-sub 11536  df-neg 11537  df-nn 12329  df-2 12398  df-n0 12600  df-z 12687  df-uz 12959  df-fz 13633  df-fzo 13782  df-seq 14138  df-hash 14468  df-word 14652  df-concat 14709  df-s1 14736  df-struct 17318  df-sets 17335  df-slot 17353  df-ndx 17365  df-base 17381  df-ress 17402  df-plusg 17434  df-0g 17605  df-gsum 17606  df-mgm 18809  df-sgrp 18901  df-mnd 18917  df-submnd 18972  df-frmd 19038  df-mrex 36230  df-mex 36231  df-mrsub 36234  df-msub 36235

This theorem is used by:  msubf  36276  msubff1  36300  mclsind  36314