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 47240

Description: In a chain constructed on an equivalence relation, the last element is equivalent to any. This theorem is a translation of chnub 18557 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 6842	. . 3 ⊢ (𝑖 = 𝐽 → (𝐶‘𝑖) = (𝐶‘𝐽))
2	1	breq1d 5110	. 2 ⊢ (𝑖 = 𝐽 → ((𝐶‘𝑖) ∼ (lastS‘𝐶) ↔ (𝐶‘𝐽) ∼ (lastS‘𝐶)))
3		fveq2 6842	. . . . 5 ⊢ (𝑐 = ∅ → (♯‘𝑐) = (♯‘∅))
4	3	oveq2d 7384	. . . 4 ⊢ (𝑐 = ∅ → (0..^(♯‘𝑐)) = (0..^(♯‘∅)))
5		fveq1 6841	. . . . 5 ⊢ (𝑐 = ∅ → (𝑐‘𝑖) = (∅‘𝑖))
6		fveq2 6842	. . . . 5 ⊢ (𝑐 = ∅ → (lastS‘𝑐) = (lastS‘∅))
7	5, 6	breq12d 5113	. . . 4 ⊢ (𝑐 = ∅ → ((𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ (∅‘𝑖) ∼ (lastS‘∅)))
8	4, 7	raleqbidv 3318	. . 3 ⊢ (𝑐 = ∅ → (∀𝑖 ∈ (0..^(♯‘𝑐))(𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ ∀𝑖 ∈ (0..^(♯‘∅))(∅‘𝑖) ∼ (lastS‘∅)))
9		fveq2 6842	. . . . 5 ⊢ (𝑐 = 𝑑 → (♯‘𝑐) = (♯‘𝑑))
10	9	oveq2d 7384	. . . 4 ⊢ (𝑐 = 𝑑 → (0..^(♯‘𝑐)) = (0..^(♯‘𝑑)))
11		fveq1 6841	. . . . 5 ⊢ (𝑐 = 𝑑 → (𝑐‘𝑖) = (𝑑‘𝑖))
12		fveq2 6842	. . . . 5 ⊢ (𝑐 = 𝑑 → (lastS‘𝑐) = (lastS‘𝑑))
13	11, 12	breq12d 5113	. . . 4 ⊢ (𝑐 = 𝑑 → ((𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ (𝑑‘𝑖) ∼ (lastS‘𝑑)))
14	10, 13	raleqbidv 3318	. . 3 ⊢ (𝑐 = 𝑑 → (∀𝑖 ∈ (0..^(♯‘𝑐))(𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)))
15		fveq2 6842	. . . . . 6 ⊢ (𝑖 = 𝑗 → (𝑐‘𝑖) = (𝑐‘𝑗))
16	15	breq1d 5110	. . . . 5 ⊢ (𝑖 = 𝑗 → ((𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ (𝑐‘𝑗) ∼ (lastS‘𝑐)))
17	16	cbvralvw 3216	. . . 4 ⊢ (∀𝑖 ∈ (0..^(♯‘𝑐))(𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ ∀𝑗 ∈ (0..^(♯‘𝑐))(𝑐‘𝑗) ∼ (lastS‘𝑐))
18		fveq2 6842	. . . . . 6 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (♯‘𝑐) = (♯‘(𝑑 ++ ⟨“𝑥”⟩)))
19	18	oveq2d 7384	. . . . 5 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (0..^(♯‘𝑐)) = (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩))))
20		fveq1 6841	. . . . . 6 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (𝑐‘𝑗) = ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗))
21		fveq2 6842	. . . . . 6 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (lastS‘𝑐) = (lastS‘(𝑑 ++ ⟨“𝑥”⟩)))
22	20, 21	breq12d 5113	. . . . 5 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → ((𝑐‘𝑗) ∼ (lastS‘𝑐) ↔ ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩))))
23	19, 22	raleqbidv 3318	. . . 4 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (∀𝑗 ∈ (0..^(♯‘𝑐))(𝑐‘𝑗) ∼ (lastS‘𝑐) ↔ ∀𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩))))
24	17, 23	bitrid 283	. . 3 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (∀𝑖 ∈ (0..^(♯‘𝑐))(𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ ∀𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩))))
25		fveq2 6842	. . . . 5 ⊢ (𝑐 = 𝐶 → (♯‘𝑐) = (♯‘𝐶))
26	25	oveq2d 7384	. . . 4 ⊢ (𝑐 = 𝐶 → (0..^(♯‘𝑐)) = (0..^(♯‘𝐶)))
27		fveq1 6841	. . . . 5 ⊢ (𝑐 = 𝐶 → (𝑐‘𝑖) = (𝐶‘𝑖))
28		fveq2 6842	. . . . 5 ⊢ (𝑐 = 𝐶 → (lastS‘𝑐) = (lastS‘𝐶))
29	27, 28	breq12d 5113	. . . 4 ⊢ (𝑐 = 𝐶 → ((𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ (𝐶‘𝑖) ∼ (lastS‘𝐶)))
30	26, 29	raleqbidv 3318	. . 3 ⊢ (𝑐 = 𝐶 → (∀𝑖 ∈ (0..^(♯‘𝑐))(𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ ∀𝑖 ∈ (0..^(♯‘𝐶))(𝐶‘𝑖) ∼ (lastS‘𝐶)))
31		chner.2	. . 3 ⊢ (𝜑 → 𝐶 ∈ ( ∼ Chain 𝐴))
32		0nnn 12193	. . . . . . 7 ⊢ ¬ 0 ∈ ℕ
33		hash0 14302	. . . . . . . 8 ⊢ (♯‘∅) = 0
34	33	eleq1i 2828	. . . . . . 7 ⊢ ((♯‘∅) ∈ ℕ ↔ 0 ∈ ℕ)
35	32, 34	mtbir 323	. . . . . 6 ⊢ ¬ (♯‘∅) ∈ ℕ
36		fzo0n0 13644	. . . . . 6 ⊢ ((0..^(♯‘∅)) ≠ ∅ ↔ (♯‘∅) ∈ ℕ)
37	35, 36	mtbir 323	. . . . 5 ⊢ ¬ (0..^(♯‘∅)) ≠ ∅
38		nne 2937	. . . . 5 ⊢ (¬ (0..^(♯‘∅)) ≠ ∅ ↔ (0..^(♯‘∅)) = ∅)
39	37, 38	mpbi 230	. . . 4 ⊢ (0..^(♯‘∅)) = ∅
40		rzal 4449	. . . 4 ⊢ ((0..^(♯‘∅)) = ∅ → ∀𝑖 ∈ (0..^(♯‘∅))(∅‘𝑖) ∼ (lastS‘∅))
41	39, 40	mp1i 13	. . 3 ⊢ (𝜑 → ∀𝑖 ∈ (0..^(♯‘∅))(∅‘𝑖) ∼ (lastS‘∅))
42		chner.1	. . . . . . . 8 ⊢ (𝜑 → ∼ Er 𝐴)
43	42	ad6antr 737	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → ∼ Er 𝐴)
44		simp-5r 786	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑥 ∈ 𝐴)
45	43, 44	erref 8666	. . . . . 6 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑥 ∼ 𝑥)
46		simp-6r 788	. . . . . . . 8 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑑 ∈ ( ∼ Chain 𝐴))
47	46	chnwrd 18543	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑑 ∈ Word 𝐴)
48		simplr 769	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩))))
49		ccatws1len 14556	. . . . . . . . . . . . . 14 ⊢ (𝑑 ∈ Word 𝐴 → (♯‘(𝑑 ++ ⟨“𝑥”⟩)) = ((♯‘𝑑) + 1))
50	47, 49	syl 17	. . . . . . . . . . . . 13 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (♯‘(𝑑 ++ ⟨“𝑥”⟩)) = ((♯‘𝑑) + 1))
51		fveq2 6842	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑑 = ∅ → (♯‘𝑑) = (♯‘∅))
52	51, 33	eqtr2di 2789	. . . . . . . . . . . . . . . . 17 ⊢ (𝑑 = ∅ → 0 = (♯‘𝑑))
53	52	eqcomd 2743	. . . . . . . . . . . . . . . 16 ⊢ (𝑑 = ∅ → (♯‘𝑑) = 0)
54	53	adantl 481	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (♯‘𝑑) = 0)
55	54	oveq1d 7383	. . . . . . . . . . . . . 14 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → ((♯‘𝑑) + 1) = (0 + 1))
56		0p1e1 12274	. . . . . . . . . . . . . 14 ⊢ (0 + 1) = 1
57	55, 56	eqtrdi 2788	. . . . . . . . . . . . 13 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → ((♯‘𝑑) + 1) = 1)
58	50, 57	eqtrd 2772	. . . . . . . . . . . 12 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (♯‘(𝑑 ++ ⟨“𝑥”⟩)) = 1)
59	58	oveq2d 7384	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩))) = (0..^1))
60	48, 59	eleqtrd 2839	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑗 ∈ (0..^1))
61		fzo01 13675	. . . . . . . . . . 11 ⊢ (0..^1) = {0}
62	61	a1i 11	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (0..^1) = {0})
63	60, 62	eleqtrd 2839	. . . . . . . . 9 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑗 ∈ {0})
64		elsni 4599	. . . . . . . . 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 2772	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑗 = (♯‘𝑑))
68		ccats1val2 14563	. . . . . . 7 ⊢ ((𝑑 ∈ Word 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ 𝑗 = (♯‘𝑑)) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) = 𝑥)
69	47, 44, 67, 68	syl3anc 1374	. . . . . 6 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) = 𝑥)
70		lswccats1 14570	. . . . . . 7 ⊢ ((𝑑 ∈ Word 𝐴 ∧ 𝑥 ∈ 𝐴) → (lastS‘(𝑑 ++ ⟨“𝑥”⟩)) = 𝑥)
71	47, 44, 70	syl2anc 585	. . . . . 6 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (lastS‘(𝑑 ++ ⟨“𝑥”⟩)) = 𝑥)
72	45, 69, 71	3brtr4d 5132	. . . . 5 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩)))
73	42	ad6antr 737	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → ∼ Er 𝐴)
74		simp-6r 788	. . . . . . . . . . . 12 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → 𝑑 ∈ ( ∼ Chain 𝐴))
75	74	chnwrd 18543	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → 𝑑 ∈ Word 𝐴)
76	75	adantr 480	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → 𝑑 ∈ Word 𝐴)
77		simp-6r 788	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → 𝑥 ∈ 𝐴)
78		simpr 484	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → 𝑗 = (♯‘𝑑))
79	76, 77, 78, 68	syl3anc 1374	. . . . . . . . 9 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) = 𝑥)
80		simp-4r 784	. . . . . . . . . . . 12 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥))
81		neneq 2939	. . . . . . . . . . . . 13 ⊢ (𝑑 ≠ ∅ → ¬ 𝑑 = ∅)
82	81	adantl 481	. . . . . . . . . . . 12 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → ¬ 𝑑 = ∅)
83	80, 82	orcnd 879	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → (lastS‘𝑑) ∼ 𝑥)
84	73, 83	ersym 8658	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → 𝑥 ∼ (lastS‘𝑑))
85	84	adantr 480	. . . . . . . . 9 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → 𝑥 ∼ (lastS‘𝑑))
86	79, 85	eqbrtrd 5122	. . . . . . . 8 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘𝑑))
87		fveq2 6842	. . . . . . . . . 10 ⊢ (𝑖 = 𝑗 → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) = ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗))
88	87	breq1d 5110	. . . . . . . . 9 ⊢ (𝑖 = 𝑗 → (((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) ∼ (lastS‘𝑑) ↔ ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘𝑑)))
89		simpr 484	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) → ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑))
90	89	ad3antrrr 731	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑))
91		simplr 769	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → 𝑑 ∈ ( ∼ Chain 𝐴))
92	91	chnwrd 18543	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → 𝑑 ∈ Word 𝐴)
93		simpr 484	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → 𝑖 ∈ (0..^(♯‘𝑑)))
94		ccats1val1 14562	. . . . . . . . . . . . . . 15 ⊢ ((𝑑 ∈ Word 𝐴 ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) = (𝑑‘𝑖))
95	92, 93, 94	syl2anc 585	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) = (𝑑‘𝑖))
96	95	eqcomd 2743	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → (𝑑‘𝑖) = ((𝑑 ++ ⟨“𝑥”⟩)‘𝑖))
97	96	breq1d 5110	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → ((𝑑‘𝑖) ∼ (lastS‘𝑑) ↔ ((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) ∼ (lastS‘𝑑)))
98	97	ralbidva 3159	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) → (∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑) ↔ ∀𝑖 ∈ (0..^(♯‘𝑑))((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) ∼ (lastS‘𝑑)))
99	98	ad6antr 737	. . . . . . . . . 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 786	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → 𝑑 ∈ ( ∼ Chain 𝐴))
103	102	chnwrd 18543	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → 𝑑 ∈ Word 𝐴)
104	103, 49	syl 17	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → (♯‘(𝑑 ++ ⟨“𝑥”⟩)) = ((♯‘𝑑) + 1))
105	104	oveq2d 7384	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩))) = (0..^((♯‘𝑑) + 1)))
106	101, 105	eleqtrd 2839	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → 𝑗 ∈ (0..^((♯‘𝑑) + 1)))
107	106	ad2antrr 727	. . . . . . . . . . 11 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → 𝑗 ∈ (0..^((♯‘𝑑) + 1)))
108		simp-7r 790	. . . . . . . . . . . . . 14 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → 𝑑 ∈ ( ∼ Chain 𝐴))
109	108	chnwrd 18543	. . . . . . . . . . . . 13 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → 𝑑 ∈ Word 𝐴)
110		lencl 14468	. . . . . . . . . . . . 13 ⊢ (𝑑 ∈ Word 𝐴 → (♯‘𝑑) ∈ ℕ₀)
111		nn0uz 12801	. . . . . . . . . . . . . . 15 ⊢ ℕ₀ = (ℤ_≥‘0)
112	111	eleq2i 2829	. . . . . . . . . . . . . 14 ⊢ ((♯‘𝑑) ∈ ℕ₀ ↔ (♯‘𝑑) ∈ (ℤ_≥‘0))
113	112	biimpi 216	. . . . . . . . . . . . 13 ⊢ ((♯‘𝑑) ∈ ℕ₀ → (♯‘𝑑) ∈ (ℤ_≥‘0))
114	109, 110, 113	3syl 18	. . . . . . . . . . . 12 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → (♯‘𝑑) ∈ (ℤ_≥‘0))
115		fzosplitsni 13707	. . . . . . . . . . . 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 2934	. . . . . . . . . . 11 ⊢ (𝑗 ≠ (♯‘𝑑) ↔ ¬ 𝑗 = (♯‘𝑑))
120	118, 119	sylib 218	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → ¬ 𝑗 = (♯‘𝑑))
121	117, 120	olcnd 878	. . . . . . . . 9 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → 𝑗 ∈ (0..^(♯‘𝑑)))
122	88, 100, 121	rspcdva 3579	. . . . . . . 8 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘𝑑))
123	86, 122	pm2.61dane 3020	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘𝑑))
124	73, 123, 83	ertrd 8662	. . . . . 6 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ 𝑥)
125		simp-5r 786	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → 𝑥 ∈ 𝐴)
126	75, 125, 70	syl2anc 585	. . . . . 6 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → (lastS‘(𝑑 ++ ⟨“𝑥”⟩)) = 𝑥)
127	124, 126	breqtrrd 5128	. . . . 5 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩)))
128	72, 127	pm2.61dane 3020	. . . 4 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩)))
129	128	ralrimiva 3130	. . 3 ⊢ (((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) → ∀𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩)))
130	8, 14, 24, 30, 31, 41, 129	chnind 18556	. 2 ⊢ (𝜑 → ∀𝑖 ∈ (0..^(♯‘𝐶))(𝐶‘𝑖) ∼ (lastS‘𝐶))
131		chner.3	. 2 ⊢ (𝜑 → 𝐽 ∈ (0..^(♯‘𝐶)))
132	2, 130, 131	rspcdva 3579	1 ⊢ (𝜑 → (𝐶‘𝐽) ∼ (lastS‘𝐶))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 848 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∀wral 3052 ∅c0 4287 {csn 4582 class class class wbr 5100 ‘cfv 6500 (class class class)co 7368 Er wer 8642 0cc0 11038 1c1 11039 + caddc 11041 ℕcn 12157 ℕ₀cn0 12413 ℤ_≥cuz 12763 ..^cfzo 13582 ♯chash 14265 Word cword 14448 lastSclsw 14497 ++ cconcat 14505 ⟨“cs1 14531 Chain cchn 18540

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 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-card 9863 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-n0 12414 df-xnn0 12487 df-z 12501 df-uz 12764 df-rp 12918 df-fz 13436 df-fzo 13583 df-hash 14266 df-word 14449 df-lsw 14498 df-concat 14506 df-s1 14532 df-substr 14577 df-pfx 14607 df-chn 18541

This theorem is referenced by: chnerlem2 47241

W3C validator