efgtlen - Metamath Proof Explorer

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

Theorem efgtlen 19643

Description: Value of the free group construction. (Contributed by Mario Carneiro, 27-Sep-2015.)

**Hypotheses**
Ref	Expression
efgval.w	⊢ 𝑊 = ( I ‘Word (𝐼 × 2_o))
efgval.r	⊢ ∼ = ( ~_FG ‘𝐼)
efgval2.m	⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩)
efgval2.t	⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2_o) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤(𝑀‘𝑤)”⟩⟩)))

**Assertion**
Ref	Expression
efgtlen	⊢ ((𝑋 ∈ 𝑊 ∧ 𝐴 ∈ ran (𝑇‘𝑋)) → (♯‘𝐴) = ((♯‘𝑋) + 2))

Distinct variable groups: 𝑦,𝑧 𝑣,𝑛,𝑤,𝑦,𝑧 𝑛,𝑀,𝑣,𝑤 𝑛,𝑊,𝑣,𝑤,𝑦,𝑧 𝑦, ∼ ,𝑧 𝑛,𝐼,𝑣,𝑤,𝑦,𝑧 Allowed substitution hints: 𝐴(𝑦,𝑧,𝑤,𝑣,𝑛) ∼ (𝑤,𝑣,𝑛) 𝑇(𝑦,𝑧,𝑤,𝑣,𝑛) 𝑀(𝑦,𝑧) 𝑋(𝑦,𝑧,𝑤,𝑣,𝑛)

