MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  efgtval Structured version   Visualization version   GIF version

Theorem efgtval 19816
Description: Value of the extension function, which maps a word (a representation of the group element as a sequence of elements and their inverses) to its direct extensions, defined as the original representation with an element and its inverse inserted somewhere in the string. (Contributed by Mario Carneiro, 29-Sep-2015.)
Hypotheses
Ref Expression
efgval.w 𝑊 = ( I ‘Word (𝐼 × 2o))
efgval.r = ( ~FG𝐼)
efgval2.m 𝑀 = (𝑦𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o𝑧)⟩)
efgval2.t 𝑇 = (𝑣𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤(𝑀𝑤)”⟩⟩)))
Assertion
Ref Expression
efgtval ((𝑋𝑊𝑁 ∈ (0...(♯‘𝑋)) ∧ 𝐴 ∈ (𝐼 × 2o)) → (𝑁(𝑇𝑋)𝐴) = (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝐴(𝑀𝐴)”⟩⟩))
Distinct variable groups:   𝑦,𝑧   𝑣,𝑛,𝑤,𝑦,𝑧   𝑛,𝑀,𝑣,𝑤   𝑛,𝑊,𝑣,𝑤,𝑦,𝑧   𝑦, ,𝑧   𝑛,𝐼,𝑣,𝑤,𝑦,𝑧
Allowed substitution hints:   𝐴(𝑦, 𝑧, 𝑤, 𝑣, 𝑛)   (𝑤, 𝑣, 𝑛)   𝑇(𝑦, 𝑧, 𝑤, 𝑣, 𝑛)   𝑀(𝑦, 𝑧)   𝑁(𝑦, 𝑧, 𝑤, 𝑣, 𝑛)   𝑋(𝑦, 𝑧, 𝑤, 𝑣, 𝑛)

