Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mrsubff Structured version   Visualization version   GIF version

Theorem mrsubff 35628
Description: A substitution is a function from 𝑅 to 𝑅. (Contributed by Mario Carneiro, 18-Jul-2016.)
Hypotheses
Ref Expression
mrsubvr.v 𝑉 = (mVR‘𝑇)
mrsubvr.r 𝑅 = (mREx‘𝑇)
mrsubvr.s 𝑆 = (mRSubst‘𝑇)
Assertion
Ref Expression
mrsubff (𝑇𝑊𝑆:(𝑅pm 𝑉)⟶(𝑅m 𝑅))

Proof of Theorem mrsubff
Dummy variables 𝑒 𝑓 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fvex 6844 . . . . . . . . 9 (mCN‘𝑇) ∈ V
2 mrsubvr.v . . . . . . . . . 10 𝑉 = (mVR‘𝑇)
32fvexi 6845 . . . . . . . . 9 𝑉 ∈ V
41, 3unex 7686 . . . . . . . 8 ((mCN‘𝑇) ∪ 𝑉) ∈ V
5 eqid 2733 . . . . . . . . 9 (freeMnd‘((mCN‘𝑇) ∪ 𝑉)) = (freeMnd‘((mCN‘𝑇) ∪ 𝑉))
65frmdmnd 18775 . . . . . . . 8 (((mCN‘𝑇) ∪ 𝑉) ∈ V → (freeMnd‘((mCN‘𝑇) ∪ 𝑉)) ∈ Mnd)
74, 6mp1i 13 . . . . . . 7 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → (freeMnd‘((mCN‘𝑇) ∪ 𝑉)) ∈ Mnd)
8 simpr 484 . . . . . . . . 9 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → 𝑒𝑅)
9 eqid 2733 . . . . . . . . . . 11 (mCN‘𝑇) = (mCN‘𝑇)
10 mrsubvr.r . . . . . . . . . . 11 𝑅 = (mREx‘𝑇)
119, 2, 10mrexval 35617 . . . . . . . . . 10 (𝑇𝑊𝑅 = Word ((mCN‘𝑇) ∪ 𝑉))
1211ad2antrr 726 . . . . . . . . 9 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → 𝑅 = Word ((mCN‘𝑇) ∪ 𝑉))
138, 12eleqtrd 2835 . . . . . . . 8 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → 𝑒 ∈ Word ((mCN‘𝑇) ∪ 𝑉))
14 elpmi 8779 . . . . . . . . . . . . . 14 (𝑓 ∈ (𝑅pm 𝑉) → (𝑓:dom 𝑓𝑅 ∧ dom 𝑓𝑉))
1514simpld 494 . . . . . . . . . . . . 13 (𝑓 ∈ (𝑅pm 𝑉) → 𝑓:dom 𝑓𝑅)
1615ad3antlr 731 . . . . . . . . . . . 12 ((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) → 𝑓:dom 𝑓𝑅)
1716ffvelcdmda 7026 . . . . . . . . . . 11 (((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) ∧ 𝑣 ∈ dom 𝑓) → (𝑓𝑣) ∈ 𝑅)
1812ad2antrr 726 . . . . . . . . . . 11 (((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) ∧ 𝑣 ∈ dom 𝑓) → 𝑅 = Word ((mCN‘𝑇) ∪ 𝑉))
1917, 18eleqtrd 2835 . . . . . . . . . 10 (((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) ∧ 𝑣 ∈ dom 𝑓) → (𝑓𝑣) ∈ Word ((mCN‘𝑇) ∪ 𝑉))
20 simplr 768 . . . . . . . . . . 11 (((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) ∧ ¬ 𝑣 ∈ dom 𝑓) → 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉))
2120s1cld 14518 . . . . . . . . . 10 (((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) ∧ ¬ 𝑣 ∈ dom 𝑓) → ⟨“𝑣”⟩ ∈ Word ((mCN‘𝑇) ∪ 𝑉))
2219, 21ifclda 4512 . . . . . . . . 9 ((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) → if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩) ∈ Word ((mCN‘𝑇) ∪ 𝑉))
2322fmpttd 7057 . . . . . . . 8 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → (𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)):((mCN‘𝑇) ∪ 𝑉)⟶Word ((mCN‘𝑇) ∪ 𝑉))
24 wrdco 14745 . . . . . . . 8 ((𝑒 ∈ Word ((mCN‘𝑇) ∪ 𝑉) ∧ (𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)):((mCN‘𝑇) ∪ 𝑉)⟶Word ((mCN‘𝑇) ∪ 𝑉)) → ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒) ∈ Word Word ((mCN‘𝑇) ∪ 𝑉))
2513, 23, 24syl2anc 584 . . . . . . 7 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒) ∈ Word Word ((mCN‘𝑇) ∪ 𝑉))
26 eqid 2733 . . . . . . . . . . 11 (Base‘(freeMnd‘((mCN‘𝑇) ∪ 𝑉))) = (Base‘(freeMnd‘((mCN‘𝑇) ∪ 𝑉)))
275, 26frmdbas 18768 . . . . . . . . . 10 (((mCN‘𝑇) ∪ 𝑉) ∈ V → (Base‘(freeMnd‘((mCN‘𝑇) ∪ 𝑉))) = Word ((mCN‘𝑇) ∪ 𝑉))
284, 27ax-mp 5 . . . . . . . . 9 (Base‘(freeMnd‘((mCN‘𝑇) ∪ 𝑉))) = Word ((mCN‘𝑇) ∪ 𝑉)
2928eqcomi 2742 . . . . . . . 8 Word ((mCN‘𝑇) ∪ 𝑉) = (Base‘(freeMnd‘((mCN‘𝑇) ∪ 𝑉)))
3029gsumwcl 18755 . . . . . . 7 (((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) ∈ Mnd ∧ ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒) ∈ Word Word ((mCN‘𝑇) ∪ 𝑉)) → ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)) ∈ Word ((mCN‘𝑇) ∪ 𝑉))
317, 25, 30syl2anc 584 . . . . . 6 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)) ∈ Word ((mCN‘𝑇) ∪ 𝑉))
3231, 12eleqtrrd 2836 . . . . 5 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)) ∈ 𝑅)
3332fmpttd 7057 . . . 4 ((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) → (𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))):𝑅𝑅)
3410fvexi 6845 . . . . 5 𝑅 ∈ V
3534, 34elmap 8805 . . . 4 ((𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) ∈ (𝑅m 𝑅) ↔ (𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))):𝑅𝑅)
3633, 35sylibr 234 . . 3 ((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) → (𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) ∈ (𝑅m 𝑅))
3736fmpttd 7057 . 2 (𝑇𝑊 → (𝑓 ∈ (𝑅pm 𝑉) ↦ (𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))):(𝑅pm 𝑉)⟶(𝑅m 𝑅))
38 mrsubvr.s . . . 4 𝑆 = (mRSubst‘𝑇)
399, 2, 10, 38, 5mrsubffval 35623 . . 3 (𝑇𝑊𝑆 = (𝑓 ∈ (𝑅pm 𝑉) ↦ (𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
4039feq1d 6641 . 2 (𝑇𝑊 → (𝑆:(𝑅pm 𝑉)⟶(𝑅m 𝑅) ↔ (𝑓 ∈ (𝑅pm 𝑉) ↦ (𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))):(𝑅pm 𝑉)⟶(𝑅m 𝑅)))
4137, 40mpbird 257 1 (𝑇𝑊𝑆:(𝑅pm 𝑉)⟶(𝑅m 𝑅))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1541  wcel 2113  Vcvv 3437  cun 3896  wss 3898  ifcif 4476  cmpt 5176  dom cdm 5621  ccom 5625  wf 6485  cfv 6489  (class class class)co 7355  m cmap 8759  pm cpm 8760  Word cword 14427  ⟨“cs1 14510  Basecbs 17127   Σg cgsu 17351  Mndcmnd 18650  freeMndcfrmd 18763  mCNcmcn 35576  mVRcmvar 35577  mRExcmrex 35582  mRSubstcmrsub 35586
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677  ax-cnex 11073  ax-resscn 11074  ax-1cn 11075  ax-icn 11076  ax-addcl 11077  ax-addrcl 11078  ax-mulcl 11079  ax-mulrcl 11080  ax-mulcom 11081  ax-addass 11082  ax-mulass 11083  ax-distr 11084  ax-i2m1 11085  ax-1ne0 11086  ax-1rid 11087  ax-rnegex 11088  ax-rrecex 11089  ax-cnre 11090  ax-pre-lttri 11091  ax-pre-lttrn 11092  ax-pre-ltadd 11093  ax-pre-mulgt0 11094
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-int 4900  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-riota 7312  df-ov 7358  df-oprab 7359  df-mpo 7360  df-om 7806  df-1st 7930  df-2nd 7931  df-frecs 8220  df-wrecs 8251  df-recs 8300  df-rdg 8338  df-1o 8394  df-er 8631  df-map 8761  df-pm 8762  df-en 8880  df-dom 8881  df-sdom 8882  df-fin 8883  df-card 9843  df-pnf 11159  df-mnf 11160  df-xr 11161  df-ltxr 11162  df-le 11163  df-sub 11357  df-neg 11358  df-nn 12137  df-2 12199  df-n0 12393  df-z 12480  df-uz 12743  df-fz 13415  df-fzo 13562  df-seq 13916  df-hash 14245  df-word 14428  df-concat 14485  df-s1 14511  df-struct 17065  df-sets 17082  df-slot 17100  df-ndx 17112  df-base 17128  df-ress 17149  df-plusg 17181  df-0g 17352  df-gsum 17353  df-mgm 18556  df-sgrp 18635  df-mnd 18651  df-submnd 18700  df-frmd 18765  df-mrex 35602  df-mrsub 35606
This theorem is referenced by:  mrsubrn  35629  mrsubff1  35630  mrsub0  35632  mrsubf  35633  mrsubccat  35634  mrsubcn  35635  elmrsubrn  35636  elmsubrn  35644  msubrn  35645  msubff  35646  msubff1  35672
  Copyright terms: Public domain W3C validator