Theorem efgtval 19988

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 19987	. . . . 5 ⊢ (𝑋 ∈ 𝑊 → ((𝑇‘𝑋) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) ∧ (𝑇‘𝑋):((0...(♯‘𝑋)) × (𝐼 × 2o))⟶𝑊))
6	5	simpld 500	. . . 4 ⊢ (𝑋 ∈ 𝑊 → (𝑇‘𝑋) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)))
7	6	oveqd 7468	. . 3 ⊢ (𝑋 ∈ 𝑊 → (𝑁(𝑇‘𝑋)𝐴) = (𝑁(𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))𝐴))
8		oteq1 4865	. . . . . 6 ⊢ (𝑎 = 𝑁 → ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩ = ⟨𝑁, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)
9		oteq2 4866	. . . . . 6 ⊢ (𝑎 = 𝑁 → ⟨𝑁, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩ = ⟨𝑁, 𝑁, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)
10	8, 9	eqtrd 2798	. . . . 5 ⊢ (𝑎 = 𝑁 → ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩ = ⟨𝑁, 𝑁, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)
11	10	oveq2d 7467	. . . 4 ⊢ (𝑎 = 𝑁 → (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩) = (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))
12		id 23	. . . . . . 7 ⊢ (𝑏 = 𝐴 → 𝑏 = 𝐴)
13		fveq2 6916	. . . . . . 7 ⊢ (𝑏 = 𝐴 → (𝑀‘𝑏) = (𝑀‘𝐴))
14	12, 13	s2eqd 15056	. . . . . 6 ⊢ (𝑏 = 𝐴 → ⟨“𝑏(𝑀‘𝑏)”⟩ = ⟨“𝐴(𝑀‘𝐴)”⟩)
15	14	oteq3d 4870	. . . . 5 ⊢ (𝑏 = 𝐴 → ⟨𝑁, 𝑁, ⟨“𝑏(𝑀‘𝑏)”⟩⟩ = ⟨𝑁, 𝑁, ⟨“𝐴(𝑀‘𝐴)”⟩⟩)
16	15	oveq2d 7467	. . . 4 ⊢ (𝑏 = 𝐴 → (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝑏(𝑀‘𝑏)”⟩⟩) = (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝐴(𝑀‘𝐴)”⟩⟩))
17		eqid 2763	. . . 4 ⊢ (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))
18		ovex 7484	. . . 4 ⊢ (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝐴(𝑀‘𝐴)”⟩⟩) ∈ V
19	11, 16, 17, 18	ovmpo 7612	. . 3 ⊢ ((𝑁 ∈ (0...(♯‘𝑋)) ∧ 𝐴 ∈ (𝐼 × 2o)) → (𝑁(𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))𝐴) = (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝐴(𝑀‘𝐴)”⟩⟩))
20	7, 19	sylan9eq 2818	. 2 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑁 ∈ (0...(♯‘𝑋)) ∧ 𝐴 ∈ (𝐼 × 2o))) → (𝑁(𝑇‘𝑋)𝐴) = (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝐴(𝑀‘𝐴)”⟩⟩))
21	20	3impb 1132	1 ⊢ ((𝑋 ∈ 𝑊 ∧ 𝑁 ∈ (0...(♯‘𝑋)) ∧ 𝐴 ∈ (𝐼 × 2o)) → (𝑁(𝑇‘𝑋)𝐴) = (𝑋 splice ⟨𝑁, 𝑁, ⟨“𝐴(𝑀‘𝐴)”⟩⟩))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ∖ cdif 4048  ⟨cop 4840  ⟨cotp 4863   ↦ cmpt 5192   I cid 5552   × cxp 5656  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  1_oc1o 8507  2_oc2o 8508  0cc0 11239  ...cfz 13679  ♯chash 14515  Word cword 14699   splice csplice 14940  ⟨“cs2 15034   ~_FG cefg 19971

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-ot 4864  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-2o 8515  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-card 10057  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-n0 12647  df-z 12734  df-uz 13006  df-fz 13680  df-fzo 13829  df-hash 14516  df-word 14700  df-concat 14757  df-s1 14784  df-substr 14831  df-pfx 14863  df-splice 14941  df-s2 15041

This theorem is used by:  efginvrel2  19992  efgredleme  20008  efgredlemc  20010  efgcpbllemb  20020