Theorem efgcpbllema 19881

Description: Lemma for efgrelex 19878. Define an auxiliary equivalence relation 𝐿 such that 𝐴𝐿𝐵 if there are sequences from 𝐴 to 𝐵 passing through the same reduced word. (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)))
efgcpbllem.1	⊢ 𝐿 = {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝑊 ∧ ((𝐴 ++ 𝑖) ++ 𝐵) ∼ ((𝐴 ++ 𝑗) ++ 𝐵))}

Assertion

Ref	Expression
efgcpbllema	⊢ (𝑋𝐿𝑌 ↔ (𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑊 ∧ ((𝐴 ++ 𝑋) ++ 𝐵) ∼ ((𝐴 ++ 𝑌) ++ 𝐵)))

Distinct variable groups:   𝑖,𝑗,𝐴   𝑦,𝑧   𝑡,𝑛,𝑣,𝑤,𝑦,𝑧   𝑖,𝑚,𝑛,𝑡,𝑣,𝑤,𝑥,𝑀,𝑗   𝑖,𝑘,𝑇,𝑗,𝑚,𝑡,𝑥   𝑖,𝑋,𝑗   𝑦,𝑖,𝑧,𝑊,𝑗   𝑘,𝑛,𝑣,𝑤,𝑦,𝑧,𝑊,𝑚,𝑡,𝑥   ∼ ,𝑖,𝑗,𝑚,𝑡,𝑥,𝑦,𝑧   𝐵,𝑖,𝑗   𝑆,𝑖,𝑗   𝑖,𝑌,𝑗   𝑖,𝐼,𝑗,𝑚,𝑛,𝑡,𝑣,𝑤,𝑥,𝑦,𝑧   𝐷,𝑖,𝑗,𝑚,𝑡

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

Proof of Theorem efgcpbllema

Step	Hyp	Ref	Expression
1		oveq2 7421	. . . . 5 ⊢ (𝑖 = 𝑋 → (𝐴 ++ 𝑖) = (𝐴 ++ 𝑋))
2	1	oveq1d 7428	. . . 4 ⊢ (𝑖 = 𝑋 → ((𝐴 ++ 𝑖) ++ 𝐵) = ((𝐴 ++ 𝑋) ++ 𝐵))
3		oveq2 7421	. . . . 5 ⊢ (𝑗 = 𝑌 → (𝐴 ++ 𝑗) = (𝐴 ++ 𝑌))
4	3	oveq1d 7428	. . . 4 ⊢ (𝑗 = 𝑌 → ((𝐴 ++ 𝑗) ++ 𝐵) = ((𝐴 ++ 𝑌) ++ 𝐵))
5	2, 4	breqan12d 5119	. . 3 ⊢ ((𝑖 = 𝑋 ∧ 𝑗 = 𝑌) → (((𝐴 ++ 𝑖) ++ 𝐵) ∼ ((𝐴 ++ 𝑗) ++ 𝐵) ↔ ((𝐴 ++ 𝑋) ++ 𝐵) ∼ ((𝐴 ++ 𝑌) ++ 𝐵)))
6		efgcpbllem.1	. . . 4 ⊢ 𝐿 = {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝑊 ∧ ((𝐴 ++ 𝑖) ++ 𝐵) ∼ ((𝐴 ++ 𝑗) ++ 𝐵))}
7		vex 3454	. . . . . . 7 ⊢ 𝑖 ∈ V
8		vex 3454	. . . . . . 7 ⊢ 𝑗 ∈ V
9	7, 8	prss 4781	. . . . . 6 ⊢ ((𝑖 ∈ 𝑊 ∧ 𝑗 ∈ 𝑊) ↔ {𝑖, 𝑗} ⊆ 𝑊)
10	9	anbi1i 636	. . . . 5 ⊢ (((𝑖 ∈ 𝑊 ∧ 𝑗 ∈ 𝑊) ∧ ((𝐴 ++ 𝑖) ++ 𝐵) ∼ ((𝐴 ++ 𝑗) ++ 𝐵)) ↔ ({𝑖, 𝑗} ⊆ 𝑊 ∧ ((𝐴 ++ 𝑖) ++ 𝐵) ∼ ((𝐴 ++ 𝑗) ++ 𝐵)))
11	10	opabbii 5172	. . . 4 ⊢ {⟨𝑖, 𝑗⟩ ∣ ((𝑖 ∈ 𝑊 ∧ 𝑗 ∈ 𝑊) ∧ ((𝐴 ++ 𝑖) ++ 𝐵) ∼ ((𝐴 ++ 𝑗) ++ 𝐵))} = {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝑊 ∧ ((𝐴 ++ 𝑖) ++ 𝐵) ∼ ((𝐴 ++ 𝑗) ++ 𝐵))}
12	6, 11	eqtr4i 2786	. . 3 ⊢ 𝐿 = {⟨𝑖, 𝑗⟩ ∣ ((𝑖 ∈ 𝑊 ∧ 𝑗 ∈ 𝑊) ∧ ((𝐴 ++ 𝑖) ++ 𝐵) ∼ ((𝐴 ++ 𝑗) ++ 𝐵))}
13	5, 12	brab2a 5748	. 2 ⊢ (𝑋𝐿𝑌 ↔ ((𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑊) ∧ ((𝐴 ++ 𝑋) ++ 𝐵) ∼ ((𝐴 ++ 𝑌) ++ 𝐵)))
14		df-3an 1105	. 2 ⊢ ((𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑊 ∧ ((𝐴 ++ 𝑋) ++ 𝐵) ∼ ((𝐴 ++ 𝑌) ++ 𝐵)) ↔ ((𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑊) ∧ ((𝐴 ++ 𝑋) ++ 𝐵) ∼ ((𝐴 ++ 𝑌) ++ 𝐵)))
15	13, 14	bitr4i 281	1 ⊢ (𝑋𝐿𝑌 ↔ (𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑊 ∧ ((𝐴 ++ 𝑋) ++ 𝐵) ∼ ((𝐴 ++ 𝑌) ++ 𝐵)))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3076  {crab 3412   ∖ cdif 3896   ⊆ wss 3899  ∅c0 4279  {csn 4584  {cpr 4586  ⟨cop 4590  ⟨cotp 4592  ∪ ciun 4951   class class class wbr 5103  {copab 5167   ↦ cmpt 5186   I cid 5549   × cxp 5653  ran crn 5656  ‘cfv 6533  (class class class)co 7413   ∈ cmpo 7415  1_oc1o 8448  2_oc2o 8449  0cc0 11124  1c1 11125   − cmin 11465  ...cfz 13561  ..^cfzo 13709  ♯chash 14394  Word cword 14578   ++ cconcat 14635   splice csplice 14818  ⟨“cs2 14912   ~_FG cefg 19833

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-xp 5661  df-iota 6489  df-fv 6541  df-ov 7416

This theorem is used by:  efgcpbllemb  19882  efgcpbl  19883