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 35706
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 6847 . . . . . . . . 9 (mCN‘𝑇) ∈ V
2 mrsubvr.v . . . . . . . . . 10 𝑉 = (mVR‘𝑇)
32fvexi 6848 . . . . . . . . 9 𝑉 ∈ V
41, 3unex 7689 . . . . . . . 8 ((mCN‘𝑇) ∪ 𝑉) ∈ V
5 eqid 2736 . . . . . . . . 9 (freeMnd‘((mCN‘𝑇) ∪ 𝑉)) = (freeMnd‘((mCN‘𝑇) ∪ 𝑉))
65frmdmnd 18784 . . . . . . . 8 (((mCN‘𝑇) ∪ 𝑉) ∈ V → (freeMnd‘((mCN‘𝑇) ∪ 𝑉)) ∈ Mnd)
74, 6mp1i 13 . . . . . . 7 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → (freeMnd‘((mCN‘𝑇) ∪ 𝑉)) ∈ Mnd)
8 simpr 484 . . . . . . . . 9 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → 𝑒𝑅)
9 eqid 2736 . . . . . . . . . . 11 (mCN‘𝑇) = (mCN‘𝑇)
10 mrsubvr.r . . . . . . . . . . 11 𝑅 = (mREx‘𝑇)
119, 2, 10mrexval 35695 . . . . . . . . . 10 (𝑇𝑊𝑅 = Word ((mCN‘𝑇) ∪ 𝑉))
1211ad2antrr 726 . . . . . . . . 9 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → 𝑅 = Word ((mCN‘𝑇) ∪ 𝑉))
138, 12eleqtrd 2838 . . . . . . . 8 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → 𝑒 ∈ Word ((mCN‘𝑇) ∪ 𝑉))
14 elpmi 8783 . . . . . . . . . . . . . 14 (𝑓 ∈ (𝑅pm 𝑉) → (𝑓:dom 𝑓𝑅 ∧ dom 𝑓𝑉))
1514simpld 494 . . . . . . . . . . . . 13 (𝑓 ∈ (𝑅pm 𝑉) → 𝑓:dom 𝑓𝑅)
1615ad3antlr 731 . . . . . . . . . . . 12 ((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) → 𝑓:dom 𝑓𝑅)
1716ffvelcdmda 7029 . . . . . . . . . . 11 (((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) ∧ 𝑣 ∈ dom 𝑓) → (𝑓𝑣) ∈ 𝑅)
1812ad2antrr 726 . . . . . . . . . . 11 (((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) ∧ 𝑣 ∈ dom 𝑓) → 𝑅 = Word ((mCN‘𝑇) ∪ 𝑉))
1917, 18eleqtrd 2838 . . . . . . . . . 10 (((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) ∧ 𝑣 ∈ dom 𝑓) → (𝑓𝑣) ∈ Word ((mCN‘𝑇) ∪ 𝑉))
20 simplr 768 . . . . . . . . . . 11 (((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) ∧ ¬ 𝑣 ∈ dom 𝑓) → 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉))
2120s1cld 14527 . . . . . . . . . 10 (((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) ∧ ¬ 𝑣 ∈ dom 𝑓) → ⟨“𝑣”⟩ ∈ Word ((mCN‘𝑇) ∪ 𝑉))
2219, 21ifclda 4515 . . . . . . . . 9 ((((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉)) → if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩) ∈ Word ((mCN‘𝑇) ∪ 𝑉))
2322fmpttd 7060 . . . . . . . 8 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → (𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)):((mCN‘𝑇) ∪ 𝑉)⟶Word ((mCN‘𝑇) ∪ 𝑉))
24 wrdco 14754 . . . . . . . 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 2736 . . . . . . . . . . 11 (Base‘(freeMnd‘((mCN‘𝑇) ∪ 𝑉))) = (Base‘(freeMnd‘((mCN‘𝑇) ∪ 𝑉)))
275, 26frmdbas 18777 . . . . . . . . . 10 (((mCN‘𝑇) ∪ 𝑉) ∈ V → (Base‘(freeMnd‘((mCN‘𝑇) ∪ 𝑉))) = Word ((mCN‘𝑇) ∪ 𝑉))
284, 27ax-mp 5 . . . . . . . . 9 (Base‘(freeMnd‘((mCN‘𝑇) ∪ 𝑉))) = Word ((mCN‘𝑇) ∪ 𝑉)
2928eqcomi 2745 . . . . . . . 8 Word ((mCN‘𝑇) ∪ 𝑉) = (Base‘(freeMnd‘((mCN‘𝑇) ∪ 𝑉)))
3029gsumwcl 18764 . . . . . . 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 2839 . . . . 5 (((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) ∧ 𝑒𝑅) → ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)) ∈ 𝑅)
3332fmpttd 7060 . . . 4 ((𝑇𝑊𝑓 ∈ (𝑅pm 𝑉)) → (𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))):𝑅𝑅)
3410fvexi 6848 . . . . 5 𝑅 ∈ V
3534, 34elmap 8809 . . . 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 7060 . 2 (𝑇𝑊 → (𝑓 ∈ (𝑅pm 𝑉) ↦ (𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))):(𝑅pm 𝑉)⟶(𝑅m 𝑅))
38 mrsubvr.s . . . 4 𝑆 = (mRSubst‘𝑇)
399, 2, 10, 38, 5mrsubffval 35701 . . 3 (𝑇𝑊𝑆 = (𝑓 ∈ (𝑅pm 𝑉) ↦ (𝑒𝑅 ↦ ((freeMnd‘((mCN‘𝑇) ∪ 𝑉)) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
4039feq1d 6644 . 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 3440  cun 3899  wss 3901  ifcif 4479  cmpt 5179  dom cdm 5624  ccom 5628  wf 6488  cfv 6492  (class class class)co 7358  m cmap 8763  pm cpm 8764  Word cword 14436  ⟨“cs1 14519  Basecbs 17136   Σg cgsu 17360  Mndcmnd 18659  freeMndcfrmd 18772  mCNcmcn 35654  mVRcmvar 35655  mRExcmrex 35660  mRSubstcmrsub 35664
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 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-cnex 11082  ax-resscn 11083  ax-1cn 11084  ax-icn 11085  ax-addcl 11086  ax-addrcl 11087  ax-mulcl 11088  ax-mulrcl 11089  ax-mulcom 11090  ax-addass 11091  ax-mulass 11092  ax-distr 11093  ax-i2m1 11094  ax-1ne0 11095  ax-1rid 11096  ax-rnegex 11097  ax-rrecex 11098  ax-cnre 11099  ax-pre-lttri 11100  ax-pre-lttrn 11101  ax-pre-ltadd 11102  ax-pre-mulgt0 11103
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-1o 8397  df-er 8635  df-map 8765  df-pm 8766  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-card 9851  df-pnf 11168  df-mnf 11169  df-xr 11170  df-ltxr 11171  df-le 11172  df-sub 11366  df-neg 11367  df-nn 12146  df-2 12208  df-n0 12402  df-z 12489  df-uz 12752  df-fz 13424  df-fzo 13571  df-seq 13925  df-hash 14254  df-word 14437  df-concat 14494  df-s1 14520  df-struct 17074  df-sets 17091  df-slot 17109  df-ndx 17121  df-base 17137  df-ress 17158  df-plusg 17190  df-0g 17361  df-gsum 17362  df-mgm 18565  df-sgrp 18644  df-mnd 18660  df-submnd 18709  df-frmd 18774  df-mrex 35680  df-mrsub 35684
This theorem is referenced by:  mrsubrn  35707  mrsubff1  35708  mrsub0  35710  mrsubf  35711  mrsubccat  35712  mrsubcn  35713  elmrsubrn  35714  elmsubrn  35722  msubrn  35723  msubff  35724  msubff1  35750
  Copyright terms: Public domain W3C validator