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

Theorem efgrelexlema 18871
 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
StepHypRef Expression
1 efgrelexlem.1 . . 3 𝐿 = {⟨𝑖, 𝑗⟩ ∣ ∃𝑐 ∈ (𝑆 “ {𝑖})∃𝑑 ∈ (𝑆 “ {𝑗})(𝑐‘0) = (𝑑‘0)}
21bropaex12 5629 . 2 (𝐴𝐿𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))
3 n0i 4281 . . . . . 6 (𝑎 ∈ (𝑆 “ {𝐴}) → ¬ (𝑆 “ {𝐴}) = ∅)
4 snprc 4637 . . . . . . . 8 𝐴 ∈ V ↔ {𝐴} = ∅)
5 imaeq2 5912 . . . . . . . 8 ({𝐴} = ∅ → (𝑆 “ {𝐴}) = (𝑆 “ ∅))
64, 5sylbi 220 . . . . . . 7 𝐴 ∈ V → (𝑆 “ {𝐴}) = (𝑆 “ ∅))
7 ima0 5932 . . . . . . 7 (𝑆 “ ∅) = ∅
86, 7syl6eq 2875 . . . . . 6 𝐴 ∈ V → (𝑆 “ {𝐴}) = ∅)
93, 8nsyl2 143 . . . . 5 (𝑎 ∈ (𝑆 “ {𝐴}) → 𝐴 ∈ V)
10 n0i 4281 . . . . . 6 (𝑏 ∈ (𝑆 “ {𝐵}) → ¬ (𝑆 “ {𝐵}) = ∅)
11 snprc 4637 . . . . . . . 8 𝐵 ∈ V ↔ {𝐵} = ∅)
12 imaeq2 5912 . . . . . . . 8 ({𝐵} = ∅ → (𝑆 “ {𝐵}) = (𝑆 “ ∅))
1311, 12sylbi 220 . . . . . . 7 𝐵 ∈ V → (𝑆 “ {𝐵}) = (𝑆 “ ∅))
1413, 7syl6eq 2875 . . . . . 6 𝐵 ∈ V → (𝑆 “ {𝐵}) = ∅)
1510, 14nsyl2 143 . . . . 5 (𝑏 ∈ (𝑆 “ {𝐵}) → 𝐵 ∈ V)
169, 15anim12i 615 . . . 4 ((𝑎 ∈ (𝑆 “ {𝐴}) ∧ 𝑏 ∈ (𝑆 “ {𝐵})) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
1716a1d 25 . . 3 ((𝑎 ∈ (𝑆 “ {𝐴}) ∧ 𝑏 ∈ (𝑆 “ {𝐵})) → ((𝑎‘0) = (𝑏‘0) → (𝐴 ∈ V ∧ 𝐵 ∈ V)))
1817rexlimivv 3285 . 2 (∃𝑎 ∈ (𝑆 “ {𝐴})∃𝑏 ∈ (𝑆 “ {𝐵})(𝑎‘0) = (𝑏‘0) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
19 fveq1 6657 . . . . . 6 (𝑐 = 𝑎 → (𝑐‘0) = (𝑎‘0))
2019eqeq1d 2826 . . . . 5 (𝑐 = 𝑎 → ((𝑐‘0) = (𝑑‘0) ↔ (𝑎‘0) = (𝑑‘0)))
21 fveq1 6657 . . . . . 6 (𝑑 = 𝑏 → (𝑑‘0) = (𝑏‘0))
2221eqeq2d 2835 . . . . 5 (𝑑 = 𝑏 → ((𝑎‘0) = (𝑑‘0) ↔ (𝑎‘0) = (𝑏‘0)))
2320, 22cbvrex2vw 3448 . . . 4 (∃𝑐 ∈ (𝑆 “ {𝑖})∃𝑑 ∈ (𝑆 “ {𝑗})(𝑐‘0) = (𝑑‘0) ↔ ∃𝑎 ∈ (𝑆 “ {𝑖})∃𝑏 ∈ (𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0))
24 sneq 4559 . . . . . 6 (𝑖 = 𝐴 → {𝑖} = {𝐴})
2524imaeq2d 5916 . . . . 5 (𝑖 = 𝐴 → (𝑆 “ {𝑖}) = (𝑆 “ {𝐴}))
2625rexeqdv 3404 . . . 4 (𝑖 = 𝐴 → (∃𝑎 ∈ (𝑆 “ {𝑖})∃𝑏 ∈ (𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0) ↔ ∃𝑎 ∈ (𝑆 “ {𝐴})∃𝑏 ∈ (𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0)))
2723, 26syl5bb 286 . . 3 (𝑖 = 𝐴 → (∃𝑐 ∈ (𝑆 “ {𝑖})∃𝑑 ∈ (𝑆 “ {𝑗})(𝑐‘0) = (𝑑‘0) ↔ ∃𝑎 ∈ (𝑆 “ {𝐴})∃𝑏 ∈ (𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0)))
28 sneq 4559 . . . . . 6 (𝑗 = 𝐵 → {𝑗} = {𝐵})
2928imaeq2d 5916 . . . . 5 (𝑗 = 𝐵 → (𝑆 “ {𝑗}) = (𝑆 “ {𝐵}))
3029rexeqdv 3404 . . . 4 (𝑗 = 𝐵 → (∃𝑏 ∈ (𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0) ↔ ∃𝑏 ∈ (𝑆 “ {𝐵})(𝑎‘0) = (𝑏‘0)))
3130rexbidv 3290 . . 3 (𝑗 = 𝐵 → (∃𝑎 ∈ (𝑆 “ {𝐴})∃𝑏 ∈ (𝑆 “ {𝑗})(𝑎‘0) = (𝑏‘0) ↔ ∃𝑎 ∈ (𝑆 “ {𝐴})∃𝑏 ∈ (𝑆 “ {𝐵})(𝑎‘0) = (𝑏‘0)))
3227, 31, 1brabg 5413 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝐿𝐵 ↔ ∃𝑎 ∈ (𝑆 “ {𝐴})∃𝑏 ∈ (𝑆 “ {𝐵})(𝑎‘0) = (𝑏‘0)))
332, 18, 32pm5.21nii 383 1 (𝐴𝐿𝐵 ↔ ∃𝑎 ∈ (𝑆 “ {𝐴})∃𝑏 ∈ (𝑆 “ {𝐵})(𝑎‘0) = (𝑏‘0))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2115  ∀wral 3133  ∃wrex 3134  {crab 3137  Vcvv 3480   ∖ cdif 3916  ∅c0 4275  {csn 4549  ⟨cop 4555  ⟨cotp 4557  ∪ ciun 4905   class class class wbr 5052  {copab 5114   ↦ cmpt 5132   I cid 5446   × cxp 5540  ◡ccnv 5541  ran crn 5543   “ cima 5545  ‘cfv 6343  (class class class)co 7145   ∈ cmpo 7147  1oc1o 8085  2oc2o 8086  0cc0 10529  1c1 10530   − cmin 10862  ...cfz 12890  ..^cfzo 13033  ♯chash 13691  Word cword 13862   splice csplice 14107  ⟨“cs2 14199   ~FG cefg 18828 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 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-sep 5189  ax-nul 5196  ax-pr 5317 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ral 3138  df-rex 3139  df-rab 3142  df-v 3482  df-dif 3922  df-un 3924  df-in 3926  df-ss 3936  df-nul 4276  df-if 4450  df-sn 4550  df-pr 4552  df-op 4556  df-uni 4825  df-br 5053  df-opab 5115  df-xp 5548  df-cnv 5550  df-dm 5552  df-rn 5553  df-res 5554  df-ima 5555  df-iota 6302  df-fv 6351 This theorem is referenced by:  efgrelexlemb  18872  efgrelex  18873
 Copyright terms: Public domain W3C validator