efgredlemg - Metamath Proof Explorer

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

Theorem efgredlemg 19983

Description: Lemma for efgred 19989. (Contributed by Mario Carneiro, 4-Jun-2016.)

**Hypotheses**
Ref	Expression
efgval.w	⊢ 𝑊 = ( I ‘Word (𝐼 × 2_o))
efgval.r	⊢ ∼ = ( ~_FG ‘𝐼)
efgval2.m	⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩)
efgval2.t	⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2_o) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤(𝑀‘𝑤)”⟩⟩)))
efgred.d	⊢ 𝐷 = (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥))
efgred.s	⊢ 𝑆 = (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((♯‘𝑚) − 1)))
efgredlem.1	⊢ (𝜑 → ∀𝑎 ∈ dom 𝑆∀𝑏 ∈ dom 𝑆((♯‘(𝑆‘𝑎)) < (♯‘(𝑆‘𝐴)) → ((𝑆‘𝑎) = (𝑆‘𝑏) → (𝑎‘0) = (𝑏‘0))))
efgredlem.2	⊢ (𝜑 → 𝐴 ∈ dom 𝑆)
efgredlem.3	⊢ (𝜑 → 𝐵 ∈ dom 𝑆)
efgredlem.4	⊢ (𝜑 → (𝑆‘𝐴) = (𝑆‘𝐵))
efgredlem.5	⊢ (𝜑 → ¬ (𝐴‘0) = (𝐵‘0))
efgredlemb.k	⊢ 𝐾 = (((♯‘𝐴) − 1) − 1)
efgredlemb.l	⊢ 𝐿 = (((♯‘𝐵) − 1) − 1)
efgredlemb.p	⊢ (𝜑 → 𝑃 ∈ (0...(♯‘(𝐴‘𝐾))))
efgredlemb.q	⊢ (𝜑 → 𝑄 ∈ (0...(♯‘(𝐵‘𝐿))))
efgredlemb.u	⊢ (𝜑 → 𝑈 ∈ (𝐼 × 2_o))
efgredlemb.v	⊢ (𝜑 → 𝑉 ∈ (𝐼 × 2_o))
efgredlemb.6	⊢ (𝜑 → (𝑆‘𝐴) = (𝑃(𝑇‘(𝐴‘𝐾))𝑈))
efgredlemb.7	⊢ (𝜑 → (𝑆‘𝐵) = (𝑄(𝑇‘(𝐵‘𝐿))𝑉))

**Assertion**
Ref	Expression
efgredlemg	⊢ (𝜑 → (♯‘(𝐴‘𝐾)) = (♯‘(𝐵‘𝐿)))

Distinct variable groups: 𝑎,𝑏,𝐴 𝑦,𝑎,𝑧,𝑏 𝐿,𝑎,𝑏 𝐾,𝑎,𝑏 𝑡,𝑛,𝑣,𝑤,𝑦,𝑧,𝑃 𝑚,𝑎,𝑛,𝑡,𝑣,𝑤,𝑥,𝑀,𝑏 𝑈,𝑛,𝑣,𝑤,𝑦,𝑧 𝑘,𝑎,𝑇,𝑏,𝑚,𝑡,𝑥 𝑛,𝑉,𝑣,𝑤,𝑦,𝑧 𝑄,𝑛,𝑡,𝑣,𝑤,𝑦,𝑧 𝑊,𝑎,𝑏 𝑘,𝑛,𝑣,𝑤,𝑦,𝑧,𝑊,𝑚,𝑡,𝑥 ∼ ,𝑎,𝑏,𝑚,𝑡,𝑥,𝑦,𝑧 𝐵,𝑎,𝑏 𝑆,𝑎,𝑏 𝐼,𝑎,𝑏,𝑚,𝑛,𝑡,𝑣,𝑤,𝑥,𝑦,𝑧 𝐷,𝑎,𝑏,𝑚,𝑡 Allowed substitution hints: 𝜑(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, 𝑡, 𝑘, 𝑚, 𝑛, 𝑎, 𝑏) 𝐴(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, 𝑡, 𝑘, 𝑚, 𝑛) 𝐵(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, 𝑡, 𝑘, 𝑚, 𝑛) 𝐷(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, 𝑘, 𝑛) 𝑃(𝑥, 𝑘, 𝑚, 𝑎, 𝑏) 𝑄(𝑥, 𝑘, 𝑚, 𝑎, 𝑏) ∼ (𝑤, 𝑣, 𝑘, 𝑛) 𝑆(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, 𝑡, 𝑘, 𝑚, 𝑛) 𝑇(𝑦, 𝑧, 𝑤, 𝑣, 𝑛) 𝑈(𝑥, 𝑡, 𝑘, 𝑚, 𝑎, 𝑏) 𝐼(𝑘) 𝐾(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, 𝑡, 𝑘, 𝑚, 𝑛) 𝐿(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, 𝑡, 𝑘, 𝑚, 𝑛) 𝑀(𝑦, 𝑧, 𝑘) 𝑉(𝑥, 𝑡, 𝑘, 𝑚, 𝑎, 𝑏)

