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 19588

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 19584	. . . . . . 7 ⊢ (𝑋 ∈ 𝑊 → ((𝑇‘𝑋) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) ∧ (𝑇‘𝑋):((0...(♯‘𝑋)) × (𝐼 × 2_o))⟶𝑊))
6	5	simpld 495	. . . . . 6 ⊢ (𝑋 ∈ 𝑊 → (𝑇‘𝑋) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)))
7	6	rneqd 5935	. . . . 5 ⊢ (𝑋 ∈ 𝑊 → ran (𝑇‘𝑋) = ran (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)))
8	7	eleq2d 2819	. . . 4 ⊢ (𝑋 ∈ 𝑊 → (𝐴 ∈ ran (𝑇‘𝑋) ↔ 𝐴 ∈ ran (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))))
9		eqid 2732	. . . . 5 ⊢ (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))
10		ovex 7438	. . . . 5 ⊢ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩) ∈ V
11	9, 10	elrnmpo 7541	. . . 4 ⊢ (𝐴 ∈ ran (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2_o) ↦ (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) ↔ ∃𝑎 ∈ (0...(♯‘𝑋))∃𝑏 ∈ (𝐼 × 2_o)𝐴 = (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩))
12	8, 11	bitrdi 286	. . 3 ⊢ (𝑋 ∈ 𝑊 → (𝐴 ∈ ran (𝑇‘𝑋) ↔ ∃𝑎 ∈ (0...(♯‘𝑋))∃𝑏 ∈ (𝐼 × 2_o)𝐴 = (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)))
13		fviss 6965	. . . . . . . . 9 ⊢ ( I ‘Word (𝐼 × 2_o)) ⊆ Word (𝐼 × 2_o)
14	1, 13	eqsstri 4015	. . . . . . . 8 ⊢ 𝑊 ⊆ Word (𝐼 × 2_o)
15		simpl 483	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑋 ∈ 𝑊)
16	14, 15	sselid 3979	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑋 ∈ Word (𝐼 × 2_o))
17		elfzuz 13493	. . . . . . . . 9 ⊢ (𝑎 ∈ (0...(♯‘𝑋)) → 𝑎 ∈ (ℤ_≥‘0))
18	17	ad2antrl 726	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑎 ∈ (ℤ_≥‘0))
19		eluzfz2b 13506	. . . . . . . 8 ⊢ (𝑎 ∈ (ℤ_≥‘0) ↔ 𝑎 ∈ (0...𝑎))
20	18, 19	sylib 217	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑎 ∈ (0...𝑎))
21		simprl 769	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑎 ∈ (0...(♯‘𝑋)))
22		simprr 771	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑏 ∈ (𝐼 × 2_o))
23	3	efgmf 19575	. . . . . . . . . 10 ⊢ 𝑀:(𝐼 × 2_o)⟶(𝐼 × 2_o)
24	23	ffvelcdmi 7082	. . . . . . . . 9 ⊢ (𝑏 ∈ (𝐼 × 2_o) → (𝑀‘𝑏) ∈ (𝐼 × 2_o))
25	22, 24	syl 17	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (𝑀‘𝑏) ∈ (𝐼 × 2_o))
26	22, 25	s2cld 14818	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → ⟨“𝑏(𝑀‘𝑏)”⟩ ∈ Word (𝐼 × 2_o))
27	16, 20, 21, 26	spllen 14700	. . . . . 6 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (♯‘(𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) = ((♯‘𝑋) + ((♯‘⟨“𝑏(𝑀‘𝑏)”⟩) − (𝑎 − 𝑎))))
28		s2len 14836	. . . . . . . . . 10 ⊢ (♯‘⟨“𝑏(𝑀‘𝑏)”⟩) = 2
29	28	a1i 11	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (♯‘⟨“𝑏(𝑀‘𝑏)”⟩) = 2)
30		eluzelcn 12830	. . . . . . . . . . 11 ⊢ (𝑎 ∈ (ℤ_≥‘0) → 𝑎 ∈ ℂ)
31	18, 30	syl 17	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → 𝑎 ∈ ℂ)
32	31	subidd 11555	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (𝑎 − 𝑎) = 0)
33	29, 32	oveq12d 7423	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → ((♯‘⟨“𝑏(𝑀‘𝑏)”⟩) − (𝑎 − 𝑎)) = (2 − 0))
34		2cn 12283	. . . . . . . . 9 ⊢ 2 ∈ ℂ
35	34	subid1i 11528	. . . . . . . 8 ⊢ (2 − 0) = 2
36	33, 35	eqtrdi 2788	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → ((♯‘⟨“𝑏(𝑀‘𝑏)”⟩) − (𝑎 − 𝑎)) = 2)
37	36	oveq2d 7421	. . . . . 6 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → ((♯‘𝑋) + ((♯‘⟨“𝑏(𝑀‘𝑏)”⟩) − (𝑎 − 𝑎))) = ((♯‘𝑋) + 2))
38	27, 37	eqtrd 2772	. . . . 5 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (♯‘(𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) = ((♯‘𝑋) + 2))
39		fveqeq2 6897	. . . . 5 ⊢ (𝐴 = (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩) → ((♯‘𝐴) = ((♯‘𝑋) + 2) ↔ (♯‘(𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩)) = ((♯‘𝑋) + 2)))
40	38, 39	syl5ibrcom 246	. . . 4 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑎 ∈ (0...(♯‘𝑋)) ∧ 𝑏 ∈ (𝐼 × 2_o))) → (𝐴 = (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩) → (♯‘𝐴) = ((♯‘𝑋) + 2)))
41	40	rexlimdvva 3211	. . 3 ⊢ (𝑋 ∈ 𝑊 → (∃𝑎 ∈ (0...(♯‘𝑋))∃𝑏 ∈ (𝐼 × 2_o)𝐴 = (𝑋 splice ⟨𝑎, 𝑎, ⟨“𝑏(𝑀‘𝑏)”⟩⟩) → (♯‘𝐴) = ((♯‘𝑋) + 2)))
42	12, 41	sylbid 239	. 2 ⊢ (𝑋 ∈ 𝑊 → (𝐴 ∈ ran (𝑇‘𝑋) → (♯‘𝐴) = ((♯‘𝑋) + 2)))
43	42	imp 407	1 ⊢ ((𝑋 ∈ 𝑊 ∧ 𝐴 ∈ ran (𝑇‘𝑋)) → (♯‘𝐴) = ((♯‘𝑋) + 2))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∃wrex 3070 ∖ cdif 3944 ⟨cop 4633 ⟨cotp 4635 ↦ cmpt 5230 I cid 5572 × cxp 5673 ran crn 5676 ⟶wf 6536 ‘cfv 6540 (class class class)co 7405 ∈ cmpo 7407 1_oc1o 8455 2_oc2o 8456 ℂcc 11104 0cc0 11106 + caddc 11109 − cmin 11440 2c2 12263 ℤ_≥cuz 12818 ...cfz 13480 ♯chash 14286 Word cword 14460 splice csplice 14695 ⟨“cs2 14788 ~_FG cefg 19568

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-ot 4636 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-2o 8463 df-er 8699 df-map 8818 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-n0 12469 df-z 12555 df-uz 12819 df-fz 13481 df-fzo 13624 df-hash 14287 df-word 14461 df-concat 14517 df-s1 14542 df-substr 14587 df-pfx 14617 df-splice 14696 df-s2 14795

This theorem is referenced by: efgsfo 19601 efgredlemg 19604 efgredlemd 19606 efgredlem 19609 frgpnabllem1 19735

W3C validator