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 19642

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 19638	. . . . . . 7 ⊢ (𝑋 ∈ 𝑊 → ((𝑇‘𝑋) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) ∧ (𝑇‘𝑋):((0...(♯‘𝑋)) × (𝐼 × 2_o))⟶𝑊))
6	5	simpld 494	. . . . . 6 ⊢ (𝑋 ∈ 𝑊 → (𝑇‘𝑋) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)))
7	6	rneqd 5937	. . . . 5 ⊢ (𝑋 ∈ 𝑊 → ran (𝑇‘𝑋) = ran (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)))
8	7	eleq2d 2818	. . . 4 ⊢ (𝑋 ∈ 𝑊 → (𝐴 ∈ ran (𝑇‘𝑋) ↔ 𝐴 ∈ ran (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))))
9		eqid 2731	. . . . 5 ⊢ (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))
10		ovex 7445	. . . . 5 ⊢ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩) ∈ V
11	9, 10	elrnmpo 7548	. . . 4 ⊢ (𝐴 ∈ ran (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) ↔ ∃𝑎 ∈ (0...(♯‘𝑋))∃𝑏 ∈ (𝐼 × 2_o)𝐴 = (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))
12	8, 11	bitrdi 287	. . 3 ⊢ (𝑋 ∈ 𝑊 → (𝐴 ∈ ran (𝑇‘𝑋) ↔ ∃𝑎 ∈ (0...(♯‘𝑋))∃𝑏 ∈ (𝐼 × 2_o)𝐴 = (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)))
13		fviss 6968	. . . . . . . . 9 ⊢ ( I ‘Word (𝐼 × 2_o)) ⊆ Word (𝐼 × 2_o)
14	1, 13	eqsstri 4016	. . . . . . . 8 ⊢ 𝑊 ⊆ Word (𝐼 × 2_o)
15		simpl 482	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑋 ∈ 𝑊)
16	14, 15	sselid 3980	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑋 ∈ Word (𝐼 × 2_o))
17		elfzuz 13504	. . . . . . . . 9 ⊢ (𝑎 ∈ (0...(♯‘𝑋)) → 𝑎 ∈ (ℤ_≥‘0))
18	17	ad2antrl 725	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑎 ∈ (ℤ_≥‘0))
19		eluzfz2b 13517	. . . . . . . 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 19629	. . . . . . . . . 10 ⊢ 𝑀:(𝐼 × 2_o)⟶(𝐼 × 2_o)
24	23	ffvelcdmi 7085	. . . . . . . . 9 ⊢ (𝑏 ∈ (𝐼 × 2_o) → (𝑀‘𝑏) ∈ (𝐼 × 2_o))
25	22, 24	syl 17	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (𝑀‘𝑏) ∈ (𝐼 × 2_o))
26	22, 25	s2cld 14829	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → ⟨“𝑏(𝑀‘𝑏)”⟩ ∈ Word (𝐼 × 2_o))
27	16, 20, 21, 26	spllen 14711	. . . . . 6 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (♯‘(𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) = ((♯‘𝑋) + ((♯‘⟨“𝑏(𝑀‘𝑏)”⟩) − (𝑎 − 𝑎))))
28		s2len 14847	. . . . . . . . . 10 ⊢ (♯‘⟨“𝑏(𝑀‘𝑏)”⟩) = 2
29	28	a1i 11	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (♯‘⟨“𝑏(𝑀‘𝑏)”⟩) = 2)
30		eluzelcn 12841	. . . . . . . . . . 11 ⊢ (𝑎 ∈ (ℤ_≥‘0) → 𝑎 ∈ ℂ)
31	18, 30	syl 17	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑎 ∈ ℂ)
32	31	subidd 11566	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (𝑎 − 𝑎) = 0)
33	29, 32	oveq12d 7430	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → ((♯‘⟨“𝑏(𝑀‘𝑏)”⟩) − (𝑎 − 𝑎)) = (2 − 0))
34		2cn 12294	. . . . . . . . 9 ⊢ 2 ∈ ℂ
35	34	subid1i 11539	. . . . . . . 8 ⊢ (2 − 0) = 2
36	33, 35	eqtrdi 2787	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → ((♯‘⟨“𝑏(𝑀‘𝑏)”⟩) − (𝑎 − 𝑎)) = 2)
37	36	oveq2d 7428	. . . . . 6 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → ((♯‘𝑋) + ((♯‘⟨“𝑏(𝑀‘𝑏)”⟩) − (𝑎 − 𝑎))) = ((♯‘𝑋) + 2))
38	27, 37	eqtrd 2771	. . . . 5 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (♯‘(𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) = ((♯‘𝑋) + 2))
39		fveqeq2 6900	. . . . 5 ⊢ (𝐴 = (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩) → ((♯‘𝐴) = ((♯‘𝑋) + 2) ↔ (♯‘(𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) = ((♯‘𝑋) + 2)))
40	38, 39	syl5ibrcom 246	. . . 4 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (𝐴 = (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩) → (♯‘𝐴) = ((♯‘𝑋) + 2)))
41	40	rexlimdvva 3210	. . 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 1540 ∈ wcel 2105 ∃wrex 3069 ∖ cdif 3945 ⟨cop 4634 ⟨cotp 4636 ↦ cmpt 5231 I cid 5573 × cxp 5674 ran crn 5677 ⟶wf 6539 ‘cfv 6543 (class class class)co 7412 ∈ cmpo 7414 1_oc1o 8465 2_oc2o 8466 ℂcc 11114 0cc0 11116 + caddc 11119 − cmin 11451 2c2 12274 ℤ_≥cuz 12829 ...cfz 13491 ♯chash 14297 Word cword 14471 splice csplice 14706 ⟨“cs2 14799 ~_FG cefg 19622

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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7729 ax-cnex 11172 ax-resscn 11173 ax-1cn 11174 ax-icn 11175 ax-addcl 11176 ax-addrcl 11177 ax-mulcl 11178 ax-mulrcl 11179 ax-mulcom 11180 ax-addass 11181 ax-mulass 11182 ax-distr 11183 ax-i2m1 11184 ax-1ne0 11185 ax-1rid 11186 ax-rnegex 11187 ax-rrecex 11188 ax-cnre 11189 ax-pre-lttri 11190 ax-pre-lttrn 11191 ax-pre-ltadd 11192 ax-pre-mulgt0 11193

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-ot 4637 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7368 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7860 df-1st 7979 df-2nd 7980 df-frecs 8272 df-wrecs 8303 df-recs 8377 df-rdg 8416 df-1o 8472 df-2o 8473 df-er 8709 df-map 8828 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-card 9940 df-pnf 11257 df-mnf 11258 df-xr 11259 df-ltxr 11260 df-le 11261 df-sub 11453 df-neg 11454 df-nn 12220 df-2 12282 df-n0 12480 df-z 12566 df-uz 12830 df-fz 13492 df-fzo 13635 df-hash 14298 df-word 14472 df-concat 14528 df-s1 14553 df-substr 14598 df-pfx 14628 df-splice 14707 df-s2 14806

This theorem is referenced by: efgsfo 19655 efgredlemg 19658 efgredlemd 19660 efgredlem 19663 frgpnabllem1 19789

W3C validator