**Proof of Theorem efgredlemg**
Step	Hyp	Ref	Expression
1		efgval.w	. . . . . 6 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2_o))
2		fviss 6982	. . . . . 6 ⊢ ( I ‘Word (𝐼 × 2_o)) ⊆ Word (𝐼 × 2_o)
3	1, 2	eqsstri 3959	. . . . 5 ⊢ 𝑊 ⊆ Word (𝐼 × 2_o)
4		efgval.r	. . . . . . 7 ⊢ ∼ = ( ~_FG ‘𝐼)
5		efgval2.m	. . . . . . 7 ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩)
6		efgval2.t	. . . . . . 7 ⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2_o) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤(𝑀‘𝑤)”⟩⟩)))
7		efgred.d	. . . . . . 7 ⊢ 𝐷 = (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥))
8		efgred.s	. . . . . . 7 ⊢ 𝑆 = (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((♯‘𝑚) − 1)))
9		efgredlem.1	. . . . . . 7 ⊢ (𝜑 → ∀𝑎 ∈ dom 𝑆∀𝑏 ∈ dom 𝑆((♯‘(𝑆‘𝑎)) < (♯‘(𝑆‘𝐴)) → ((𝑆‘𝑎) = (𝑆‘𝑏) → (𝑎‘0) = (𝑏‘0))))
10		efgredlem.2	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ dom 𝑆)
11		efgredlem.3	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ dom 𝑆)
12		efgredlem.4	. . . . . . 7 ⊢ (𝜑 → (𝑆‘𝐴) = (𝑆‘𝐵))
13		efgredlem.5	. . . . . . 7 ⊢ (𝜑 → ¬ (𝐴‘0) = (𝐵‘0))
14		efgredlemb.k	. . . . . . 7 ⊢ 𝐾 = (((♯‘𝐴) − 1) − 1)
15		efgredlemb.l	. . . . . . 7 ⊢ 𝐿 = (((♯‘𝐵) − 1) − 1)
16	1, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15	efgredlemf 19982	. . . . . 6 ⊢ (𝜑 → ((𝐴‘𝐾) ∈ 𝑊 ∧ (𝐵‘𝐿) ∈ 𝑊))
17	16	simpld 500	. . . . 5 ⊢ (𝜑 → (𝐴‘𝐾) ∈ 𝑊)
18	3, 17	sselid 3911	. . . 4 ⊢ (𝜑 → (𝐴‘𝐾) ∈ Word (𝐼 × 2_o))
19		lencl 14702	. . . 4 ⊢ ((𝐴‘𝐾) ∈ Word (𝐼 × 2_o) → (♯‘(𝐴‘𝐾)) ∈ ℕ₀)
20	18, 19	syl 18	. . 3 ⊢ (𝜑 → (♯‘(𝐴‘𝐾)) ∈ ℕ₀)
21	20	nn0cnd 12693	. 2 ⊢ (𝜑 → (♯‘(𝐴‘𝐾)) ∈ ℂ)
22	16	simprd 501	. . . . 5 ⊢ (𝜑 → (𝐵‘𝐿) ∈ 𝑊)
23	3, 22	sselid 3911	. . . 4 ⊢ (𝜑 → (𝐵‘𝐿) ∈ Word (𝐼 × 2_o))
24		lencl 14702	. . . 4 ⊢ ((𝐵‘𝐿) ∈ Word (𝐼 × 2_o) → (♯‘(𝐵‘𝐿)) ∈ ℕ₀)
25	23, 24	syl 18	. . 3 ⊢ (𝜑 → (♯‘(𝐵‘𝐿)) ∈ ℕ₀)
26	25	nn0cnd 12693	. 2 ⊢ (𝜑 → (♯‘(𝐵‘𝐿)) ∈ ℂ)
27		2cnd 12445	. 2 ⊢ (𝜑 → 2 ∈ ℂ)
28	1, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13	efgredlema 19981	. . . . . . 7 ⊢ (𝜑 → (((♯‘𝐴) − 1) ∈ ℕ ∧ ((♯‘𝐵) − 1) ∈ ℕ))
29	28	simpld 500	. . . . . 6 ⊢ (𝜑 → ((♯‘𝐴) − 1) ∈ ℕ)
30	1, 4, 5, 6, 7, 8	efgsdmi 19973	. . . . . 6 ⊢ ((𝐴 ∈ dom 𝑆 ∧ ((♯‘𝐴) − 1) ∈ ℕ) → (𝑆‘𝐴) ∈ ran (𝑇‘(𝐴‘(((♯‘𝐴) − 1) − 1))))
31	10, 29, 30	syl2anc 596	. . . . 5 ⊢ (𝜑 → (𝑆‘𝐴) ∈ ran (𝑇‘(𝐴‘(((♯‘𝐴) − 1) − 1))))
32	14	fveq2i 6908	. . . . . . 7 ⊢ (𝐴‘𝐾) = (𝐴‘(((♯‘𝐴) − 1) − 1))
33	32	fveq2i 6908	. . . . . 6 ⊢ (𝑇‘(𝐴‘𝐾)) = (𝑇‘(𝐴‘(((♯‘𝐴) − 1) − 1)))
34	33	rneqi 5925	. . . . 5 ⊢ ran (𝑇‘(𝐴‘𝐾)) = ran (𝑇‘(𝐴‘(((♯‘𝐴) − 1) − 1)))
35	31, 34	eleqtrrdi 2875	. . . 4 ⊢ (𝜑 → (𝑆‘𝐴) ∈ ran (𝑇‘(𝐴‘𝐾)))
36	1, 4, 5, 6	efgtlen 19967	. . . 4 ⊢ (((𝐴‘𝐾) ∈ 𝑊 ∧ (𝑆‘𝐴) ∈ ran (𝑇‘(𝐴‘𝐾))) → (♯‘(𝑆‘𝐴)) = ((♯‘(𝐴‘𝐾)) + 2))
37	17, 35, 36	syl2anc 596	. . 3 ⊢ (𝜑 → (♯‘(𝑆‘𝐴)) = ((♯‘(𝐴‘𝐾)) + 2))
38	28	simprd 501	. . . . . . 7 ⊢ (𝜑 → ((♯‘𝐵) − 1) ∈ ℕ)
39	1, 4, 5, 6, 7, 8	efgsdmi 19973	. . . . . . 7 ⊢ ((𝐵 ∈ dom 𝑆 ∧ ((♯‘𝐵) − 1) ∈ ℕ) → (𝑆‘𝐵) ∈ ran (𝑇‘(𝐵‘(((♯‘𝐵) − 1) − 1))))
40	11, 38, 39	syl2anc 596	. . . . . 6 ⊢ (𝜑 → (𝑆‘𝐵) ∈ ran (𝑇‘(𝐵‘(((♯‘𝐵) − 1) − 1))))
41	12, 40	eqeltrd 2864	. . . . 5 ⊢ (𝜑 → (𝑆‘𝐴) ∈ ran (𝑇‘(𝐵‘(((♯‘𝐵) − 1) − 1))))
42	15	fveq2i 6908	. . . . . . 7 ⊢ (𝐵‘𝐿) = (𝐵‘(((♯‘𝐵) − 1) − 1))
43	42	fveq2i 6908	. . . . . 6 ⊢ (𝑇‘(𝐵‘𝐿)) = (𝑇‘(𝐵‘(((♯‘𝐵) − 1) − 1)))
44	43	rneqi 5925	. . . . 5 ⊢ ran (𝑇‘(𝐵‘𝐿)) = ran (𝑇‘(𝐵‘(((♯‘𝐵) − 1) − 1)))
45	41, 44	eleqtrrdi 2875	. . . 4 ⊢ (𝜑 → (𝑆‘𝐴) ∈ ran (𝑇‘(𝐵‘𝐿)))
46	1, 4, 5, 6	efgtlen 19967	. . . 4 ⊢ (((𝐵‘𝐿) ∈ 𝑊 ∧ (𝑆‘𝐴) ∈ ran (𝑇‘(𝐵‘𝐿))) → (♯‘(𝑆‘𝐴)) = ((♯‘(𝐵‘𝐿)) + 2))
47	22, 45, 46	syl2anc 596	. . 3 ⊢ (𝜑 → (♯‘(𝑆‘𝐴)) = ((♯‘(𝐵‘𝐿)) + 2))
48	37, 47	eqtr3d 2800	. 2 ⊢ (𝜑 → ((♯‘(𝐴‘𝐾)) + 2) = ((♯‘(𝐵‘𝐿)) + 2))
49	21, 26, 27, 48	addcan2ad 11540	1 ⊢ (𝜑 → (♯‘(𝐴‘𝐾)) = (♯‘(𝐵‘𝐿)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 {crab 3416 ∖ cdif 4048 ∅c0 4281 {csn 4588 ⟨cop 4838 ⟨cotp 4861 ∪ ciun 4954 class class class wbr 5106 ↦ cmpt 5189 I cid 5549 × cxp 5653 dom cdm 5655 ran crn 5656 ‘cfv 6555 (class class class)co 7440 ∈ cmpo 7442 1_oc1o 8494 2_oc2o 8495 0cc0 11224 1c1 11225 + caddc 11227 < clt 11367 − cmin 11565 ℕcn 12359 2c2 12421 ℕ₀cn0 12630 ...cfz 13663 ..^cfzo 13812 ♯chash 14498 Word cword 14682 splice csplice 14923 ⟨“cs2 15017 ~_FG cefg 19947

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 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-cnex 11280 ax-resscn 11281 ax-1cn 11282 ax-icn 11283 ax-addcl 11284 ax-addrcl 11285 ax-mulcl 11286 ax-mulrcl 11287 ax-mulcom 11288 ax-addass 11289 ax-mulass 11290 ax-distr 11291 ax-i2m1 11292 ax-1ne0 11293 ax-1rid 11294 ax-rnegex 11295 ax-rrecex 11296 ax-cnre 11297 ax-pre-lttri 11298 ax-pre-lttrn 11299 ax-pre-ltadd 11300 ax-pre-mulgt0 11301

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 4839 df-ot 4862 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-om 7899 df-1st 8022 df-2nd 8023 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-1o 8501 df-2o 8502 df-er 8742 df-map 8874 df-en 8999 df-dom 9000 df-sdom 9001 df-fin 9002 df-card 10044 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-sub 11567 df-neg 11568 df-nn 12360 df-2 12429 df-n0 12631 df-z 12718 df-uz 12990 df-fz 13664 df-fzo 13813 df-hash 14499 df-word 14683 df-concat 14740 df-s1 14767 df-substr 14814 df-pfx 14846 df-splice 14924 df-s2 15024

This theorem is used by: efgredleme 19984

W3C validator