Theorem efgrelexlema 18875

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
efgrelexlema	⊢ (𝐴𝐿𝐵 ↔ ∃𝑎 ∈ (◡𝑆 “ {𝐴})∃𝑏 ∈ (◡𝑆 “ {𝐵})(𝑎‘0) = (𝑏‘0))

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

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

Proof of Theorem efgrelexlema

Step	Hyp	Ref	Expression
1		efgrelexlem.1	. . 3 ⊢ 𝐿 = {⟨𝑖, 𝑗⟩ ∣ ∃𝑐 ∈ (◡𝑆 “ {𝑖})∃𝑑 ∈ (◡𝑆 “ {𝑗})(𝑐‘0) = (𝑑‘0)}
2	1	bropaex12 5642	. 2 ⊢ (𝐴𝐿𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))
3		n0i 4299	. . . . . 6 ⊢ (𝑎 ∈ (◡𝑆 “ {𝐴}) → ¬ (◡𝑆 “ {𝐴}) = ∅)
4		snprc 4653	. . . . . . . 8 ⊢ (¬ 𝐴 ∈ V ↔ {𝐴} = ∅)
5		imaeq2 5925	. . . . . . . 8 ⊢ ({𝐴} = ∅ → (◡𝑆 “ {𝐴}) = (◡𝑆 “ ∅))
6	4, 5	sylbi 219	. . . . . . 7 ⊢ (¬ 𝐴 ∈ V → (◡𝑆 “ {𝐴}) = (◡𝑆 “ ∅))
7		ima0 5945	. . . . . . 7 ⊢ (◡𝑆 “ ∅) = ∅
8	6, 7	syl6eq 2872	. . . . . 6 ⊢ (¬ 𝐴 ∈ V → (◡𝑆 “ {𝐴}) = ∅)
9	3, 8	nsyl2 143	. . . . 5 ⊢ (𝑎 ∈ (◡𝑆 “ {𝐴}) → 𝐴 ∈ V)
10		n0i 4299	. . . . . 6 ⊢ (𝑏 ∈ (◡𝑆 “ {𝐵}) → ¬ (◡𝑆 “ {𝐵}) = ∅)
11		snprc 4653	. . . . . . . 8 ⊢ (¬ 𝐵 ∈ V ↔ {𝐵} = ∅)
12		imaeq2 5925	. . . . . . . 8 ⊢ ({𝐵} = ∅ → (◡𝑆 “ {𝐵}) = (◡𝑆 “ ∅))
13	11, 12	sylbi 219	. . . . . . 7 ⊢ (¬ 𝐵 ∈ V → (◡𝑆 “ {𝐵}) = (◡𝑆 “ ∅))
14	13, 7	syl6eq 2872	. . . . . 6 ⊢ (¬ 𝐵 ∈ V → (◡𝑆 “ {𝐵}) = ∅)
15	10, 14	nsyl2 143	. . . . 5 ⊢ (𝑏 ∈ (◡𝑆 “ {𝐵}) → 𝐵 ∈ V)
16	9, 15	anim12i 614	. . . 4 ⊢ ((𝑎 ∈ (◡𝑆 “ {𝐴}) ∧ 𝑏 ∈ (◡𝑆 “ {𝐵})) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
17	16	a1d 25	. . 3 ⊢ ((𝑎 ∈ (◡𝑆 “ {𝐴}) ∧ 𝑏 ∈ (◡𝑆 “ {𝐵})) → ((𝑎‘0) = (𝑏‘0) → (𝐴 ∈ V ∧ 𝐵 ∈ V)))
18	17	rexlimivv 3292	. 2 ⊢ (∃𝑎 ∈ (◡𝑆 “ {𝐴})∃𝑏 ∈ (◡𝑆 “ {𝐵})(𝑎‘0) = (𝑏‘0) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
19		fveq1 6669	. . . . . 6 ⊢ (𝑐 = 𝑎 → (𝑐‘0) = (𝑎‘0))
20	19	eqeq1d 2823	. . . . 5 ⊢ (𝑐 = 𝑎 → ((𝑐‘0) = (𝑑‘0) ↔ (𝑎‘0) = (𝑑‘0)))
21		fveq1 6669	. . . . . 6 ⊢ (𝑑 = 𝑏 → (𝑑‘0) = (𝑏‘0))
22	21	eqeq2d 2832	. . . . 5 ⊢ (𝑑 = 𝑏 → ((𝑎‘0) = (𝑑‘0) ↔ (𝑎‘0) = (𝑏‘0)))
23	20, 22	cbvrex2vw 3462	. . . 4 ⊢ (∃𝑐 ∈ (◡𝑆 “ {𝑖})∃𝑑 ∈ (◡𝑆 “ {𝑗})(𝑐‘0) = (𝑑‘0) ↔ ∃𝑎 ∈ (◡𝑆 “ {𝑖})∃𝑏 ∈ (◡𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0))
24		sneq 4577	. . . . . 6 ⊢ (𝑖 = 𝐴 → {𝑖} = {𝐴})
25	24	imaeq2d 5929	. . . . 5 ⊢ (𝑖 = 𝐴 → (◡𝑆 “ {𝑖}) = (◡𝑆 “ {𝐴}))
26	25	rexeqdv 3416	. . . 4 ⊢ (𝑖 = 𝐴 → (∃𝑎 ∈ (◡𝑆 “ {𝑖})∃𝑏 ∈ (◡𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0) ↔ ∃𝑎 ∈ (◡𝑆 “ {𝐴})∃𝑏 ∈ (◡𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0)))
27	23, 26	syl5bb 285	. . 3 ⊢ (𝑖 = 𝐴 → (∃𝑐 ∈ (◡𝑆 “ {𝑖})∃𝑑 ∈ (◡𝑆 “ {𝑗})(𝑐‘0) = (𝑑‘0) ↔ ∃𝑎 ∈ (◡𝑆 “ {𝐴})∃𝑏 ∈ (◡𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0)))
28		sneq 4577	. . . . . 6 ⊢ (𝑗 = 𝐵 → {𝑗} = {𝐵})
29	28	imaeq2d 5929	. . . . 5 ⊢ (𝑗 = 𝐵 → (◡𝑆 “ {𝑗}) = (◡𝑆 “ {𝐵}))
30	29	rexeqdv 3416	. . . 4 ⊢ (𝑗 = 𝐵 → (∃𝑏 ∈ (◡𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0) ↔ ∃𝑏 ∈ (◡𝑆 “ {𝐵})(𝑎‘0) = (𝑏‘0)))
31	30	rexbidv 3297	. . 3 ⊢ (𝑗 = 𝐵 → (∃𝑎 ∈ (◡𝑆 “ {𝐴})∃𝑏 ∈ (◡𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0) ↔ ∃𝑎 ∈ (◡𝑆 “ {𝐴})∃𝑏 ∈ (◡𝑆 “ {𝐵})(𝑎‘0) = (𝑏‘0)))
32	27, 31, 1	brabg 5426	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝐿𝐵 ↔ ∃𝑎 ∈ (◡𝑆 “ {𝐴})∃𝑏 ∈ (◡𝑆 “ {𝐵})(𝑎‘0) = (𝑏‘0)))
33	2, 18, 32	pm5.21nii 382	1 ⊢ (𝐴𝐿𝐵 ↔ ∃𝑎 ∈ (◡𝑆 “ {𝐴})∃𝑏 ∈ (◡𝑆 “ {𝐵})(𝑎‘0) = (𝑏‘0))

Syntax hints:  ¬ wn 3   ↔ wb 208   ∧ wa 398   = wceq 1537   ∈ wcel 2114  ∀wral 3138  ∃wrex 3139  {crab 3142  Vcvv 3494   ∖ cdif 3933  ∅c0 4291  {csn 4567  ⟨cop 4573  ⟨cotp 4575  ∪ ciun 4919   class class class wbr 5066  {copab 5128   ↦ cmpt 5146   I cid 5459   × cxp 5553  ^◡ccnv 5554  ran crn 5556   “ cima 5558  ‘cfv 6355  (class class class)co 7156   ∈ cmpo 7158  1_oc1o 8095  2_oc2o 8096  0cc0 10537  1c1 10538   − cmin 10870  ...cfz 12893  ..^cfzo 13034  ♯chash 13691  Word cword 13862   splice csplice 14111  ⟨“cs2 14203   ~_FG cefg 18832

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 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-xp 5561  df-cnv 5563  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fv 6363

This theorem is referenced by:  efgrelexlemb  18876  efgrelex  18877