Theorem efgtval 19620

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.

Step	Hyp	Ref	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 ⟨𝑛, 𝑛, ⟨“𝑤(𝑀‘𝑤)”⟩⟩)))
5	1, 2, 3, 4	efgtf 19619	. . . . 5 ⊢ (𝑋 ∈ 𝑊 → ((𝑇‘𝑋) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) ∧ (𝑇‘𝑋):((0...(♯‘𝑋)) × (𝐼 × 2o))⟶𝑊))
6	5	simpld 494	. . . 4 ⊢ (𝑋 ∈ 𝑊 → (𝑇‘𝑋) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)))
7	6	oveqd 7370	. . 3 ⊢ (𝑋 ∈ 𝑊 → (𝑁(𝑇‘𝑋)𝐴) = (𝑁(𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))𝐴))
8		oteq1 4836	. . . . . 6 ⊢ (𝑎 = 𝑁 → ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩ = ⟨𝑁, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)
9		oteq2 4837	. . . . . 6 ⊢ (𝑎 = 𝑁 → ⟨𝑁, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩ = ⟨𝑁, 𝑁, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)
10	8, 9	eqtrd 2764	. . . . 5 ⊢ (𝑎 = 𝑁 → ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩ = ⟨𝑁, 𝑁, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)
11	10	oveq2d 7369	. . . 4 ⊢ (𝑎 = 𝑁 → (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩) = (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))
12		id 22	. . . . . . 7 ⊢ (𝑏 = 𝐴 → 𝑏 = 𝐴)
13		fveq2 6826	. . . . . . 7 ⊢ (𝑏 = 𝐴 → (𝑀‘𝑏) = (𝑀‘𝐴))
14	12, 13	s2eqd 14788	. . . . . 6 ⊢ (𝑏 = 𝐴 → ⟨“𝑏(𝑀‘𝑏)”⟩ = ⟨“𝐴(𝑀‘𝐴)”⟩)
15	14	oteq3d 4841	. . . . 5 ⊢ (𝑏 = 𝐴 → ⟨𝑁, 𝑁, ⟨“𝑏(𝑀‘𝑏)”⟩⟩ = ⟨𝑁, 𝑁, ⟨“𝐴(𝑀‘𝐴)”⟩⟩)
16	15	oveq2d 7369	. . . 4 ⊢ (𝑏 = 𝐴 → (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝑏(𝑀‘𝑏)”⟩⟩) = (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝐴(𝑀‘𝐴)”⟩⟩))
17		eqid 2729	. . . 4 ⊢ (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))
18		ovex 7386	. . . 4 ⊢ (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝐴(𝑀‘𝐴)”⟩⟩) ∈ V
19	11, 16, 17, 18	ovmpo 7513	. . 3 ⊢ ((𝑁 ∈ (0...(♯‘𝑋)) ∧ 𝐴 ∈ (𝐼 × 2o)) → (𝑁(𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))𝐴) = (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝐴(𝑀‘𝐴)”⟩⟩))
20	7, 19	sylan9eq 2784	. 2 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑁 ∈ (0...(♯‘𝑋)) ∧ 𝐴 ∈ (𝐼 × 2o))) → (𝑁(𝑇‘𝑋)𝐴) = (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝐴(𝑀‘𝐴)”⟩⟩))
21	20	3impb 1114	1 ⊢ ((𝑋 ∈ 𝑊 ∧ 𝑁 ∈ (0...(♯‘𝑋)) ∧ 𝐴 ∈ (𝐼 × 2o)) → (𝑁(𝑇‘𝑋)𝐴) = (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝐴(𝑀‘𝐴)”⟩⟩))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ∖ cdif 3902  ⟨cop 4585  ⟨cotp 4587   ↦ cmpt 5176   I cid 5517   × cxp 5621  ⟶wf 6482  ‘cfv 6486  (class class class)co 7353   ∈ cmpo 7355  1_oc1o 8388  2_oc2o 8389  0cc0 11028  ...cfz 13428  ♯chash 14255  Word cword 14438   splice csplice 14673  ⟨“cs2 14766   ~_FG cefg 19603

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675  ax-cnex 11084  ax-resscn 11085  ax-1cn 11086  ax-icn 11087  ax-addcl 11088  ax-addrcl 11089  ax-mulcl 11090  ax-mulrcl 11091  ax-mulcom 11092  ax-addass 11093  ax-mulass 11094  ax-distr 11095  ax-i2m1 11096  ax-1ne0 11097  ax-1rid 11098  ax-rnegex 11099  ax-rrecex 11100  ax-cnre 11101  ax-pre-lttri 11102  ax-pre-lttrn 11103  ax-pre-ltadd 11104  ax-pre-mulgt0 11105

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-ot 4588  df-uni 4862  df-int 4900  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7310  df-ov 7356  df-oprab 7357  df-mpo 7358  df-om 7807  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-1o 8395  df-2o 8396  df-er 8632  df-map 8762  df-en 8880  df-dom 8881  df-sdom 8882  df-fin 8883  df-card 9854  df-pnf 11170  df-mnf 11171  df-xr 11172  df-ltxr 11173  df-le 11174  df-sub 11367  df-neg 11368  df-nn 12147  df-n0 12403  df-z 12490  df-uz 12754  df-fz 13429  df-fzo 13576  df-hash 14256  df-word 14439  df-concat 14496  df-s1 14521  df-substr 14566  df-pfx 14596  df-splice 14674  df-s2 14773

This theorem is referenced by:  efginvrel2  19624  efgredleme  19640  efgredlemc  19642  efgcpbllemb  19652