Theorem efgrelexlema 17985

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 (𝐼 × 2𝑜))
efgval.r	⊢ ∼ = ( ~FG ‘𝐼)
efgval2.m	⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2𝑜 ↦ ⟨𝑦, (1𝑜 ∖ 𝑧)⟩)
efgval2.t	⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(#‘𝑣)), 𝑤 ∈ (𝐼 × 2𝑜) ↦ (𝑣 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 5115	. 2 ⊢ (𝐴𝐿𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))
3		n0i 3879	. . . . . 6 ⊢ (𝑎 ∈ (◡𝑆 “ {𝐴}) → ¬ (◡𝑆 “ {𝐴}) = ∅)
4		snprc 4197	. . . . . . . 8 ⊢ (¬ 𝐴 ∈ V ↔ {𝐴} = ∅)
5		imaeq2 5381	. . . . . . . 8 ⊢ ({𝐴} = ∅ → (◡𝑆 “ {𝐴}) = (◡𝑆 “ ∅))
6	4, 5	sylbi 206	. . . . . . 7 ⊢ (¬ 𝐴 ∈ V → (◡𝑆 “ {𝐴}) = (◡𝑆 “ ∅))
7		ima0 5400	. . . . . . 7 ⊢ (◡𝑆 “ ∅) = ∅
8	6, 7	syl6eq 2660	. . . . . 6 ⊢ (¬ 𝐴 ∈ V → (◡𝑆 “ {𝐴}) = ∅)
9	3, 8	nsyl2 141	. . . . 5 ⊢ (𝑎 ∈ (◡𝑆 “ {𝐴}) → 𝐴 ∈ V)
10		n0i 3879	. . . . . 6 ⊢ (𝑏 ∈ (◡𝑆 “ {𝐵}) → ¬ (◡𝑆 “ {𝐵}) = ∅)
11		snprc 4197	. . . . . . . 8 ⊢ (¬ 𝐵 ∈ V ↔ {𝐵} = ∅)
12		imaeq2 5381	. . . . . . . 8 ⊢ ({𝐵} = ∅ → (◡𝑆 “ {𝐵}) = (◡𝑆 “ ∅))
13	11, 12	sylbi 206	. . . . . . 7 ⊢ (¬ 𝐵 ∈ V → (◡𝑆 “ {𝐵}) = (◡𝑆 “ ∅))
14	13, 7	syl6eq 2660	. . . . . 6 ⊢ (¬ 𝐵 ∈ V → (◡𝑆 “ {𝐵}) = ∅)
15	10, 14	nsyl2 141	. . . . 5 ⊢ (𝑏 ∈ (◡𝑆 “ {𝐵}) → 𝐵 ∈ V)
16	9, 15	anim12i 588	. . . 4 ⊢ ((𝑎 ∈ (◡𝑆 “ {𝐴}) ∧ 𝑏 ∈ (◡𝑆 “ {𝐵})) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
17	16	a1d 25	. . 3 ⊢ ((𝑎 ∈ (◡𝑆 “ {𝐴}) ∧ 𝑏 ∈ (◡𝑆 “ {𝐵})) → ((𝑎‘0) = (𝑏‘0) → (𝐴 ∈ V ∧ 𝐵 ∈ V)))
18	17	rexlimivv 3018	. 2 ⊢ (∃𝑎 ∈ (◡𝑆 “ {𝐴})∃𝑏 ∈ (◡𝑆 “ {𝐵})(𝑎‘0) = (𝑏‘0) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
19		fveq1 6102	. . . . . 6 ⊢ (𝑐 = 𝑎 → (𝑐‘0) = (𝑎‘0))
20	19	eqeq1d 2612	. . . . 5 ⊢ (𝑐 = 𝑎 → ((𝑐‘0) = (𝑑‘0) ↔ (𝑎‘0) = (𝑑‘0)))
21		fveq1 6102	. . . . . 6 ⊢ (𝑑 = 𝑏 → (𝑑‘0) = (𝑏‘0))
22	21	eqeq2d 2620	. . . . 5 ⊢ (𝑑 = 𝑏 → ((𝑎‘0) = (𝑑‘0) ↔ (𝑎‘0) = (𝑏‘0)))
23	20, 22	cbvrex2v 3156	. . . 4 ⊢ (∃𝑐 ∈ (◡𝑆 “ {𝑖})∃𝑑 ∈ (◡𝑆 “ {𝑗})(𝑐‘0) = (𝑑‘0) ↔ ∃𝑎 ∈ (◡𝑆 “ {𝑖})∃𝑏 ∈ (◡𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0))
24		sneq 4135	. . . . . 6 ⊢ (𝑖 = 𝐴 → {𝑖} = {𝐴})
25	24	imaeq2d 5385	. . . . 5 ⊢ (𝑖 = 𝐴 → (◡𝑆 “ {𝑖}) = (◡𝑆 “ {𝐴}))
26	25	rexeqdv 3122	. . . 4 ⊢ (𝑖 = 𝐴 → (∃𝑎 ∈ (◡𝑆 “ {𝑖})∃𝑏 ∈ (◡𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0) ↔ ∃𝑎 ∈ (◡𝑆 “ {𝐴})∃𝑏 ∈ (◡𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0)))
27	23, 26	syl5bb 271	. . 3 ⊢ (𝑖 = 𝐴 → (∃𝑐 ∈ (◡𝑆 “ {𝑖})∃𝑑 ∈ (◡𝑆 “ {𝑗})(𝑐‘0) = (𝑑‘0) ↔ ∃𝑎 ∈ (◡𝑆 “ {𝐴})∃𝑏 ∈ (◡𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0)))
28		sneq 4135	. . . . . 6 ⊢ (𝑗 = 𝐵 → {𝑗} = {𝐵})
29	28	imaeq2d 5385	. . . . 5 ⊢ (𝑗 = 𝐵 → (◡𝑆 “ {𝑗}) = (◡𝑆 “ {𝐵}))
30	29	rexeqdv 3122	. . . 4 ⊢ (𝑗 = 𝐵 → (∃𝑏 ∈ (◡𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0) ↔ ∃𝑏 ∈ (◡𝑆 “ {𝐵})(𝑎‘0) = (𝑏‘0)))
31	30	rexbidv 3034	. . 3 ⊢ (𝑗 = 𝐵 → (∃𝑎 ∈ (◡𝑆 “ {𝐴})∃𝑏 ∈ (◡𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0) ↔ ∃𝑎 ∈ (◡𝑆 “ {𝐴})∃𝑏 ∈ (◡𝑆 “ {𝐵})(𝑎‘0) = (𝑏‘0)))
32	27, 31, 1	brabg 4919	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝐿𝐵 ↔ ∃𝑎 ∈ (◡𝑆 “ {𝐴})∃𝑏 ∈ (◡𝑆 “ {𝐵})(𝑎‘0) = (𝑏‘0)))
33	2, 18, 32	pm5.21nii 367	1 ⊢ (𝐴𝐿𝐵 ↔ ∃𝑎 ∈ (◡𝑆 “ {𝐴})∃𝑏 ∈ (◡𝑆 “ {𝐵})(𝑎‘0) = (𝑏‘0))

Syntax hints:  ¬ wn 3   ↔ wb 195   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ∀wral 2896  ∃wrex 2897  {crab 2900  Vcvv 3173   ∖ cdif 3537  ∅c0 3874  {csn 4125  ⟨cop 4131  ⟨cotp 4133  ∪ ciun 4455   class class class wbr 4583  {copab 4642   ↦ cmpt 4643   I cid 4948   × cxp 5036  ^◡ccnv 5037  ran crn 5039   “ cima 5041  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551  1_𝑜c1o 7440  2_𝑜c2o 7441  0cc0 9815  1c1 9816   − cmin 10145  ...cfz 12197  ..^cfzo 12334  #chash 12979  Word cword 13146   splice csplice 13151  ⟨“cs2 13437   ~_FG cefg 17942

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-xp 5044  df-cnv 5046  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fv 5812

This theorem is referenced by:  efgrelexlemb  17986  efgrelex  17987