Proof of Theorem efgtval
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 efgval.w . . . . . 6 𝑊 = ( I ‘Word (𝐼 × 2o))
2 efgval.r . . . . . 6 = ( ~FG𝐼)
3 efgval2.m . . . . . 6 𝑀 = (𝑦𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o𝑧)⟩)
4 efgval2.t . . . . . 6 𝑇 = (𝑣𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤(𝑀𝑤)”⟩⟩)))
51, 2, 3, 4efgtf 19815 . . . . 5 (𝑋𝑊 → ((𝑇𝑋) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀𝑏)”⟩⟩)) ∧ (𝑇𝑋):((0...(♯‘𝑋)) × (𝐼 × 2o))⟶𝑊))
65simpld 500 . . . 4 (𝑋𝑊 → (𝑇𝑋) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀𝑏)”⟩⟩)))
76oveqd 7433 . . 3 (𝑋𝑊 → (𝑁(𝑇𝑋)𝐴) = (𝑁(𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀𝑏)”⟩⟩))𝐴))
8 oteq1 4849 . . . . . 6 (𝑎 = 𝑁 → ⟨𝑎, 𝑎, ⟨“𝑏(𝑀𝑏)”⟩⟩ = ⟨𝑁, 𝑎, ⟨“𝑏(𝑀𝑏)”⟩⟩)
9 oteq2 4850 . . . . . 6 (𝑎 = 𝑁 → ⟨𝑁, 𝑎, ⟨“𝑏(𝑀𝑏)”⟩⟩ = ⟨𝑁, 𝑁, ⟨“𝑏(𝑀𝑏)”⟩⟩)
108, 9eqtrd 2800 . . . . 5 (𝑎 = 𝑁 → ⟨𝑎, 𝑎, ⟨“𝑏(𝑀𝑏)”⟩⟩ = ⟨𝑁, 𝑁, ⟨“𝑏(𝑀𝑏)”⟩⟩)
1110oveq2d 7432 . . . 4 (𝑎 = 𝑁 → (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀𝑏)”⟩⟩) = (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝑏(𝑀𝑏)”⟩⟩))
12 id 23 . . . . . . 7 (𝑏 = 𝐴𝑏 = 𝐴)
13 fveq2 6885 . . . . . . 7 (𝑏 = 𝐴 → (𝑀𝑏) = (𝑀𝐴))
1412, 13s2eqd 14919 . . . . . 6 (𝑏 = 𝐴 → ⟨“𝑏(𝑀𝑏)”⟩ = ⟨“𝐴(𝑀𝐴)”⟩)
1514oteq3d 4854 . . . . 5 (𝑏 = 𝐴 → ⟨𝑁, 𝑁, ⟨“𝑏(𝑀𝑏)”⟩⟩ = ⟨𝑁, 𝑁, ⟨“𝐴(𝑀𝐴)”⟩⟩)
1615oveq2d 7432 . . . 4 (𝑏 = 𝐴 → (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝑏(𝑀𝑏)”⟩⟩) = (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝐴(𝑀𝐴)”⟩⟩))
17 eqid 2765 . . . 4 (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀𝑏)”⟩⟩)) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀𝑏)”⟩⟩))
18 ovex 7449 . . . 4 (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝐴(𝑀𝐴)”⟩⟩) ∈ V
1911, 16, 17, 18ovmpo 7576 . . 3 ((𝑁 ∈ (0...(♯‘𝑋)) ∧ 𝐴 ∈ (𝐼 × 2o)) → (𝑁(𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀𝑏)”⟩⟩))𝐴) = (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝐴(𝑀𝐴)”⟩⟩))
207, 19sylan9eq 2820 . 2 ((𝑋𝑊 ∧ (𝑁 ∈ (0...(♯‘𝑋)) ∧ 𝐴 ∈ (𝐼 × 2o))) → (𝑁(𝑇𝑋)𝐴) = (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝐴(𝑀𝐴)”⟩⟩))
21203impb 1132 1 ((𝑋𝑊𝑁 ∈ (0...(♯‘𝑋)) ∧ 𝐴 ∈ (𝐼 × 2o)) → (𝑁(𝑇𝑋)𝐴) = (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝐴(𝑀𝐴)”⟩⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2146  cdif 3903  cop 4597  cotp 4599  cmpt 5194   I cid 5557   × cxp 5661  wf 6536  cfv 6540  (class class class)co 7416  cmpo 7418  1oc1o 8448  2oc2o 8449  0cc0 11111  ...cfz 13546  chash 14379  Word cword 14563   splice csplice 14803  ⟨“cs2 14897   ~FG cefg 19799
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738  ax-cnex 11167  ax-resscn 11168  ax-1cn 11169  ax-icn 11170  ax-addcl 11171  ax-addrcl 11172  ax-mulcl 11173  ax-mulrcl 11174  ax-mulcom 11175  ax-addass 11176  ax-mulass 11177  ax-distr 11178  ax-i2m1 11179  ax-1ne0 11180  ax-1rid 11181  ax-rnegex 11182  ax-rrecex 11183  ax-cnre 11184  ax-pre-lttri 11185  ax-pre-lttrn 11186  ax-pre-ltadd 11187  ax-pre-mulgt0 11188
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-ot 4600  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7865  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-1o 8455  df-2o 8456  df-er 8696  df-map 8828  df-en 8946  df-dom 8947  df-sdom 8948  df-fin 8949  df-card 9937  df-pnf 11256  df-mnf 11257  df-xr 11258  df-ltxr 11259  df-le 11260  df-sub 11454  df-neg 11455  df-nn 12245  df-n0 12516  df-z 12603  df-uz 12874  df-fz 13547  df-fzo 13695  df-hash 14380  df-word 14564  df-concat 14621  df-s1 14648  df-substr 14694  df-pfx 14726  df-splice 14804  df-s2 14904
This theorem is used by:  efginvrel2  19820  efgredleme  19836  efgredlemc  19838  efgcpbllemb  19848
  Copyright terms: Public domain W3C validator