Theorem efgrelexlemb 19691

Description: If two words 𝐴, 𝐵 are related under the free group equivalence, then there exist two extension sequences 𝑎, 𝑏 such that 𝑎 ends at 𝐴, 𝑏 ends at 𝐵, and 𝑎 and 𝐵 have the same starting point. (Contributed by Mario Carneiro, 1-Oct-2015.)

Hypotheses

Ref	Expression
efgval.w	⊢ 𝑊 = ( I ‘Word (𝐼 × 2o))
efgval.r	⊢ ∼ = ( ~FG ‘𝐼)
efgval2.m	⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩)
efgval2.t	⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤(𝑀‘𝑤)”⟩⟩)))
efgred.d	⊢ 𝐷 = (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥))
efgred.s	⊢ 𝑆 = (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((♯‘𝑚) − 1)))
efgrelexlem.1	⊢ 𝐿 = {⟨𝑖, 𝑗⟩ ∣ ∃𝑐 ∈ (◡𝑆 “ {𝑖})∃𝑑 ∈ (◡𝑆 “ {𝑗})(𝑐‘0) = (𝑑‘0)}

Assertion

Ref	Expression
efgrelexlemb	⊢ ∼ ⊆ 𝐿

Distinct variable groups:   𝑐,𝑑,𝑖,𝑗   𝑦,𝑧   𝑛,𝑐,𝑡,𝑣,𝑤,𝑦,𝑧,𝑚,𝑥   𝑀,𝑐   𝑖,𝑚,𝑛,𝑡,𝑣,𝑤,𝑥,𝑀,𝑗   𝑘,𝑐,𝑇,𝑖,𝑗,𝑚,𝑡,𝑥   𝑊,𝑐   𝑘,𝑑,𝑚,𝑛,𝑡,𝑣,𝑤,𝑥,𝑦,𝑧,𝑊,𝑖,𝑗   ∼ ,𝑐,𝑑,𝑖,𝑗,𝑚,𝑡,𝑥,𝑦,𝑧   𝑆,𝑐,𝑑,𝑖,𝑗   𝐼,𝑐,𝑖,𝑗,𝑚,𝑛,𝑡,𝑣,𝑤,𝑥,𝑦,𝑧   𝐷,𝑐,𝑑,𝑖,𝑗,𝑚,𝑡

Allowed substitution hints:   𝐷(𝑥,𝑦,𝑧,𝑤,𝑣,𝑘,𝑛)   ∼ (𝑤,𝑣,𝑘,𝑛)   𝑆(𝑥,𝑦,𝑧,𝑤,𝑣,𝑡,𝑘,𝑚,𝑛)   𝑇(𝑦,𝑧,𝑤,𝑣,𝑛,𝑑)   𝐼(𝑘,𝑑)   𝐿(𝑥,𝑦,𝑧,𝑤,𝑣,𝑡,𝑖,𝑗,𝑘,𝑚,𝑛,𝑐,𝑑)   𝑀(𝑦,𝑧,𝑘,𝑑)

Proof of Theorem efgrelexlemb