Proof of Theorem efgtlen Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		efgval.w	. . . . . . . 8 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2_o))
2		efgval.r	. . . . . . . 8 ⊢ ∼ = ( ~_FG ‘𝐼)
3		efgval2.m	. . . . . . . 8 ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩)
4		efgval2.t	. . . . . . . 8 ⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2_o) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤(𝑀‘𝑤)”⟩⟩)))
5	1, 2, 3, 4	efgtf 19639	. . . . . . 7 ⊢ (𝑋 ∈ 𝑊 → ((𝑇‘𝑋) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) ∧ (𝑇‘𝑋):((0...(♯‘𝑋)) × (𝐼 × 2_o))⟶𝑊))
6	5	simpld 494	. . . . . 6 ⊢ (𝑋 ∈ 𝑊 → (𝑇‘𝑋) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)))
7	6	rneqd 5930	. . . . 5 ⊢ (𝑋 ∈ 𝑊 → ran (𝑇‘𝑋) = ran (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)))
8	7	eleq2d 2813	. . . 4 ⊢ (𝑋 ∈ 𝑊 → (𝐴 ∈ ran (𝑇‘𝑋) ↔ 𝐴 ∈ ran (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))))
9		eqid 2726	. . . . 5 ⊢ (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))
10		ovex 7437	. . . . 5 ⊢ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩) ∈ V
11	9, 10	elrnmpo 7540	. . . 4 ⊢ (𝐴 ∈ ran (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) ↔ ∃𝑎 ∈ (0...(♯‘𝑋))∃𝑏 ∈ (𝐼 × 2_o)𝐴 = (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))
12	8, 11	bitrdi 287	. . 3 ⊢ (𝑋 ∈ 𝑊 → (𝐴 ∈ ran (𝑇‘𝑋) ↔ ∃𝑎 ∈ (0...(♯‘𝑋))∃𝑏 ∈ (𝐼 × 2_o)𝐴 = (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)))
13		fviss 6961	. . . . . . . . 9 ⊢ ( I ‘Word (𝐼 × 2_o)) ⊆ Word (𝐼 × 2_o)
14	1, 13	eqsstri 4011	. . . . . . . 8 ⊢ 𝑊 ⊆ Word (𝐼 × 2_o)
15		simpl 482	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑋 ∈ 𝑊)
16	14, 15	sselid 3975	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑋 ∈ Word (𝐼 × 2_o))
17		elfzuz 13500	. . . . . . . . 9 ⊢ (𝑎 ∈ (0...(♯‘𝑋)) → 𝑎 ∈ (ℤ_≥‘0))
18	17	ad2antrl 725	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑎 ∈ (ℤ_≥‘0))
19		eluzfz2b 13513	. . . . . . . 8 ⊢ (𝑎 ∈ (ℤ_≥‘0) ↔ 𝑎 ∈ (0...𝑎))
20	18, 19	sylib 217	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑎 ∈ (0...𝑎))
21		simprl 768	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑎 ∈ (0...(♯‘𝑋)))
22		simprr 770	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑏 ∈ (𝐼 × 2_o))
23	3	efgmf 19630	. . . . . . . . . 10 ⊢ 𝑀:(𝐼 × 2_o)⟶(𝐼 × 2_o)
24	23	ffvelcdmi 7078	. . . . . . . . 9 ⊢ (𝑏 ∈ (𝐼 × 2_o) → (𝑀‘𝑏) ∈ (𝐼 × 2_o))
25	22, 24	syl 17	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (𝑀‘𝑏) ∈ (𝐼 × 2_o))
26	22, 25	s2cld 14825	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → ⟨“𝑏(𝑀‘𝑏)”⟩ ∈ Word (𝐼 × 2_o))
27	16, 20, 21, 26	spllen 14707	. . . . . 6 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (♯‘(𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) = ((♯‘𝑋) + ((♯‘⟨“𝑏(𝑀‘𝑏)”⟩) − (𝑎 − 𝑎))))
28		s2len 14843	. . . . . . . . . 10 ⊢ (♯‘⟨“𝑏(𝑀‘𝑏)”⟩) = 2
29	28	a1i 11	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (♯‘⟨“𝑏(𝑀‘𝑏)”⟩) = 2)
30		eluzelcn 12835	. . . . . . . . . . 11 ⊢ (𝑎 ∈ (ℤ_≥‘0) → 𝑎 ∈ ℂ)
31	18, 30	syl 17	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑎 ∈ ℂ)
32	31	subidd 11560	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (𝑎 − 𝑎) = 0)
33	29, 32	oveq12d 7422	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → ((♯‘⟨“𝑏(𝑀‘𝑏)”⟩) − (𝑎 − 𝑎)) = (2 − 0))
34		2cn 12288	. . . . . . . . 9 ⊢ 2 ∈ ℂ
35	34	subid1i 11533	. . . . . . . 8 ⊢ (2 − 0) = 2
36	33, 35	eqtrdi 2782	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → ((♯‘⟨“𝑏(𝑀‘𝑏)”⟩) − (𝑎 − 𝑎)) = 2)
37	36	oveq2d 7420	. . . . . 6 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → ((♯‘𝑋) + ((♯‘⟨“𝑏(𝑀‘𝑏)”⟩) − (𝑎 − 𝑎))) = ((♯‘𝑋) + 2))
38	27, 37	eqtrd 2766	. . . . 5 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (♯‘(𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) = ((♯‘𝑋) + 2))
39		fveqeq2 6893	. . . . 5 ⊢ (𝐴 = (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩) → ((♯‘𝐴) = ((♯‘𝑋) + 2) ↔ (♯‘(𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) = ((♯‘𝑋) + 2)))
40	38, 39	syl5ibrcom 246	. . . 4 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (𝐴 = (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩) → (♯‘𝐴) = ((♯‘𝑋) + 2)))
41	40	rexlimdvva 3205	. . 3 ⊢ (𝑋 ∈ 𝑊 → (∃𝑎 ∈ (0...(♯‘𝑋))∃𝑏 ∈ (𝐼 × 2_o)𝐴 = (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩) → (♯‘𝐴) = ((♯‘𝑋) + 2)))
42	12, 41	sylbid 239	. 2 ⊢ (𝑋 ∈ 𝑊 → (𝐴 ∈ ran (𝑇‘𝑋) → (♯‘𝐴) = ((♯‘𝑋) + 2)))
43	42	imp 406	1 ⊢ ((𝑋 ∈ 𝑊 ∧ 𝐴 ∈ ran (𝑇‘𝑋)) → (♯‘𝐴) = ((♯‘𝑋) + 2))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1533 ∈ wcel 2098 ∃wrex 3064 ∖ cdif 3940 ⟨cop 4629 ⟨cotp 4631 ↦ cmpt 5224 I cid 5566 × cxp 5667 ran crn 5670 ⟶wf 6532 ‘cfv 6536 (class class class)co 7404 ∈ cmpo 7406 1_oc1o 8457 2_oc2o 8458 ℂcc 11107 0cc0 11109 + caddc 11112 − cmin 11445 2c2 12268 ℤ_≥cuz 12823 ...cfz 13487 ♯chash 14292 Word cword 14467 splice csplice 14702 ⟨“cs2 14795 ~_FG cefg 19623

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7721 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-ot 4632 df-uni 4903 df-int 4944 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6293 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6488 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7360 df-ov 7407 df-oprab 7408 df-mpo 7409 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8264 df-wrecs 8295 df-recs 8369 df-rdg 8408 df-1o 8464 df-2o 8465 df-er 8702 df-map 8821 df-en 8939 df-dom 8940 df-sdom 8941 df-fin 8942 df-card 9933 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11447 df-neg 11448 df-nn 12214 df-2 12276 df-n0 12474 df-z 12560 df-uz 12824 df-fz 13488 df-fzo 13631 df-hash 14293 df-word 14468 df-concat 14524 df-s1 14549 df-substr 14594 df-pfx 14624 df-splice 14703 df-s2 14802

This theorem is referenced by: efgsfo 19656 efgredlemg 19659 efgredlemd 19661 efgredlem 19664 frgpnabllem1 19790

W3C validator