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 32872
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 6658 . . . . . . . . 9 (mCN‘𝑇) ∈ V
2 mrsubvr.v . . . . . . . . . 10 𝑉 = (mVR‘𝑇)
32fvexi 6659 . . . . . . . . 9 𝑉 ∈ V
41, 3unex 7449 . . . . . . . 8 ((mCN‘𝑇) ∪ 𝑉) ∈ V
5 eqid 2798 . . . . . . . . 9 (freeMnd‘((mCN‘𝑇) ∪ 𝑉)) = (freeMnd‘((mCN‘𝑇) ∪ 𝑉))
65frmdmnd 18016 . . . . . . . 8 (((mCN‘𝑇) ∪ 𝑉) ∈ V → (freeMnd‘((mCN‘𝑇) ∪ 𝑉)) ∈ Mnd)
74, 6mp1i 13 . . . . . . 7 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → (freeMnd‘((mCN‘𝑇) ∪ 𝑉)) ∈ Mnd)
8 simpr 488 . . . . . . . . 9 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → 𝑒𝑅)
9 eqid 2798 . . . . . . . . . . 11 (mCN‘𝑇) = (mCN‘𝑇)
10 mrsubvr.r . . . . . . . . . . 11 𝑅 = (mREx‘𝑇)
119, 2, 10mrexval 32861 . . . . . . . . . 10 (𝑇𝑊𝑅 = Word ((mCN‘𝑇) ∪ 𝑉))
1211ad2antrr 725 . . . . . . . . 9 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → 𝑅 = Word ((mCN‘𝑇) ∪ 𝑉))
138, 12eleqtrd 2892 . . . . . . . 8 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → 𝑒 ∈ Word ((mCN‘𝑇) ∪ 𝑉))
14 elpmi 8408 . . . . . . . . . . . . . 14 (𝑓 ∈ (𝑅pm 𝑉) → (𝑓:dom 𝑓𝑅 ∧ dom 𝑓𝑉))
1514simpld 498 . . . . . . . . . . . . 13 (𝑓 ∈ (𝑅pm 𝑉) → 𝑓:dom 𝑓𝑅)
1615ad3antlr 730 . . . . . . . . . . . 12 ((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) → 𝑓:dom 𝑓𝑅)
1716ffvelrnda 6828 . . . . . . . . . . 11 (((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) ∧ 𝑣 ∈ dom 𝑓) → (𝑓𝑣) ∈ 𝑅)
1812ad2antrr 725 . . . . . . . . . . 11 (((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) ∧ 𝑣 ∈ dom 𝑓) → 𝑅 = Word ((mCN‘𝑇) ∪ 𝑉))
1917, 18eleqtrd 2892 . . . . . . . . . 10 (((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) ∧ 𝑣 ∈ dom 𝑓) → (𝑓𝑣) ∈ Word ((mCN‘𝑇) ∪ 𝑉))
20 simplr 768 . . . . . . . . . . 11 (((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) ∧ ¬ 𝑣 ∈ dom 𝑓) → 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉))
2120s1cld 13948 . . . . . . . . . 10 (((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) ∧ ¬ 𝑣 ∈ dom 𝑓) → ⟨“𝑣”⟩ ∈ Word ((mCN‘𝑇) ∪ 𝑉))
2219, 21ifclda 4459 . . . . . . . . 9 ((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) → if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩) ∈ Word ((mCN‘𝑇) ∪ 𝑉))
2322fmpttd 6856 . . . . . . . 8 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → (𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)):((mCN‘𝑇) ∪ 𝑉)⟶Word ((mCN‘𝑇) ∪ 𝑉))
24 wrdco 14184 . . . . . . . 8 ((𝑒 ∈ Word ((mCN‘𝑇) ∪ 𝑉) ∧ (𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)):((mCN‘𝑇) ∪ 𝑉)⟶Word ((mCN‘𝑇) ∪ 𝑉)) → ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒) ∈ Word Word ((mCN‘𝑇) ∪ 𝑉))
2513, 23, 24syl2anc 587 . . . . . . 7 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒) ∈ Word Word ((mCN‘𝑇) ∪ 𝑉))
26 eqid 2798 . . . . . . . . . . 11 (Base‘(freeMnd‘((mCN‘𝑇) ∪ 𝑉))) = (Base‘(freeMnd‘((mCN‘𝑇) ∪ 𝑉)))
275, 26frmdbas 18009 . . . . . . . . . 10 (((mCN‘𝑇) ∪ 𝑉) ∈ V → (Base‘(freeMnd‘((mCN‘𝑇) ∪ 𝑉))) = Word ((mCN‘𝑇) ∪ 𝑉))
284, 27ax-mp 5 . . . . . . . . 9 (Base‘(freeMnd‘((mCN‘𝑇) ∪ 𝑉))) = Word ((mCN‘𝑇) ∪ 𝑉)
2928eqcomi 2807 . . . . . . . 8 Word ((mCN‘𝑇) ∪ 𝑉) = (Base‘(freeMnd‘((mCN‘𝑇) ∪ 𝑉)))
3029gsumwcl 17995 . . . . . . 7 (((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) ∈ Mnd ∧ ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒) ∈ Word Word ((mCN‘𝑇) ∪ 𝑉)) → ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)) ∈ Word ((mCN‘𝑇) ∪ 𝑉))
317, 25, 30syl2anc 587 . . . . . 6 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)) ∈ Word ((mCN‘𝑇) ∪ 𝑉))
3231, 12eleqtrrd 2893 . . . . 5 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)) ∈ 𝑅)
3332fmpttd 6856 . . . 4 ((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) → (𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))):𝑅𝑅)
3410fvexi 6659 . . . . 5 𝑅 ∈ V
3534, 34elmap 8418 . . . 4 ((𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) ∈ (𝑅m 𝑅) ↔ (𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))):𝑅𝑅)
3633, 35sylibr 237 . . 3 ((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) → (𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) ∈ (𝑅m 𝑅))
3736fmpttd 6856 . 2 (𝑇𝑊 → (𝑓 ∈ (𝑅pm 𝑉) ↦ (𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))):(𝑅pm 𝑉)⟶(𝑅m 𝑅))
38 mrsubvr.s . . . 4 𝑆 = (mRSubst‘𝑇)
399, 2, 10, 38, 5mrsubffval 32867 . . 3 (𝑇𝑊𝑆 = (𝑓 ∈ (𝑅pm 𝑉) ↦ (𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
4039feq1d 6472 . 2 (𝑇𝑊 → (𝑆:(𝑅pm 𝑉)⟶(𝑅m 𝑅) ↔ (𝑓 ∈ (𝑅pm 𝑉) ↦ (𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))):(𝑅pm 𝑉)⟶(𝑅m 𝑅)))
4137, 40mpbird 260 1 (𝑇𝑊𝑆:(𝑅pm 𝑉)⟶(𝑅m 𝑅))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399   = wceq 1538  wcel 2111  Vcvv 3441  cun 3879  wss 3881  ifcif 4425  cmpt 5110  dom cdm 5519  ccom 5523  wf 6320  cfv 6324  (class class class)co 7135  m cmap 8389  pm cpm 8390  Word cword 13857  ⟨“cs1 13940  Basecbs 16475   Σg cgsu 16706  Mndcmnd 17903  freeMndcfrmd 18004  mCNcmcn 32820  mVRcmvar 32821  mRExcmrex 32826  mRSubstcmrsub 32830
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-oadd 8089  df-er 8272  df-map 8391  df-pm 8392  df-en 8493  df-dom 8494  df-sdom 8495  df-fin 8496  df-card 9352  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-nn 11626  df-2 11688  df-n0 11886  df-z 11970  df-uz 12232  df-fz 12886  df-fzo 13029  df-seq 13365  df-hash 13687  df-word 13858  df-concat 13914  df-s1 13941  df-struct 16477  df-ndx 16478  df-slot 16479  df-base 16481  df-sets 16482  df-ress 16483  df-plusg 16570  df-0g 16707  df-gsum 16708  df-mgm 17844  df-sgrp 17893  df-mnd 17904  df-submnd 17949  df-frmd 18006  df-mrex 32846  df-mrsub 32850
This theorem is referenced by:  mrsubrn  32873  mrsubff1  32874  mrsub0  32876  mrsubf  32877  mrsubccat  32878  mrsubcn  32879  elmrsubrn  32880  elmsubrn  32888  msubrn  32889  msubff  32890  msubff1  32916
  Copyright terms: Public domain W3C validator