Dummy variables 𝑎 𝑏 𝑓 𝑔 ℎ 𝑟 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		efgval.w	. . 3 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o))
2		efgval.r	. . 3 ⊢ ∼ = ( ~FG ‘𝐼)
3		efgval2.m	. . 3 ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩)
4		efgval2.t	. . 3 ⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤(𝑀‘𝑤)”⟩⟩)))
5	1, 2, 3, 4	efgval2 19665	. 2 ⊢ ∼ = ∩ {𝑟 ∣ (𝑟 Er 𝑊 ∧ ∀𝑎 ∈ 𝑊 ran (𝑇‘𝑎) ⊆ [𝑎]𝑟)}
6		efgrelexlem.1	. . . . . . . 8 ⊢ 𝐿 = {⟨𝑖, 𝑗⟩ ∣ ∃𝑐 ∈ (◡𝑆 “ {𝑖})∃𝑑 ∈ (◡𝑆 “ {𝑗})(𝑐‘0) = (𝑑‘0)}
7	6	relopabiv 5777	. . . . . . 7 ⊢ Rel 𝐿
8	7	a1i 11	. . . . . 6 ⊢ (⊤ → Rel 𝐿)
9		simpr 484	. . . . . . 7 ⊢ ((⊤ ∧ 𝑓𝐿𝑔) → 𝑓𝐿𝑔)
10		eqcom 2744	. . . . . . . . . 10 ⊢ ((𝑎‘0) = (𝑏‘0) ↔ (𝑏‘0) = (𝑎‘0))
11	10	2rexbii 3114	. . . . . . . . 9 ⊢ (∃𝑎 ∈ (◡𝑆 “ {𝑓})∃𝑏 ∈ (◡𝑆 “ {𝑔})(𝑎‘0) = (𝑏‘0) ↔ ∃𝑎 ∈ (◡𝑆 “ {𝑓})∃𝑏 ∈ (◡𝑆 “ {𝑔})(𝑏‘0) = (𝑎‘0))
12		rexcom 3267	. . . . . . . . 9 ⊢ (∃𝑎 ∈ (◡𝑆 “ {𝑓})∃𝑏 ∈ (◡𝑆 “ {𝑔})(𝑏‘0) = (𝑎‘0) ↔ ∃𝑏 ∈ (◡𝑆 “ {𝑔})∃𝑎 ∈ (◡𝑆 “ {𝑓})(𝑏‘0) = (𝑎‘0))
13	11, 12	bitri 275	. . . . . . . 8 ⊢ (∃𝑎 ∈ (◡𝑆 “ {𝑓})∃𝑏 ∈ (◡𝑆 “ {𝑔})(𝑎‘0) = (𝑏‘0) ↔ ∃𝑏 ∈ (◡𝑆 “ {𝑔})∃𝑎 ∈ (◡𝑆 “ {𝑓})(𝑏‘0) = (𝑎‘0))
14		efgred.d	. . . . . . . . 9 ⊢ 𝐷 = (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥))
15		efgred.s	. . . . . . . . 9 ⊢ 𝑆 = (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((♯‘𝑚) − 1)))
16	1, 2, 3, 4, 14, 15, 6	efgrelexlema 19690	. . . . . . . 8 ⊢ (𝑓𝐿𝑔 ↔ ∃𝑎 ∈ (◡𝑆 “ {𝑓})∃𝑏 ∈ (◡𝑆 “ {𝑔})(𝑎‘0) = (𝑏‘0))
17	1, 2, 3, 4, 14, 15, 6	efgrelexlema 19690	. . . . . . . 8 ⊢ (𝑔𝐿𝑓 ↔ ∃𝑏 ∈ (◡𝑆 “ {𝑔})∃𝑎 ∈ (◡𝑆 “ {𝑓})(𝑏‘0) = (𝑎‘0))
18	13, 16, 17	3bitr4i 303	. . . . . . 7 ⊢ (𝑓𝐿𝑔 ↔ 𝑔𝐿𝑓)
19	9, 18	sylib 218	. . . . . 6 ⊢ ((⊤ ∧ 𝑓𝐿𝑔) → 𝑔𝐿𝑓)
20	1, 2, 3, 4, 14, 15, 6	efgrelexlema 19690	. . . . . . . . 9 ⊢ (𝑔𝐿ℎ ↔ ∃𝑟 ∈ (◡𝑆 “ {𝑔})∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑟‘0) = (𝑠‘0))
21		reeanv 3210	. . . . . . . . . 10 ⊢ (∃𝑎 ∈ (◡𝑆 “ {𝑓})∃𝑟 ∈ (◡𝑆 “ {𝑔})(∃𝑏 ∈ (◡𝑆 “ {𝑔})(𝑎‘0) = (𝑏‘0) ∧ ∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑟‘0) = (𝑠‘0)) ↔ (∃𝑎 ∈ (◡𝑆 “ {𝑓})∃𝑏 ∈ (◡𝑆 “ {𝑔})(𝑎‘0) = (𝑏‘0) ∧ ∃𝑟 ∈ (◡𝑆 “ {𝑔})∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑟‘0) = (𝑠‘0)))
22	1, 2, 3, 4, 14, 15	efgsfo 19680	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝑆:dom 𝑆–onto→𝑊
23		fofn 6756	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑆:dom 𝑆–onto→𝑊 → 𝑆 Fn dom 𝑆)
24	22, 23	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ 𝑆 Fn dom 𝑆
25		fniniseg 7014	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑆 Fn dom 𝑆 → (𝑟 ∈ (◡𝑆 “ {𝑔}) ↔ (𝑟 ∈ dom 𝑆 ∧ (𝑆‘𝑟) = 𝑔)))
26	24, 25	ax-mp 5	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑟 ∈ (◡𝑆 “ {𝑔}) ↔ (𝑟 ∈ dom 𝑆 ∧ (𝑆‘𝑟) = 𝑔))
27		fniniseg 7014	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑆 Fn dom 𝑆 → (𝑏 ∈ (◡𝑆 “ {𝑔}) ↔ (𝑏 ∈ dom 𝑆 ∧ (𝑆‘𝑏) = 𝑔)))
28	24, 27	ax-mp 5	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 ∈ (◡𝑆 “ {𝑔}) ↔ (𝑏 ∈ dom 𝑆 ∧ (𝑆‘𝑏) = 𝑔))
29		eqtr3 2759	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑆‘𝑟) = 𝑔 ∧ (𝑆‘𝑏) = 𝑔) → (𝑆‘𝑟) = (𝑆‘𝑏))
30	1, 2, 3, 4, 14, 15	efgred 19689	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑟 ∈ dom 𝑆 ∧ 𝑏 ∈ dom 𝑆 ∧ (𝑆‘𝑟) = (𝑆‘𝑏)) → (𝑟‘0) = (𝑏‘0))
31	30	eqcomd 2743	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑟 ∈ dom 𝑆 ∧ 𝑏 ∈ dom 𝑆 ∧ (𝑆‘𝑟) = (𝑆‘𝑏)) → (𝑏‘0) = (𝑟‘0))
32	31	3expa 1119	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑟 ∈ dom 𝑆 ∧ 𝑏 ∈ dom 𝑆) ∧ (𝑆‘𝑟) = (𝑆‘𝑏)) → (𝑏‘0) = (𝑟‘0))
33	29, 32	sylan2 594	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑟 ∈ dom 𝑆 ∧ 𝑏 ∈ dom 𝑆) ∧ ((𝑆‘𝑟) = 𝑔 ∧ (𝑆‘𝑏) = 𝑔)) → (𝑏‘0) = (𝑟‘0))
34	33	an4s 661	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑟 ∈ dom 𝑆 ∧ (𝑆‘𝑟) = 𝑔) ∧ (𝑏 ∈ dom 𝑆 ∧ (𝑆‘𝑏) = 𝑔)) → (𝑏‘0) = (𝑟‘0))
35	26, 28, 34	syl2anb 599	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑟 ∈ (◡𝑆 “ {𝑔}) ∧ 𝑏 ∈ (◡𝑆 “ {𝑔})) → (𝑏‘0) = (𝑟‘0))
36		eqeq2 2749	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑟‘0) = (𝑠‘0) → ((𝑏‘0) = (𝑟‘0) ↔ (𝑏‘0) = (𝑠‘0)))
37	35, 36	syl5ibcom 245	. . . . . . . . . . . . . . . 16 ⊢ ((𝑟 ∈ (◡𝑆 “ {𝑔}) ∧ 𝑏 ∈ (◡𝑆 “ {𝑔})) → ((𝑟‘0) = (𝑠‘0) → (𝑏‘0) = (𝑠‘0)))
38	37	reximdv 3153	. . . . . . . . . . . . . . 15 ⊢ ((𝑟 ∈ (◡𝑆 “ {𝑔}) ∧ 𝑏 ∈ (◡𝑆 “ {𝑔})) → (∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑟‘0) = (𝑠‘0) → ∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑏‘0) = (𝑠‘0)))
39		eqeq1 2741	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑎‘0) = (𝑏‘0) → ((𝑎‘0) = (𝑠‘0) ↔ (𝑏‘0) = (𝑠‘0)))
40	39	rexbidv 3162	. . . . . . . . . . . . . . . 16 ⊢ ((𝑎‘0) = (𝑏‘0) → (∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑎‘0) = (𝑠‘0) ↔ ∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑏‘0) = (𝑠‘0)))
41	40	imbi2d 340	. . . . . . . . . . . . . . 15 ⊢ ((𝑎‘0) = (𝑏‘0) → ((∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑟‘0) = (𝑠‘0) → ∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑎‘0) = (𝑠‘0)) ↔ (∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑟‘0) = (𝑠‘0) → ∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑏‘0) = (𝑠‘0))))
42	38, 41	syl5ibrcom 247	. . . . . . . . . . . . . 14 ⊢ ((𝑟 ∈ (◡𝑆 “ {𝑔}) ∧ 𝑏 ∈ (◡𝑆 “ {𝑔})) → ((𝑎‘0) = (𝑏‘0) → (∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑟‘0) = (𝑠‘0) → ∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑎‘0) = (𝑠‘0))))
43	42	rexlimdva 3139	. . . . . . . . . . . . 13 ⊢ (𝑟 ∈ (◡𝑆 “ {𝑔}) → (∃𝑏 ∈ (◡𝑆 “ {𝑔})(𝑎‘0) = (𝑏‘0) → (∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑟‘0) = (𝑠‘0) → ∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑎‘0) = (𝑠‘0))))
44	43	impd 410	. . . . . . . . . . . 12 ⊢ (𝑟 ∈ (◡𝑆 “ {𝑔}) → ((∃𝑏 ∈ (◡𝑆 “ {𝑔})(𝑎‘0) = (𝑏‘0) ∧ ∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑟‘0) = (𝑠‘0)) → ∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑎‘0) = (𝑠‘0)))
45	44	rexlimiv 3132	. . . . . . . . . . 11 ⊢ (∃𝑟 ∈ (◡𝑆 “ {𝑔})(∃𝑏 ∈ (◡𝑆 “ {𝑔})(𝑎‘0) = (𝑏‘0) ∧ ∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑟‘0) = (𝑠‘0)) → ∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑎‘0) = (𝑠‘0))
46	45	reximi 3076	. . . . . . . . . 10 ⊢ (∃𝑎 ∈ (◡𝑆 “ {𝑓})∃𝑟 ∈ (◡𝑆 “ {𝑔})(∃𝑏 ∈ (◡𝑆 “ {𝑔})(𝑎‘0) = (𝑏‘0) ∧ ∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑟‘0) = (𝑠‘0)) → ∃𝑎 ∈ (◡𝑆 “ {𝑓})∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑎‘0) = (𝑠‘0))
47	21, 46	sylbir 235	. . . . . . . . 9 ⊢ ((∃𝑎 ∈ (◡𝑆 “ {𝑓})∃𝑏 ∈ (◡𝑆 “ {𝑔})(𝑎‘0) = (𝑏‘0) ∧ ∃𝑟 ∈ (◡𝑆 “ {𝑔})∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑟‘0) = (𝑠‘0)) → ∃𝑎 ∈ (◡𝑆 “ {𝑓})∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑎‘0) = (𝑠‘0))
48	16, 20, 47	syl2anb 599	. . . . . . . 8 ⊢ ((𝑓𝐿𝑔 ∧ 𝑔𝐿ℎ) → ∃𝑎 ∈ (◡𝑆 “ {𝑓})∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑎‘0) = (𝑠‘0))
49	1, 2, 3, 4, 14, 15, 6	efgrelexlema 19690	. . . . . . . 8 ⊢ (𝑓𝐿ℎ ↔ ∃𝑎 ∈ (◡𝑆 “ {𝑓})∃𝑠 ∈ (◡𝑆 “ {ℎ})(𝑎‘0) = (𝑠‘0))
50	48, 49	sylibr 234	. . . . . . 7 ⊢ ((𝑓𝐿𝑔 ∧ 𝑔𝐿ℎ) → 𝑓𝐿ℎ)
51	50	adantl 481	. . . . . 6 ⊢ ((⊤ ∧ (𝑓𝐿𝑔 ∧ 𝑔𝐿ℎ)) → 𝑓𝐿ℎ)
52		eqid 2737	. . . . . . . . . . . 12 ⊢ (𝑎‘0) = (𝑎‘0)
53		fveq1 6841	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝑎 → (𝑏‘0) = (𝑎‘0))
54	53	rspceeqv 3601	. . . . . . . . . . . 12 ⊢ ((𝑎 ∈ (◡𝑆 “ {𝑓}) ∧ (𝑎‘0) = (𝑎‘0)) → ∃𝑏 ∈ (◡𝑆 “ {𝑓})(𝑎‘0) = (𝑏‘0))
55	52, 54	mpan2 692	. . . . . . . . . . 11 ⊢ (𝑎 ∈ (◡𝑆 “ {𝑓}) → ∃𝑏 ∈ (◡𝑆 “ {𝑓})(𝑎‘0) = (𝑏‘0))
56	55	pm4.71i 559	. . . . . . . . . 10 ⊢ (𝑎 ∈ (◡𝑆 “ {𝑓}) ↔ (𝑎 ∈ (◡𝑆 “ {𝑓}) ∧ ∃𝑏 ∈ (◡𝑆 “ {𝑓})(𝑎‘0) = (𝑏‘0)))
57		fniniseg 7014	. . . . . . . . . . 11 ⊢ (𝑆 Fn dom 𝑆 → (𝑎 ∈ (◡𝑆 “ {𝑓}) ↔ (𝑎 ∈ dom 𝑆 ∧ (𝑆‘𝑎) = 𝑓)))
58	24, 57	ax-mp 5	. . . . . . . . . 10 ⊢ (𝑎 ∈ (◡𝑆 “ {𝑓}) ↔ (𝑎 ∈ dom 𝑆 ∧ (𝑆‘𝑎) = 𝑓))
59	56, 58	bitr3i 277	. . . . . . . . 9 ⊢ ((𝑎 ∈ (◡𝑆 “ {𝑓}) ∧ ∃𝑏 ∈ (◡𝑆 “ {𝑓})(𝑎‘0) = (𝑏‘0)) ↔ (𝑎 ∈ dom 𝑆 ∧ (𝑆‘𝑎) = 𝑓))
60	59	rexbii2 3081	. . . . . . . 8 ⊢ (∃𝑎 ∈ (◡𝑆 “ {𝑓})∃𝑏 ∈ (◡𝑆 “ {𝑓})(𝑎‘0) = (𝑏‘0) ↔ ∃𝑎 ∈ dom 𝑆(𝑆‘𝑎) = 𝑓)
61	1, 2, 3, 4, 14, 15, 6	efgrelexlema 19690	. . . . . . . 8 ⊢ (𝑓𝐿𝑓 ↔ ∃𝑎 ∈ (◡𝑆 “ {𝑓})∃𝑏 ∈ (◡𝑆 “ {𝑓})(𝑎‘0) = (𝑏‘0))
62		forn 6757	. . . . . . . . . . 11 ⊢ (𝑆:dom 𝑆–onto→𝑊 → ran 𝑆 = 𝑊)
63	22, 62	ax-mp 5	. . . . . . . . . 10 ⊢ ran 𝑆 = 𝑊
64	63	eleq2i 2829	. . . . . . . . 9 ⊢ (𝑓 ∈ ran 𝑆 ↔ 𝑓 ∈ 𝑊)
65		fvelrnb 6902	. . . . . . . . . 10 ⊢ (𝑆 Fn dom 𝑆 → (𝑓 ∈ ran 𝑆 ↔ ∃𝑎 ∈ dom 𝑆(𝑆‘𝑎) = 𝑓))
66	24, 65	ax-mp 5	. . . . . . . . 9 ⊢ (𝑓 ∈ ran 𝑆 ↔ ∃𝑎 ∈ dom 𝑆(𝑆‘𝑎) = 𝑓)
67	64, 66	bitr3i 277	. . . . . . . 8 ⊢ (𝑓 ∈ 𝑊 ↔ ∃𝑎 ∈ dom 𝑆(𝑆‘𝑎) = 𝑓)
68	60, 61, 67	3bitr4ri 304	. . . . . . 7 ⊢ (𝑓 ∈ 𝑊 ↔ 𝑓𝐿𝑓)
69	68	a1i 11	. . . . . 6 ⊢ (⊤ → (𝑓 ∈ 𝑊 ↔ 𝑓𝐿𝑓))
70	8, 19, 51, 69	iserd 8672	. . . . 5 ⊢ (⊤ → 𝐿 Er 𝑊)
71	70	mptru 1549	. . . 4 ⊢ 𝐿 Er 𝑊
72		simpl 482	. . . . . . . . . . 11 ⊢ ((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) → 𝑎 ∈ 𝑊)
73		foelrn 7061	. . . . . . . . . . 11 ⊢ ((𝑆:dom 𝑆–onto→𝑊 ∧ 𝑎 ∈ 𝑊) → ∃𝑟 ∈ dom 𝑆 𝑎 = (𝑆‘𝑟))
74	22, 72, 73	sylancr 588	. . . . . . . . . 10 ⊢ ((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) → ∃𝑟 ∈ dom 𝑆 𝑎 = (𝑆‘𝑟))
75		simprl 771	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → 𝑟 ∈ dom 𝑆)
76		simprr 773	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → 𝑎 = (𝑆‘𝑟))
77	76	eqcomd 2743	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → (𝑆‘𝑟) = 𝑎)
78		fniniseg 7014	. . . . . . . . . . . 12 ⊢ (𝑆 Fn dom 𝑆 → (𝑟 ∈ (◡𝑆 “ {𝑎}) ↔ (𝑟 ∈ dom 𝑆 ∧ (𝑆‘𝑟) = 𝑎)))
79	24, 78	ax-mp 5	. . . . . . . . . . 11 ⊢ (𝑟 ∈ (◡𝑆 “ {𝑎}) ↔ (𝑟 ∈ dom 𝑆 ∧ (𝑆‘𝑟) = 𝑎))
80	75, 77, 79	sylanbrc 584	. . . . . . . . . 10 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → 𝑟 ∈ (◡𝑆 “ {𝑎}))
81		simplr 769	. . . . . . . . . . . . . 14 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → 𝑏 ∈ ran (𝑇‘𝑎))
82	76	fveq2d 6846	. . . . . . . . . . . . . . 15 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → (𝑇‘𝑎) = (𝑇‘(𝑆‘𝑟)))
83	82	rneqd 5895	. . . . . . . . . . . . . 14 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → ran (𝑇‘𝑎) = ran (𝑇‘(𝑆‘𝑟)))
84	81, 83	eleqtrd 2839	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → 𝑏 ∈ ran (𝑇‘(𝑆‘𝑟)))
85	1, 2, 3, 4, 14, 15	efgsp1 19678	. . . . . . . . . . . . 13 ⊢ ((𝑟 ∈ dom 𝑆 ∧ 𝑏 ∈ ran (𝑇‘(𝑆‘𝑟))) → (𝑟 ++ ⟨“𝑏”⟩) ∈ dom 𝑆)
86	75, 84, 85	syl2anc 585	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → (𝑟 ++ ⟨“𝑏”⟩) ∈ dom 𝑆)
87	1, 2, 3, 4, 14, 15	efgsdm 19671	. . . . . . . . . . . . . . . 16 ⊢ (𝑟 ∈ dom 𝑆 ↔ (𝑟 ∈ (Word 𝑊 ∖ {∅}) ∧ (𝑟‘0) ∈ 𝐷 ∧ ∀𝑖 ∈ (1..^(♯‘𝑟))(𝑟‘𝑖) ∈ ran (𝑇‘(𝑟‘(𝑖 − 1)))))
88	87	simp1bi 1146	. . . . . . . . . . . . . . 15 ⊢ (𝑟 ∈ dom 𝑆 → 𝑟 ∈ (Word 𝑊 ∖ {∅}))
89	88	ad2antrl 729	. . . . . . . . . . . . . 14 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → 𝑟 ∈ (Word 𝑊 ∖ {∅}))
90	89	eldifad 3915	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → 𝑟 ∈ Word 𝑊)
91	1, 2, 3, 4	efgtf 19663	. . . . . . . . . . . . . . . . 17 ⊢ (𝑎 ∈ 𝑊 → ((𝑇‘𝑎) = (𝑓 ∈ (0...(♯‘𝑎)), 𝑔 ∈ (𝐼 × 2o) ↦ (𝑎 splice ⟨𝑓, 𝑓, ⟨“𝑔(𝑀‘𝑔)”⟩⟩)) ∧ (𝑇‘𝑎):((0...(♯‘𝑎)) × (𝐼 × 2o))⟶𝑊))
92	91	simprd 495	. . . . . . . . . . . . . . . 16 ⊢ (𝑎 ∈ 𝑊 → (𝑇‘𝑎):((0...(♯‘𝑎)) × (𝐼 × 2o))⟶𝑊)
93	92	frnd 6678	. . . . . . . . . . . . . . 15 ⊢ (𝑎 ∈ 𝑊 → ran (𝑇‘𝑎) ⊆ 𝑊)
94	93	sselda 3935	. . . . . . . . . . . . . 14 ⊢ ((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) → 𝑏 ∈ 𝑊)
95	94	adantr 480	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → 𝑏 ∈ 𝑊)
96	1, 2, 3, 4, 14, 15	efgsval2 19674	. . . . . . . . . . . . 13 ⊢ ((𝑟 ∈ Word 𝑊 ∧ 𝑏 ∈ 𝑊 ∧ (𝑟 ++ ⟨“𝑏”⟩) ∈ dom 𝑆) → (𝑆‘(𝑟 ++ ⟨“𝑏”⟩)) = 𝑏)
97	90, 95, 86, 96	syl3anc 1374	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → (𝑆‘(𝑟 ++ ⟨“𝑏”⟩)) = 𝑏)
98		fniniseg 7014	. . . . . . . . . . . . 13 ⊢ (𝑆 Fn dom 𝑆 → ((𝑟 ++ ⟨“𝑏”⟩) ∈ (◡𝑆 “ {𝑏}) ↔ ((𝑟 ++ ⟨“𝑏”⟩) ∈ dom 𝑆 ∧ (𝑆‘(𝑟 ++ ⟨“𝑏”⟩)) = 𝑏)))
99	24, 98	ax-mp 5	. . . . . . . . . . . 12 ⊢ ((𝑟 ++ ⟨“𝑏”⟩) ∈ (◡𝑆 “ {𝑏}) ↔ ((𝑟 ++ ⟨“𝑏”⟩) ∈ dom 𝑆 ∧ (𝑆‘(𝑟 ++ ⟨“𝑏”⟩)) = 𝑏))
100	86, 97, 99	sylanbrc 584	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → (𝑟 ++ ⟨“𝑏”⟩) ∈ (◡𝑆 “ {𝑏}))
101	95	s1cld 14539	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → ⟨“𝑏”⟩ ∈ Word 𝑊)
102		eldifsn 4744	. . . . . . . . . . . . . . . 16 ⊢ (𝑟 ∈ (Word 𝑊 ∖ {∅}) ↔ (𝑟 ∈ Word 𝑊 ∧ 𝑟 ≠ ∅))
103		lennncl 14469	. . . . . . . . . . . . . . . 16 ⊢ ((𝑟 ∈ Word 𝑊 ∧ 𝑟 ≠ ∅) → (♯‘𝑟) ∈ ℕ)
104	102, 103	sylbi 217	. . . . . . . . . . . . . . 15 ⊢ (𝑟 ∈ (Word 𝑊 ∖ {∅}) → (♯‘𝑟) ∈ ℕ)
105	89, 104	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → (♯‘𝑟) ∈ ℕ)
106		lbfzo0 13627	. . . . . . . . . . . . . 14 ⊢ (0 ∈ (0..^(♯‘𝑟)) ↔ (♯‘𝑟) ∈ ℕ)
107	105, 106	sylibr 234	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → 0 ∈ (0..^(♯‘𝑟)))
108		ccatval1 14512	. . . . . . . . . . . . 13 ⊢ ((𝑟 ∈ Word 𝑊 ∧ ⟨“𝑏”⟩ ∈ Word 𝑊 ∧ 0 ∈ (0..^(♯‘𝑟))) → ((𝑟 ++ ⟨“𝑏”⟩)‘0) = (𝑟‘0))
109	90, 101, 107, 108	syl3anc 1374	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → ((𝑟 ++ ⟨“𝑏”⟩)‘0) = (𝑟‘0))
110	109	eqcomd 2743	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → (𝑟‘0) = ((𝑟 ++ ⟨“𝑏”⟩)‘0))
111		fveq1 6841	. . . . . . . . . . . 12 ⊢ (𝑠 = (𝑟 ++ ⟨“𝑏”⟩) → (𝑠‘0) = ((𝑟 ++ ⟨“𝑏”⟩)‘0))
112	111	rspceeqv 3601	. . . . . . . . . . 11 ⊢ (((𝑟 ++ ⟨“𝑏”⟩) ∈ (◡𝑆 “ {𝑏}) ∧ (𝑟‘0) = ((𝑟 ++ ⟨“𝑏”⟩)‘0)) → ∃𝑠 ∈ (◡𝑆 “ {𝑏})(𝑟‘0) = (𝑠‘0))
113	100, 110, 112	syl2anc 585	. . . . . . . . . 10 ⊢ (((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) ∧ (𝑟 ∈ dom 𝑆 ∧ 𝑎 = (𝑆‘𝑟))) → ∃𝑠 ∈ (◡𝑆 “ {𝑏})(𝑟‘0) = (𝑠‘0))
114	74, 80, 113	reximssdv 3156	. . . . . . . . 9 ⊢ ((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) → ∃𝑟 ∈ (◡𝑆 “ {𝑎})∃𝑠 ∈ (◡𝑆 “ {𝑏})(𝑟‘0) = (𝑠‘0))
115	1, 2, 3, 4, 14, 15, 6	efgrelexlema 19690	. . . . . . . . 9 ⊢ (𝑎𝐿𝑏 ↔ ∃𝑟 ∈ (◡𝑆 “ {𝑎})∃𝑠 ∈ (◡𝑆 “ {𝑏})(𝑟‘0) = (𝑠‘0))
116	114, 115	sylibr 234	. . . . . . . 8 ⊢ ((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) → 𝑎𝐿𝑏)
117		vex 3446	. . . . . . . . 9 ⊢ 𝑏 ∈ V
118		vex 3446	. . . . . . . . 9 ⊢ 𝑎 ∈ V
119	117, 118	elec 8692	. . . . . . . 8 ⊢ (𝑏 ∈ [𝑎]𝐿 ↔ 𝑎𝐿𝑏)
120	116, 119	sylibr 234	. . . . . . 7 ⊢ ((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ ran (𝑇‘𝑎)) → 𝑏 ∈ [𝑎]𝐿)
121	120	ex 412	. . . . . 6 ⊢ (𝑎 ∈ 𝑊 → (𝑏 ∈ ran (𝑇‘𝑎) → 𝑏 ∈ [𝑎]𝐿))
122	121	ssrdv 3941	. . . . 5 ⊢ (𝑎 ∈ 𝑊 → ran (𝑇‘𝑎) ⊆ [𝑎]𝐿)
123	122	rgen 3054	. . . 4 ⊢ ∀𝑎 ∈ 𝑊 ran (𝑇‘𝑎) ⊆ [𝑎]𝐿
124	1	fvexi 6856	. . . . . 6 ⊢ 𝑊 ∈ V
125		erex 8670	. . . . . 6 ⊢ (𝐿 Er 𝑊 → (𝑊 ∈ V → 𝐿 ∈ V))
126	71, 124, 125	mp2 9	. . . . 5 ⊢ 𝐿 ∈ V
127		ereq1 8653	. . . . . 6 ⊢ (𝑟 = 𝐿 → (𝑟 Er 𝑊 ↔ 𝐿 Er 𝑊))
128		eceq2 8687	. . . . . . . 8 ⊢ (𝑟 = 𝐿 → [𝑎]𝑟 = [𝑎]𝐿)
129	128	sseq2d 3968	. . . . . . 7 ⊢ (𝑟 = 𝐿 → (ran (𝑇‘𝑎) ⊆ [𝑎]𝑟 ↔ ran (𝑇‘𝑎) ⊆ [𝑎]𝐿))
130	129	ralbidv 3161	. . . . . 6 ⊢ (𝑟 = 𝐿 → (∀𝑎 ∈ 𝑊 ran (𝑇‘𝑎) ⊆ [𝑎]𝑟 ↔ ∀𝑎 ∈ 𝑊 ran (𝑇‘𝑎) ⊆ [𝑎]𝐿))
131	127, 130	anbi12d 633	. . . . 5 ⊢ (𝑟 = 𝐿 → ((𝑟 Er 𝑊 ∧ ∀𝑎 ∈ 𝑊 ran (𝑇‘𝑎) ⊆ [𝑎]𝑟) ↔ (𝐿 Er 𝑊 ∧ ∀𝑎 ∈ 𝑊 ran (𝑇‘𝑎) ⊆ [𝑎]𝐿)))
132	126, 131	elab 3636	. . . 4 ⊢ (𝐿 ∈ {𝑟 ∣ (𝑟 Er 𝑊 ∧ ∀𝑎 ∈ 𝑊 ran (𝑇‘𝑎) ⊆ [𝑎]𝑟)} ↔ (𝐿 Er 𝑊 ∧ ∀𝑎 ∈ 𝑊 ran (𝑇‘𝑎) ⊆ [𝑎]𝐿))
133	71, 123, 132	mpbir2an 712	. . 3 ⊢ 𝐿 ∈ {𝑟 ∣ (𝑟 Er 𝑊 ∧ ∀𝑎 ∈ 𝑊 ran (𝑇‘𝑎) ⊆ [𝑎]𝑟)}
134		intss1 4920	. . 3 ⊢ (𝐿 ∈ {𝑟 ∣ (𝑟 Er 𝑊 ∧ ∀𝑎 ∈ 𝑊 ran (𝑇‘𝑎) ⊆ [𝑎]𝑟)} → ∩ {𝑟 ∣ (𝑟 Er 𝑊 ∧ ∀𝑎 ∈ 𝑊 ran (𝑇‘𝑎) ⊆ [𝑎]𝑟)} ⊆ 𝐿)
135	133, 134	ax-mp 5	. 2 ⊢ ∩ {𝑟 ∣ (𝑟 Er 𝑊 ∧ ∀𝑎 ∈ 𝑊 ran (𝑇‘𝑎) ⊆ [𝑎]𝑟)} ⊆ 𝐿
136	5, 135	eqsstri 3982	1 ⊢ ∼ ⊆ 𝐿

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542  ⊤wtru 1543   ∈ wcel 2114  {cab 2715   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  {crab 3401  Vcvv 3442   ∖ cdif 3900   ⊆ wss 3903  ∅c0 4287  {csn 4582  ⟨cop 4588  ⟨cotp 4590  ∩ cint 4904  ∪ ciun 4948   class class class wbr 5100  {copab 5162   ↦ cmpt 5181   I cid 5526   × cxp 5630  ^◡ccnv 5631  dom cdm 5632  ran crn 5633   “ cima 5635  Rel wrel 5637   Fn wfn 6495  ⟶wf 6496  –onto→wfo 6498  ‘cfv 6500  (class class class)co 7368   ∈ cmpo 7370  1_oc1o 8400  2_oc2o 8401   Er wer 8642  [cec 8643  0cc0 11038  1c1 11039   − cmin 11376  ℕcn 12157  ...cfz 13435  ..^cfzo 13582  ♯chash 14265  Word cword 14448   ++ cconcat 14505  ⟨“cs1 14531   splice csplice 14684  ⟨“cs2 14776   ~_FG cefg 19647

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-ot 4591  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-1o 8407  df-2o 8408  df-er 8645  df-ec 8647  df-map 8777  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-card 9863  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-nn 12158  df-2 12220  df-n0 12414  df-xnn0 12487  df-z 12501  df-uz 12764  df-rp 12918  df-fz 13436  df-fzo 13583  df-hash 14266  df-word 14449  df-concat 14506  df-s1 14532  df-substr 14577  df-pfx 14607  df-splice 14685  df-s2 14783  df-efg 19650

This theorem is referenced by:  efgrelex  19692