chnerlem1 - Mathbox for Ender Ting

	Mathbox for Ender Ting		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > chnerlem1		Structured version Visualization version GIF version

Theorem chnerlem1 47068

Description: In a chain constructed on an equivalence relation, the last element is equivalent to any. This theorem is a translation of chnub 18543 to equivalence relations. (Contributed by Ender Ting, 29-Jan-2026.)

**Hypotheses**
Ref	Expression
chner.1	⊢ (𝜑 → ∼ Er 𝐴)
chner.2	⊢ (𝜑 → 𝐶 ∈ ( ∼ Chain 𝐴))
chner.3	⊢ (𝜑 → 𝐽 ∈ (0..^(♯‘𝐶)))

**Assertion**
Ref	Expression
chnerlem1	⊢ (𝜑 → (𝐶‘𝐽) ∼ (lastS‘𝐶))

Proof of Theorem chnerlem1 Dummy variables 𝑐 𝑑 𝑖 𝑗 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6832	. . 3 ⊢ (𝑖 = 𝐽 → (𝐶‘𝑖) = (𝐶‘𝐽))
2	1	breq1d 5106	. 2 ⊢ (𝑖 = 𝐽 → ((𝐶‘𝑖) ∼ (lastS‘𝐶) ↔ (𝐶‘𝐽) ∼ (lastS‘𝐶)))
3		fveq2 6832	. . . . 5 ⊢ (𝑐 = ∅ → (♯‘𝑐) = (♯‘∅))
4	3	oveq2d 7372	. . . 4 ⊢ (𝑐 = ∅ → (0..^(♯‘𝑐)) = (0..^(♯‘∅)))
5		fveq1 6831	. . . . 5 ⊢ (𝑐 = ∅ → (𝑐‘𝑖) = (∅‘𝑖))
6		fveq2 6832	. . . . 5 ⊢ (𝑐 = ∅ → (lastS‘𝑐) = (lastS‘∅))
7	5, 6	breq12d 5109	. . . 4 ⊢ (𝑐 = ∅ → ((𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ (∅‘𝑖) ∼ (lastS‘∅)))
8	4, 7	raleqbidv 3314	. . 3 ⊢ (𝑐 = ∅ → (∀𝑖 ∈ (0..^(♯‘𝑐))(𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ ∀𝑖 ∈ (0..^(♯‘∅))(∅‘𝑖) ∼ (lastS‘∅)))
9		fveq2 6832	. . . . 5 ⊢ (𝑐 = 𝑑 → (♯‘𝑐) = (♯‘𝑑))
10	9	oveq2d 7372	. . . 4 ⊢ (𝑐 = 𝑑 → (0..^(♯‘𝑐)) = (0..^(♯‘𝑑)))
11		fveq1 6831	. . . . 5 ⊢ (𝑐 = 𝑑 → (𝑐‘𝑖) = (𝑑‘𝑖))
12		fveq2 6832	. . . . 5 ⊢ (𝑐 = 𝑑 → (lastS‘𝑐) = (lastS‘𝑑))
13	11, 12	breq12d 5109	. . . 4 ⊢ (𝑐 = 𝑑 → ((𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ (𝑑‘𝑖) ∼ (lastS‘𝑑)))
14	10, 13	raleqbidv 3314	. . 3 ⊢ (𝑐 = 𝑑 → (∀𝑖 ∈ (0..^(♯‘𝑐))(𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)))
15		fveq2 6832	. . . . . 6 ⊢ (𝑖 = 𝑗 → (𝑐‘𝑖) = (𝑐‘𝑗))
16	15	breq1d 5106	. . . . 5 ⊢ (𝑖 = 𝑗 → ((𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ (𝑐‘𝑗) ∼ (lastS‘𝑐)))
17	16	cbvralvw 3212	. . . 4 ⊢ (∀𝑖 ∈ (0..^(♯‘𝑐))(𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ ∀𝑗 ∈ (0..^(♯‘𝑐))(𝑐‘𝑗) ∼ (lastS‘𝑐))
18		fveq2 6832	. . . . . 6 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (♯‘𝑐) = (♯‘(𝑑 ++ ⟨“𝑥”⟩)))
19	18	oveq2d 7372	. . . . 5 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (0..^(♯‘𝑐)) = (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩))))
20		fveq1 6831	. . . . . 6 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (𝑐‘𝑗) = ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗))
21		fveq2 6832	. . . . . 6 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (lastS‘𝑐) = (lastS‘(𝑑 ++ ⟨“𝑥”⟩)))
22	20, 21	breq12d 5109	. . . . 5 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → ((𝑐‘𝑗) ∼ (lastS‘𝑐) ↔ ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩))))
23	19, 22	raleqbidv 3314	. . . 4 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (∀𝑗 ∈ (0..^(♯‘𝑐))(𝑐‘𝑗) ∼ (lastS‘𝑐) ↔ ∀𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩))))
24	17, 23	bitrid 283	. . 3 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (∀𝑖 ∈ (0..^(♯‘𝑐))(𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ ∀𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩))))
25		fveq2 6832	. . . . 5 ⊢ (𝑐 = 𝐶 → (♯‘𝑐) = (♯‘𝐶))
26	25	oveq2d 7372	. . . 4 ⊢ (𝑐 = 𝐶 → (0..^(♯‘𝑐)) = (0..^(♯‘𝐶)))
27		fveq1 6831	. . . . 5 ⊢ (𝑐 = 𝐶 → (𝑐‘𝑖) = (𝐶‘𝑖))
28		fveq2 6832	. . . . 5 ⊢ (𝑐 = 𝐶 → (lastS‘𝑐) = (lastS‘𝐶))
29	27, 28	breq12d 5109	. . . 4 ⊢ (𝑐 = 𝐶 → ((𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ (𝐶‘𝑖) ∼ (lastS‘𝐶)))
30	26, 29	raleqbidv 3314	. . 3 ⊢ (𝑐 = 𝐶 → (∀𝑖 ∈ (0..^(♯‘𝑐))(𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ ∀𝑖 ∈ (0..^(♯‘𝐶))(𝐶‘𝑖) ∼ (lastS‘𝐶)))
31		chner.2	. . 3 ⊢ (𝜑 → 𝐶 ∈ ( ∼ Chain 𝐴))
32		0nnn 12179	. . . . . . 7 ⊢ ¬ 0 ∈ ℕ
33		hash0 14288	. . . . . . . 8 ⊢ (♯‘∅) = 0
34	33	eleq1i 2825	. . . . . . 7 ⊢ ((♯‘∅) ∈ ℕ ↔ 0 ∈ ℕ)
35	32, 34	mtbir 323	. . . . . 6 ⊢ ¬ (♯‘∅) ∈ ℕ
36		fzo0n0 13630	. . . . . 6 ⊢ ((0..^(♯‘∅)) ≠ ∅ ↔ (♯‘∅) ∈ ℕ)
37	35, 36	mtbir 323	. . . . 5 ⊢ ¬ (0..^(♯‘∅)) ≠ ∅
38		nne 2934	. . . . 5 ⊢ (¬ (0..^(♯‘∅)) ≠ ∅ ↔ (0..^(♯‘∅)) = ∅)
39	37, 38	mpbi 230	. . . 4 ⊢ (0..^(♯‘∅)) = ∅
40		rzal 4445	. . . 4 ⊢ ((0..^(♯‘∅)) = ∅ → ∀𝑖 ∈ (0..^(♯‘∅))(∅‘𝑖) ∼ (lastS‘∅))
41	39, 40	mp1i 13	. . 3 ⊢ (𝜑 → ∀𝑖 ∈ (0..^(♯‘∅))(∅‘𝑖) ∼ (lastS‘∅))
42		chner.1	. . . . . . . 8 ⊢ (𝜑 → ∼ Er 𝐴)
43	42	ad6antr 736	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → ∼ Er 𝐴)
44		simp-5r 785	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑥 ∈ 𝐴)
45	43, 44	erref 8653	. . . . . 6 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑥 ∼ 𝑥)
46		simp-6r 787	. . . . . . . 8 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑑 ∈ ( ∼ Chain 𝐴))
47	46	chnwrd 18529	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑑 ∈ Word 𝐴)
48		simplr 768	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩))))
49		ccatws1len 14542	. . . . . . . . . . . . . 14 ⊢ (𝑑 ∈ Word 𝐴 → (♯‘(𝑑 ++ ⟨“𝑥”⟩)) = ((♯‘𝑑) + 1))
50	47, 49	syl 17	. . . . . . . . . . . . 13 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (♯‘(𝑑 ++ ⟨“𝑥”⟩)) = ((♯‘𝑑) + 1))
51		fveq2 6832	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑑 = ∅ → (♯‘𝑑) = (♯‘∅))
52	51, 33	eqtr2di 2786	. . . . . . . . . . . . . . . . 17 ⊢ (𝑑 = ∅ → 0 = (♯‘𝑑))
53	52	eqcomd 2740	. . . . . . . . . . . . . . . 16 ⊢ (𝑑 = ∅ → (♯‘𝑑) = 0)
54	53	adantl 481	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (♯‘𝑑) = 0)
55	54	oveq1d 7371	. . . . . . . . . . . . . 14 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → ((♯‘𝑑) + 1) = (0 + 1))
56		0p1e1 12260	. . . . . . . . . . . . . 14 ⊢ (0 + 1) = 1
57	55, 56	eqtrdi 2785	. . . . . . . . . . . . 13 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → ((♯‘𝑑) + 1) = 1)
58	50, 57	eqtrd 2769	. . . . . . . . . . . 12 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (♯‘(𝑑 ++ ⟨“𝑥”⟩)) = 1)
59	58	oveq2d 7372	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩))) = (0..^1))
60	48, 59	eleqtrd 2836	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑗 ∈ (0..^1))
61		fzo01 13661	. . . . . . . . . . 11 ⊢ (0..^1) = {0}
62	61	a1i 11	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (0..^1) = {0})
63	60, 62	eleqtrd 2836	. . . . . . . . 9 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑗 ∈ {0})
64		elsni 4595	. . . . . . . . 9 ⊢ (𝑗 ∈ {0} → 𝑗 = 0)
65	63, 64	syl 17	. . . . . . . 8 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑗 = 0)
66	52	adantl 481	. . . . . . . 8 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 0 = (♯‘𝑑))
67	65, 66	eqtrd 2769	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑗 = (♯‘𝑑))
68		ccats1val2 14549	. . . . . . 7 ⊢ ((𝑑 ∈ Word 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ 𝑗 = (♯‘𝑑)) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) = 𝑥)
69	47, 44, 67, 68	syl3anc 1373	. . . . . 6 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) = 𝑥)
70		lswccats1 14556	. . . . . . 7 ⊢ ((𝑑 ∈ Word 𝐴 ∧ 𝑥 ∈ 𝐴) → (lastS‘(𝑑 ++ ⟨“𝑥”⟩)) = 𝑥)
71	47, 44, 70	syl2anc 584	. . . . . 6 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (lastS‘(𝑑 ++ ⟨“𝑥”⟩)) = 𝑥)
72	45, 69, 71	3brtr4d 5128	. . . . 5 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩)))
73	42	ad6antr 736	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → ∼ Er 𝐴)
74		simp-6r 787	. . . . . . . . . . . 12 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → 𝑑 ∈ ( ∼ Chain 𝐴))
75	74	chnwrd 18529	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → 𝑑 ∈ Word 𝐴)
76	75	adantr 480	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → 𝑑 ∈ Word 𝐴)
77		simp-6r 787	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → 𝑥 ∈ 𝐴)
78		simpr 484	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → 𝑗 = (♯‘𝑑))
79	76, 77, 78, 68	syl3anc 1373	. . . . . . . . 9 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) = 𝑥)
80		simp-4r 783	. . . . . . . . . . . 12 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥))
81		neneq 2936	. . . . . . . . . . . . 13 ⊢ (𝑑 ≠ ∅ → ¬ 𝑑 = ∅)
82	81	adantl 481	. . . . . . . . . . . 12 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → ¬ 𝑑 = ∅)
83	80, 82	orcnd 878	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → (lastS‘𝑑) ∼ 𝑥)
84	73, 83	ersym 8645	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → 𝑥 ∼ (lastS‘𝑑))
85	84	adantr 480	. . . . . . . . 9 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → 𝑥 ∼ (lastS‘𝑑))
86	79, 85	eqbrtrd 5118	. . . . . . . 8 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘𝑑))
87		fveq2 6832	. . . . . . . . . 10 ⊢ (𝑖 = 𝑗 → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) = ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗))
88	87	breq1d 5106	. . . . . . . . 9 ⊢ (𝑖 = 𝑗 → (((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) ∼ (lastS‘𝑑) ↔ ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘𝑑)))
89		simpr 484	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) → ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑))
90	89	ad3antrrr 730	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑))
91		simplr 768	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → 𝑑 ∈ ( ∼ Chain 𝐴))
92	91	chnwrd 18529	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → 𝑑 ∈ Word 𝐴)
93		simpr 484	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → 𝑖 ∈ (0..^(♯‘𝑑)))
94		ccats1val1 14548	. . . . . . . . . . . . . . 15 ⊢ ((𝑑 ∈ Word 𝐴 ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) = (𝑑‘𝑖))
95	92, 93, 94	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) = (𝑑‘𝑖))
96	95	eqcomd 2740	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → (𝑑‘𝑖) = ((𝑑 ++ ⟨“𝑥”⟩)‘𝑖))
97	96	breq1d 5106	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → ((𝑑‘𝑖) ∼ (lastS‘𝑑) ↔ ((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) ∼ (lastS‘𝑑)))
98	97	ralbidva 3155	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) → (∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑) ↔ ∀𝑖 ∈ (0..^(♯‘𝑑))((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) ∼ (lastS‘𝑑)))
99	98	ad6antr 736	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → (∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑) ↔ ∀𝑖 ∈ (0..^(♯‘𝑑))((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) ∼ (lastS‘𝑑)))
100	90, 99	mpbid 232	. . . . . . . . 9 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → ∀𝑖 ∈ (0..^(♯‘𝑑))((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) ∼ (lastS‘𝑑))
101		simpr 484	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩))))
102		simp-5r 785	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → 𝑑 ∈ ( ∼ Chain 𝐴))
103	102	chnwrd 18529	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → 𝑑 ∈ Word 𝐴)
104	103, 49	syl 17	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → (♯‘(𝑑 ++ ⟨“𝑥”⟩)) = ((♯‘𝑑) + 1))
105	104	oveq2d 7372	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩))) = (0..^((♯‘𝑑) + 1)))
106	101, 105	eleqtrd 2836	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → 𝑗 ∈ (0..^((♯‘𝑑) + 1)))
107	106	ad2antrr 726	. . . . . . . . . . 11 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → 𝑗 ∈ (0..^((♯‘𝑑) + 1)))
108		simp-7r 789	. . . . . . . . . . . . . 14 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → 𝑑 ∈ ( ∼ Chain 𝐴))
109	108	chnwrd 18529	. . . . . . . . . . . . 13 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → 𝑑 ∈ Word 𝐴)
110		lencl 14454	. . . . . . . . . . . . 13 ⊢ (𝑑 ∈ Word 𝐴 → (♯‘𝑑) ∈ ℕ₀)
111		nn0uz 12787	. . . . . . . . . . . . . . 15 ⊢ ℕ₀ = (ℤ_≥‘0)
112	111	eleq2i 2826	. . . . . . . . . . . . . 14 ⊢ ((♯‘𝑑) ∈ ℕ₀ ↔ (♯‘𝑑) ∈ (ℤ_≥‘0))
113	112	biimpi 216	. . . . . . . . . . . . 13 ⊢ ((♯‘𝑑) ∈ ℕ₀ → (♯‘𝑑) ∈ (ℤ_≥‘0))
114	109, 110, 113	3syl 18	. . . . . . . . . . . 12 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → (♯‘𝑑) ∈ (ℤ_≥‘0))
115		fzosplitsni 13693	. . . . . . . . . . . 12 ⊢ ((♯‘𝑑) ∈ (ℤ_≥‘0) → (𝑗 ∈ (0..^((♯‘𝑑) + 1)) ↔ (𝑗 ∈ (0..^(♯‘𝑑)) ∨ 𝑗 = (♯‘𝑑))))
116	114, 115	syl 17	. . . . . . . . . . 11 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → (𝑗 ∈ (0..^((♯‘𝑑) + 1)) ↔ (𝑗 ∈ (0..^(♯‘𝑑)) ∨ 𝑗 = (♯‘𝑑))))
117	107, 116	mpbid 232	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → (𝑗 ∈ (0..^(♯‘𝑑)) ∨ 𝑗 = (♯‘𝑑)))
118		simpr 484	. . . . . . . . . . 11 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → 𝑗 ≠ (♯‘𝑑))
119		df-ne 2931	. . . . . . . . . . 11 ⊢ (𝑗 ≠ (♯‘𝑑) ↔ ¬ 𝑗 = (♯‘𝑑))
120	118, 119	sylib 218	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → ¬ 𝑗 = (♯‘𝑑))
121	117, 120	olcnd 877	. . . . . . . . 9 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → 𝑗 ∈ (0..^(♯‘𝑑)))
122	88, 100, 121	rspcdva 3575	. . . . . . . 8 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘𝑑))
123	86, 122	pm2.61dane 3017	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘𝑑))
124	73, 123, 83	ertrd 8649	. . . . . 6 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ 𝑥)
125		simp-5r 785	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → 𝑥 ∈ 𝐴)
126	75, 125, 70	syl2anc 584	. . . . . 6 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → (lastS‘(𝑑 ++ ⟨“𝑥”⟩)) = 𝑥)
127	124, 126	breqtrrd 5124	. . . . 5 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩)))
128	72, 127	pm2.61dane 3017	. . . 4 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩)))
129	128	ralrimiva 3126	. . 3 ⊢ (((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) → ∀𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩)))
130	8, 14, 24, 30, 31, 41, 129	chnind 18542	. 2 ⊢ (𝜑 → ∀𝑖 ∈ (0..^(♯‘𝐶))(𝐶‘𝑖) ∼ (lastS‘𝐶))
131		chner.3	. 2 ⊢ (𝜑 → 𝐽 ∈ (0..^(♯‘𝐶)))
132	2, 130, 131	rspcdva 3575	1 ⊢ (𝜑 → (𝐶‘𝐽) ∼ (lastS‘𝐶))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 ∀wral 3049 ∅c0 4283 {csn 4578 class class class wbr 5096 ‘cfv 6490 (class class class)co 7356 Er wer 8630 0cc0 11024 1c1 11025 + caddc 11027 ℕcn 12143 ℕ₀cn0 12399 ℤ_≥cuz 12749 ..^cfzo 13568 ♯chash 14251 Word cword 14434 lastSclsw 14483 ++ cconcat 14491 ⟨“cs1 14517 Chain cchn 18526

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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-int 4901 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-fin 8885 df-card 9849 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-n0 12400 df-xnn0 12473 df-z 12487 df-uz 12750 df-rp 12904 df-fz 13422 df-fzo 13569 df-hash 14252 df-word 14435 df-lsw 14484 df-concat 14492 df-s1 14518 df-substr 14563 df-pfx 14593 df-chn 18527

This theorem is referenced by: chnerlem2 47069

W3C validator