gsmsymgreqlem2 - Metamath Proof Explorer

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

Theorem gsmsymgreqlem2 18163

Description: Lemma 2 for gsmsymgreq 18164. (Contributed by AV, 26-Jan-2019.)

**Hypotheses**
Ref	Expression
gsmsymgrfix.s	⊢ 𝑆 = (SymGrp‘𝑁)
gsmsymgrfix.b	⊢ 𝐵 = (Base‘𝑆)
gsmsymgreq.z	⊢ 𝑍 = (SymGrp‘𝑀)
gsmsymgreq.p	⊢ 𝑃 = (Base‘𝑍)
gsmsymgreq.i	⊢ 𝐼 = (𝑁 ∩ 𝑀)

**Assertion**
Ref	Expression
gsmsymgreqlem2	⊢ (((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) → ((∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑛) = ((𝑍 Σ_g 𝑌)‘𝑛)) → (∀𝑖 ∈ (0..^(♯‘(𝑋 ++ ⟨“𝐶”⟩)))∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g (𝑋 ++ ⟨“𝐶”⟩))‘𝑛) = ((𝑍 Σ_g (𝑌 ++ ⟨“𝑅”⟩))‘𝑛))))

Distinct variable groups: 𝐵,𝑖 𝑖,𝑁 𝑃,𝑖 𝑛,𝐼 𝑛,𝑋 𝐶,𝑛 𝑅,𝑛 𝑆,𝑛 𝑛,𝑌 𝑛,𝑍 𝐵,𝑛 𝐶,𝑖,𝑛 𝑖,𝐼 𝑛,𝑀 𝑛,𝑁 𝑃,𝑛 𝑅,𝑖 𝑖,𝑋 𝑖,𝑌 Allowed substitution hints: 𝑆(𝑖) 𝑀(𝑖) 𝑍(𝑖)

Proof of Theorem gsmsymgreqlem2 Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ccatws1len 13640	. . . . . . . . . 10 ⊢ (𝑋 ∈ Word 𝐵 → (♯‘(𝑋 ++ ⟨“𝐶”⟩)) = ((♯‘𝑋) + 1))
2	1	adantr 473	. . . . . . . . 9 ⊢ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) → (♯‘(𝑋 ++ ⟨“𝐶”⟩)) = ((♯‘𝑋) + 1))
3	2	3ad2ant1 1164	. . . . . . . 8 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → (♯‘(𝑋 ++ ⟨“𝐶”⟩)) = ((♯‘𝑋) + 1))
4	3	oveq2d 6894	. . . . . . 7 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → (0..^(♯‘(𝑋 ++ ⟨“𝐶”⟩))) = (0..^((♯‘𝑋) + 1)))
5		lencl 13553	. . . . . . . . . . 11 ⊢ (𝑋 ∈ Word 𝐵 → (♯‘𝑋) ∈ ℕ₀)
6		elnn0uz 11969	. . . . . . . . . . 11 ⊢ ((♯‘𝑋) ∈ ℕ₀ ↔ (♯‘𝑋) ∈ (ℤ_≥‘0))
7	5, 6	sylib 210	. . . . . . . . . 10 ⊢ (𝑋 ∈ Word 𝐵 → (♯‘𝑋) ∈ (ℤ_≥‘0))
8	7	adantr 473	. . . . . . . . 9 ⊢ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) → (♯‘𝑋) ∈ (ℤ_≥‘0))
9		fzosplitsn 12831	. . . . . . . . 9 ⊢ ((♯‘𝑋) ∈ (ℤ_≥‘0) → (0..^((♯‘𝑋) + 1)) = ((0..^(♯‘𝑋)) ∪ {(♯‘𝑋)}))
10	8, 9	syl 17	. . . . . . . 8 ⊢ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) → (0..^((♯‘𝑋) + 1)) = ((0..^(♯‘𝑋)) ∪ {(♯‘𝑋)}))
11	10	3ad2ant1 1164	. . . . . . 7 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → (0..^((♯‘𝑋) + 1)) = ((0..^(♯‘𝑋)) ∪ {(♯‘𝑋)}))
12	4, 11	eqtrd 2833	. . . . . 6 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → (0..^(♯‘(𝑋 ++ ⟨“𝐶”⟩))) = ((0..^(♯‘𝑋)) ∪ {(♯‘𝑋)}))
13	12	raleqdv 3327	. . . . 5 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → (∀𝑖 ∈ (0..^(♯‘(𝑋 ++ ⟨“𝐶”⟩)))∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) ↔ ∀𝑖 ∈ ((0..^(♯‘𝑋)) ∪ {(♯‘𝑋)})∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛)))
14	5	adantr 473	. . . . . . 7 ⊢ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) → (♯‘𝑋) ∈ ℕ₀)
15	14	3ad2ant1 1164	. . . . . 6 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → (♯‘𝑋) ∈ ℕ₀)
16		fveq2 6411	. . . . . . . . . 10 ⊢ (𝑖 = (♯‘𝑋) → ((𝑋 ++ ⟨“𝐶”⟩)‘𝑖) = ((𝑋 ++ ⟨“𝐶”⟩)‘(♯‘𝑋)))
17	16	fveq1d 6413	. . . . . . . . 9 ⊢ (𝑖 = (♯‘𝑋) → (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑋 ++ ⟨“𝐶”⟩)‘(♯‘𝑋))‘𝑛))
18		fveq2 6411	. . . . . . . . . 10 ⊢ (𝑖 = (♯‘𝑋) → ((𝑌 ++ ⟨“𝑅”⟩)‘𝑖) = ((𝑌 ++ ⟨“𝑅”⟩)‘(♯‘𝑋)))
19	18	fveq1d 6413	. . . . . . . . 9 ⊢ (𝑖 = (♯‘𝑋) → (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘(♯‘𝑋))‘𝑛))
20	17, 19	eqeq12d 2814	. . . . . . . 8 ⊢ (𝑖 = (♯‘𝑋) → ((((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) ↔ (((𝑋 ++ ⟨“𝐶”⟩)‘(♯‘𝑋))‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘(♯‘𝑋))‘𝑛)))
21	20	ralbidv 3167	. . . . . . 7 ⊢ (𝑖 = (♯‘𝑋) → (∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) ↔ ∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘(♯‘𝑋))‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘(♯‘𝑋))‘𝑛)))
22	21	ralunsn 4614	. . . . . 6 ⊢ ((♯‘𝑋) ∈ ℕ₀ → (∀𝑖 ∈ ((0..^(♯‘𝑋)) ∪ {(♯‘𝑋)})∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) ↔ (∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) ∧ ∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘(♯‘𝑋))‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘(♯‘𝑋))‘𝑛))))
23	15, 22	syl 17	. . . . 5 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → (∀𝑖 ∈ ((0..^(♯‘𝑋)) ∪ {(♯‘𝑋)})∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) ↔ (∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) ∧ ∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘(♯‘𝑋))‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘(♯‘𝑋))‘𝑛))))
24		simpl 475	. . . . . . . . . . . . 13 ⊢ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) → 𝑋 ∈ Word 𝐵)
25	24	3ad2ant1 1164	. . . . . . . . . . . 12 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → 𝑋 ∈ Word 𝐵)
26	25	adantr 473	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) ∧ 𝑖 ∈ (0..^(♯‘𝑋))) → 𝑋 ∈ Word 𝐵)
27		simpr 478	. . . . . . . . . . . . 13 ⊢ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) → 𝐶 ∈ 𝐵)
28	27	3ad2ant1 1164	. . . . . . . . . . . 12 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → 𝐶 ∈ 𝐵)
29	28	adantr 473	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) ∧ 𝑖 ∈ (0..^(♯‘𝑋))) → 𝐶 ∈ 𝐵)
30		simpr 478	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) ∧ 𝑖 ∈ (0..^(♯‘𝑋))) → 𝑖 ∈ (0..^(♯‘𝑋)))
31		ccats1val1 13649	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑖 ∈ (0..^(♯‘𝑋))) → ((𝑋 ++ ⟨“𝐶”⟩)‘𝑖) = (𝑋‘𝑖))
32	26, 29, 30, 31	syl3anc 1491	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) ∧ 𝑖 ∈ (0..^(♯‘𝑋))) → ((𝑋 ++ ⟨“𝐶”⟩)‘𝑖) = (𝑋‘𝑖))
33	32	fveq1d 6413	. . . . . . . . 9 ⊢ ((((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) ∧ 𝑖 ∈ (0..^(♯‘𝑋))) → (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = ((𝑋‘𝑖)‘𝑛))
34		simpl2l 1298	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) ∧ 𝑖 ∈ (0..^(♯‘𝑋))) → 𝑌 ∈ Word 𝑃)
35		simpl2r 1300	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) ∧ 𝑖 ∈ (0..^(♯‘𝑋))) → 𝑅 ∈ 𝑃)
36		oveq2 6886	. . . . . . . . . . . . . . 15 ⊢ ((♯‘𝑋) = (♯‘𝑌) → (0..^(♯‘𝑋)) = (0..^(♯‘𝑌)))
37	36	eleq2d 2864	. . . . . . . . . . . . . 14 ⊢ ((♯‘𝑋) = (♯‘𝑌) → (𝑖 ∈ (0..^(♯‘𝑋)) ↔ 𝑖 ∈ (0..^(♯‘𝑌))))
38	37	biimpd 221	. . . . . . . . . . . . 13 ⊢ ((♯‘𝑋) = (♯‘𝑌) → (𝑖 ∈ (0..^(♯‘𝑋)) → 𝑖 ∈ (0..^(♯‘𝑌))))
39	38	3ad2ant3 1166	. . . . . . . . . . . 12 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → (𝑖 ∈ (0..^(♯‘𝑋)) → 𝑖 ∈ (0..^(♯‘𝑌))))
40	39	imp 396	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) ∧ 𝑖 ∈ (0..^(♯‘𝑋))) → 𝑖 ∈ (0..^(♯‘𝑌)))
41		ccats1val1 13649	. . . . . . . . . . 11 ⊢ ((𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃 ∧ 𝑖 ∈ (0..^(♯‘𝑌))) → ((𝑌 ++ ⟨“𝑅”⟩)‘𝑖) = (𝑌‘𝑖))
42	34, 35, 40, 41	syl3anc 1491	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) ∧ 𝑖 ∈ (0..^(♯‘𝑋))) → ((𝑌 ++ ⟨“𝑅”⟩)‘𝑖) = (𝑌‘𝑖))
43	42	fveq1d 6413	. . . . . . . . 9 ⊢ ((((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) ∧ 𝑖 ∈ (0..^(♯‘𝑋))) → (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛))
44	33, 43	eqeq12d 2814	. . . . . . . 8 ⊢ ((((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) ∧ 𝑖 ∈ (0..^(♯‘𝑋))) → ((((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) ↔ ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛)))
45	44	ralbidv 3167	. . . . . . 7 ⊢ ((((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) ∧ 𝑖 ∈ (0..^(♯‘𝑋))) → (∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) ↔ ∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛)))
46	45	ralbidva 3166	. . . . . 6 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → (∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) ↔ ∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛)))
47		eqidd 2800	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) → (♯‘𝑋) = (♯‘𝑋))
48	24, 27, 47	3jca 1159	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) → (𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵 ∧ (♯‘𝑋) = (♯‘𝑋)))
49	48	3ad2ant1 1164	. . . . . . . . . 10 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → (𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵 ∧ (♯‘𝑋) = (♯‘𝑋)))
50		ccats1val2 13650	. . . . . . . . . 10 ⊢ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵 ∧ (♯‘𝑋) = (♯‘𝑋)) → ((𝑋 ++ ⟨“𝐶”⟩)‘(♯‘𝑋)) = 𝐶)
51	49, 50	syl 17	. . . . . . . . 9 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → ((𝑋 ++ ⟨“𝐶”⟩)‘(♯‘𝑋)) = 𝐶)
52	51	fveq1d 6413	. . . . . . . 8 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → (((𝑋 ++ ⟨“𝐶”⟩)‘(♯‘𝑋))‘𝑛) = (𝐶‘𝑛))
53		df-3an 1110	. . . . . . . . . . 11 ⊢ ((𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃 ∧ (♯‘𝑋) = (♯‘𝑌)) ↔ ((𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)))
54	53	biimpri 220	. . . . . . . . . 10 ⊢ (((𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃 ∧ (♯‘𝑋) = (♯‘𝑌)))
55	54	3adant1 1161	. . . . . . . . 9 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃 ∧ (♯‘𝑋) = (♯‘𝑌)))
56		ccats1val2 13650	. . . . . . . . . 10 ⊢ ((𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃 ∧ (♯‘𝑋) = (♯‘𝑌)) → ((𝑌 ++ ⟨“𝑅”⟩)‘(♯‘𝑋)) = 𝑅)
57	56	fveq1d 6413	. . . . . . . . 9 ⊢ ((𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃 ∧ (♯‘𝑋) = (♯‘𝑌)) → (((𝑌 ++ ⟨“𝑅”⟩)‘(♯‘𝑋))‘𝑛) = (𝑅‘𝑛))
58	55, 57	syl 17	. . . . . . . 8 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → (((𝑌 ++ ⟨“𝑅”⟩)‘(♯‘𝑋))‘𝑛) = (𝑅‘𝑛))
59	52, 58	eqeq12d 2814	. . . . . . 7 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → ((((𝑋 ++ ⟨“𝐶”⟩)‘(♯‘𝑋))‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘(♯‘𝑋))‘𝑛) ↔ (𝐶‘𝑛) = (𝑅‘𝑛)))
60	59	ralbidv 3167	. . . . . 6 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → (∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘(♯‘𝑋))‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘(♯‘𝑋))‘𝑛) ↔ ∀𝑛 ∈ 𝐼 (𝐶‘𝑛) = (𝑅‘𝑛)))
61	46, 60	anbi12d 625	. . . . 5 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → ((∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) ∧ ∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘(♯‘𝑋))‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘(♯‘𝑋))‘𝑛)) ↔ (∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) ∧ ∀𝑛 ∈ 𝐼 (𝐶‘𝑛) = (𝑅‘𝑛))))
62	13, 23, 61	3bitrd 297	. . . 4 ⊢ (((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)) → (∀𝑖 ∈ (0..^(♯‘(𝑋 ++ ⟨“𝐶”⟩)))∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) ↔ (∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) ∧ ∀𝑛 ∈ 𝐼 (𝐶‘𝑛) = (𝑅‘𝑛))))
63	62	ad2antlr 719	. . 3 ⊢ ((((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) ∧ (∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑛) = ((𝑍 Σ_g 𝑌)‘𝑛))) → (∀𝑖 ∈ (0..^(♯‘(𝑋 ++ ⟨“𝐶”⟩)))∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) ↔ (∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) ∧ ∀𝑛 ∈ 𝐼 (𝐶‘𝑛) = (𝑅‘𝑛))))
64		pm3.35 838	. . . . . . 7 ⊢ ((∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) ∧ (∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑛) = ((𝑍 Σ_g 𝑌)‘𝑛))) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑛) = ((𝑍 Σ_g 𝑌)‘𝑛))
65		fveq2 6411	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑗 → ((𝑆 Σ_g 𝑋)‘𝑛) = ((𝑆 Σ_g 𝑋)‘𝑗))
66		fveq2 6411	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑗 → ((𝑍 Σ_g 𝑌)‘𝑛) = ((𝑍 Σ_g 𝑌)‘𝑗))
67	65, 66	eqeq12d 2814	. . . . . . . . . 10 ⊢ (𝑛 = 𝑗 → (((𝑆 Σ_g 𝑋)‘𝑛) = ((𝑍 Σ_g 𝑌)‘𝑛) ↔ ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗)))
68	67	cbvralv 3354	. . . . . . . . 9 ⊢ (∀𝑛 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑛) = ((𝑍 Σ_g 𝑌)‘𝑛) ↔ ∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗))
69		simp-4l 802	. . . . . . . . . . . . . . 15 ⊢ (((((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) ∧ ∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗)) ∧ 𝑛 ∈ 𝐼) → 𝑁 ∈ Fin)
70		simp-4r 804	. . . . . . . . . . . . . . 15 ⊢ (((((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) ∧ ∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗)) ∧ 𝑛 ∈ 𝐼) → 𝑀 ∈ Fin)
71		simpr 478	. . . . . . . . . . . . . . 15 ⊢ (((((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) ∧ ∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗)) ∧ 𝑛 ∈ 𝐼) → 𝑛 ∈ 𝐼)
72	69, 70, 71	3jca 1159	. . . . . . . . . . . . . 14 ⊢ (((((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) ∧ ∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗)) ∧ 𝑛 ∈ 𝐼) → (𝑁 ∈ Fin ∧ 𝑀 ∈ Fin ∧ 𝑛 ∈ 𝐼))
73	72	adantr 473	. . . . . . . . . . . . 13 ⊢ ((((((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) ∧ ∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗)) ∧ 𝑛 ∈ 𝐼) ∧ (𝐶‘𝑛) = (𝑅‘𝑛)) → (𝑁 ∈ Fin ∧ 𝑀 ∈ Fin ∧ 𝑛 ∈ 𝐼))
74		simp-4r 804	. . . . . . . . . . . . 13 ⊢ ((((((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) ∧ ∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗)) ∧ 𝑛 ∈ 𝐼) ∧ (𝐶‘𝑛) = (𝑅‘𝑛)) → ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌)))
75		simpr 478	. . . . . . . . . . . . . . 15 ⊢ ((((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) ∧ ∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗)) → ∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗))
76	75	adantr 473	. . . . . . . . . . . . . 14 ⊢ (((((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) ∧ ∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗)) ∧ 𝑛 ∈ 𝐼) → ∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗))
77	76	anim1i 609	. . . . . . . . . . . . 13 ⊢ ((((((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) ∧ ∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗)) ∧ 𝑛 ∈ 𝐼) ∧ (𝐶‘𝑛) = (𝑅‘𝑛)) → (∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗) ∧ (𝐶‘𝑛) = (𝑅‘𝑛)))
78		gsmsymgrfix.s	. . . . . . . . . . . . . . 15 ⊢ 𝑆 = (SymGrp‘𝑁)
79		gsmsymgrfix.b	. . . . . . . . . . . . . . 15 ⊢ 𝐵 = (Base‘𝑆)
80		gsmsymgreq.z	. . . . . . . . . . . . . . 15 ⊢ 𝑍 = (SymGrp‘𝑀)
81		gsmsymgreq.p	. . . . . . . . . . . . . . 15 ⊢ 𝑃 = (Base‘𝑍)
82		gsmsymgreq.i	. . . . . . . . . . . . . . 15 ⊢ 𝐼 = (𝑁 ∩ 𝑀)
83	78, 79, 80, 81, 82	gsmsymgreqlem1 18162	. . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin ∧ 𝑛 ∈ 𝐼) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) → ((∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗) ∧ (𝐶‘𝑛) = (𝑅‘𝑛)) → ((𝑆 Σ_g (𝑋 ++ ⟨“𝐶”⟩))‘𝑛) = ((𝑍 Σ_g (𝑌 ++ ⟨“𝑅”⟩))‘𝑛)))
84	83	imp 396	. . . . . . . . . . . . 13 ⊢ ((((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin ∧ 𝑛 ∈ 𝐼) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) ∧ (∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗) ∧ (𝐶‘𝑛) = (𝑅‘𝑛))) → ((𝑆 Σ_g (𝑋 ++ ⟨“𝐶”⟩))‘𝑛) = ((𝑍 Σ_g (𝑌 ++ ⟨“𝑅”⟩))‘𝑛))
85	73, 74, 77, 84	syl21anc 867	. . . . . . . . . . . 12 ⊢ ((((((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) ∧ ∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗)) ∧ 𝑛 ∈ 𝐼) ∧ (𝐶‘𝑛) = (𝑅‘𝑛)) → ((𝑆 Σ_g (𝑋 ++ ⟨“𝐶”⟩))‘𝑛) = ((𝑍 Σ_g (𝑌 ++ ⟨“𝑅”⟩))‘𝑛))
86	85	ex 402	. . . . . . . . . . 11 ⊢ (((((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) ∧ ∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗)) ∧ 𝑛 ∈ 𝐼) → ((𝐶‘𝑛) = (𝑅‘𝑛) → ((𝑆 Σ_g (𝑋 ++ ⟨“𝐶”⟩))‘𝑛) = ((𝑍 Σ_g (𝑌 ++ ⟨“𝑅”⟩))‘𝑛)))
87	86	ralimdva 3143	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) ∧ ∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗)) → (∀𝑛 ∈ 𝐼 (𝐶‘𝑛) = (𝑅‘𝑛) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g (𝑋 ++ ⟨“𝐶”⟩))‘𝑛) = ((𝑍 Σ_g (𝑌 ++ ⟨“𝑅”⟩))‘𝑛)))
88	87	expcom 403	. . . . . . . . 9 ⊢ (∀𝑗 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑗) = ((𝑍 Σ_g 𝑌)‘𝑗) → (((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) → (∀𝑛 ∈ 𝐼 (𝐶‘𝑛) = (𝑅‘𝑛) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g (𝑋 ++ ⟨“𝐶”⟩))‘𝑛) = ((𝑍 Σ_g (𝑌 ++ ⟨“𝑅”⟩))‘𝑛))))
89	68, 88	sylbi 209	. . . . . . . 8 ⊢ (∀𝑛 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑛) = ((𝑍 Σ_g 𝑌)‘𝑛) → (((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) → (∀𝑛 ∈ 𝐼 (𝐶‘𝑛) = (𝑅‘𝑛) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g (𝑋 ++ ⟨“𝐶”⟩))‘𝑛) = ((𝑍 Σ_g (𝑌 ++ ⟨“𝑅”⟩))‘𝑛))))
90	89	com23 86	. . . . . . 7 ⊢ (∀𝑛 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑛) = ((𝑍 Σ_g 𝑌)‘𝑛) → (∀𝑛 ∈ 𝐼 (𝐶‘𝑛) = (𝑅‘𝑛) → (((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g (𝑋 ++ ⟨“𝐶”⟩))‘𝑛) = ((𝑍 Σ_g (𝑌 ++ ⟨“𝑅”⟩))‘𝑛))))
91	64, 90	syl 17	. . . . . 6 ⊢ ((∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) ∧ (∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑛) = ((𝑍 Σ_g 𝑌)‘𝑛))) → (∀𝑛 ∈ 𝐼 (𝐶‘𝑛) = (𝑅‘𝑛) → (((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g (𝑋 ++ ⟨“𝐶”⟩))‘𝑛) = ((𝑍 Σ_g (𝑌 ++ ⟨“𝑅”⟩))‘𝑛))))
92	91	impancom 444	. . . . 5 ⊢ ((∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) ∧ ∀𝑛 ∈ 𝐼 (𝐶‘𝑛) = (𝑅‘𝑛)) → ((∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑛) = ((𝑍 Σ_g 𝑌)‘𝑛)) → (((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g (𝑋 ++ ⟨“𝐶”⟩))‘𝑛) = ((𝑍 Σ_g (𝑌 ++ ⟨“𝑅”⟩))‘𝑛))))
93	92	com13 88	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) → ((∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑛) = ((𝑍 Σ_g 𝑌)‘𝑛)) → ((∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) ∧ ∀𝑛 ∈ 𝐼 (𝐶‘𝑛) = (𝑅‘𝑛)) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g (𝑋 ++ ⟨“𝐶”⟩))‘𝑛) = ((𝑍 Σ_g (𝑌 ++ ⟨“𝑅”⟩))‘𝑛))))
94	93	imp 396	. . 3 ⊢ ((((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) ∧ (∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑛) = ((𝑍 Σ_g 𝑌)‘𝑛))) → ((∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) ∧ ∀𝑛 ∈ 𝐼 (𝐶‘𝑛) = (𝑅‘𝑛)) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g (𝑋 ++ ⟨“𝐶”⟩))‘𝑛) = ((𝑍 Σ_g (𝑌 ++ ⟨“𝑅”⟩))‘𝑛)))
95	63, 94	sylbid 232	. 2 ⊢ ((((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) ∧ (∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑛) = ((𝑍 Σ_g 𝑌)‘𝑛))) → (∀𝑖 ∈ (0..^(♯‘(𝑋 ++ ⟨“𝐶”⟩)))∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g (𝑋 ++ ⟨“𝐶”⟩))‘𝑛) = ((𝑍 Σ_g (𝑌 ++ ⟨“𝑅”⟩))‘𝑛)))
96	95	ex 402	1 ⊢ (((𝑁 ∈ Fin ∧ 𝑀 ∈ Fin) ∧ ((𝑋 ∈ Word 𝐵 ∧ 𝐶 ∈ 𝐵) ∧ (𝑌 ∈ Word 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (♯‘𝑋) = (♯‘𝑌))) → ((∀𝑖 ∈ (0..^(♯‘𝑋))∀𝑛 ∈ 𝐼 ((𝑋‘𝑖)‘𝑛) = ((𝑌‘𝑖)‘𝑛) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g 𝑋)‘𝑛) = ((𝑍 Σ_g 𝑌)‘𝑛)) → (∀𝑖 ∈ (0..^(♯‘(𝑋 ++ ⟨“𝐶”⟩)))∀𝑛 ∈ 𝐼 (((𝑋 ++ ⟨“𝐶”⟩)‘𝑖)‘𝑛) = (((𝑌 ++ ⟨“𝑅”⟩)‘𝑖)‘𝑛) → ∀𝑛 ∈ 𝐼 ((𝑆 Σ_g (𝑋 ++ ⟨“𝐶”⟩))‘𝑛) = ((𝑍 Σ_g (𝑌 ++ ⟨“𝑅”⟩))‘𝑛))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 198 ∧ wa 385 ∧ w3a 1108 = wceq 1653 ∈ wcel 2157 ∀wral 3089 ∪ cun 3767 ∩ cin 3768 {csn 4368 ‘cfv 6101 (class class class)co 6878 Fincfn 8195 0cc0 10224 1c1 10225 + caddc 10227 ℕ₀cn0 11580 ℤ_≥cuz 11930 ..^cfzo 12720 ♯chash 13370 Word cword 13534 ++ cconcat 13590 ⟨“cs1 13615 Basecbs 16184 Σ_g cgsu 16416 SymGrpcsymg 18109

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-8 2159 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-13 2377 ax-ext 2777 ax-rep 4964 ax-sep 4975 ax-nul 4983 ax-pow 5035 ax-pr 5097 ax-un 7183 ax-cnex 10280 ax-resscn 10281 ax-1cn 10282 ax-icn 10283 ax-addcl 10284 ax-addrcl 10285 ax-mulcl 10286 ax-mulrcl 10287 ax-mulcom 10288 ax-addass 10289 ax-mulass 10290 ax-distr 10291 ax-i2m1 10292 ax-1ne0 10293 ax-1rid 10294 ax-rnegex 10295 ax-rrecex 10296 ax-cnre 10297 ax-pre-lttri 10298 ax-pre-lttrn 10299 ax-pre-ltadd 10300 ax-pre-mulgt0 10301

This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-3or 1109 df-3an 1110 df-tru 1657 df-ex 1876 df-nf 1880 df-sb 2065 df-mo 2591 df-eu 2609 df-clab 2786 df-cleq 2792 df-clel 2795 df-nfc 2930 df-ne 2972 df-nel 3075 df-ral 3094 df-rex 3095 df-reu 3096 df-rmo 3097 df-rab 3098 df-v 3387 df-sbc 3634 df-csb 3729 df-dif 3772 df-un 3774 df-in 3776 df-ss 3783 df-pss 3785 df-nul 4116 df-if 4278 df-pw 4351 df-sn 4369 df-pr 4371 df-tp 4373 df-op 4375 df-uni 4629 df-int 4668 df-iun 4712 df-br 4844 df-opab 4906 df-mpt 4923 df-tr 4946 df-id 5220 df-eprel 5225 df-po 5233 df-so 5234 df-fr 5271 df-we 5273 df-xp 5318 df-rel 5319 df-cnv 5320 df-co 5321 df-dm 5322 df-rn 5323 df-res 5324 df-ima 5325 df-pred 5898 df-ord 5944 df-on 5945 df-lim 5946 df-suc 5947 df-iota 6064 df-fun 6103 df-fn 6104 df-f 6105 df-f1 6106 df-fo 6107 df-f1o 6108 df-fv 6109 df-riota 6839 df-ov 6881 df-oprab 6882 df-mpt2 6883 df-om 7300 df-1st 7401 df-2nd 7402 df-wrecs 7645 df-recs 7707 df-rdg 7745 df-1o 7799 df-oadd 7803 df-er 7982 df-map 8097 df-en 8196 df-dom 8197 df-sdom 8198 df-fin 8199 df-card 9051 df-pnf 10365 df-mnf 10366 df-xr 10367 df-ltxr 10368 df-le 10369 df-sub 10558 df-neg 10559 df-nn 11313 df-2 11376 df-3 11377 df-4 11378 df-5 11379 df-6 11380 df-7 11381 df-8 11382 df-9 11383 df-n0 11581 df-z 11667 df-uz 11931 df-fz 12581 df-fzo 12721 df-seq 13056 df-hash 13371 df-word 13535 df-concat 13591 df-s1 13616 df-struct 16186 df-ndx 16187 df-slot 16188 df-base 16190 df-sets 16191 df-ress 16192 df-plusg 16280 df-tset 16286 df-0g 16417 df-gsum 16418 df-mgm 17557 df-sgrp 17599 df-mnd 17610 df-submnd 17651 df-grp 17741 df-symg 18110

This theorem is referenced by: gsmsymgreq 18164

W3C validator