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 47489

Description: In a chain constructed on an equivalence relation, the last element is equivalent to any. This theorem is a translation of chnub 18677 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 6882	. . 3 ⊢ (𝑖 = 𝐽 → (𝐶‘𝑖) = (𝐶‘𝐽))
2	1	breq1d 5123	. 2 ⊢ (𝑖 = 𝐽 → ((𝐶‘𝑖) ∼ (lastS‘𝐶) ↔ (𝐶‘𝐽) ∼ (lastS‘𝐶)))
3		fveq2 6882	. . . . 5 ⊢ (𝑐 = ∅ → (♯‘𝑐) = (♯‘∅))
4	3	oveq2d 7427	. . . 4 ⊢ (𝑐 = ∅ → (0..^(♯‘𝑐)) = (0..^(♯‘∅)))
5		fveq1 6881	. . . . 5 ⊢ (𝑐 = ∅ → (𝑐‘𝑖) = (∅‘𝑖))
6		fveq2 6882	. . . . 5 ⊢ (𝑐 = ∅ → (lastS‘𝑐) = (lastS‘∅))
7	5, 6	breq12d 5126	. . . 4 ⊢ (𝑐 = ∅ → ((𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ (∅‘𝑖) ∼ (lastS‘∅)))
8	4, 7	raleqbidv 3345	. . 3 ⊢ (𝑐 = ∅ → (∀𝑖 ∈ (0..^(♯‘𝑐))(𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ ∀𝑖 ∈ (0..^(♯‘∅))(∅‘𝑖) ∼ (lastS‘∅)))
9		fveq2 6882	. . . . 5 ⊢ (𝑐 = 𝑑 → (♯‘𝑐) = (♯‘𝑑))
10	9	oveq2d 7427	. . . 4 ⊢ (𝑐 = 𝑑 → (0..^(♯‘𝑐)) = (0..^(♯‘𝑑)))
11		fveq1 6881	. . . . 5 ⊢ (𝑐 = 𝑑 → (𝑐‘𝑖) = (𝑑‘𝑖))
12		fveq2 6882	. . . . 5 ⊢ (𝑐 = 𝑑 → (lastS‘𝑐) = (lastS‘𝑑))
13	11, 12	breq12d 5126	. . . 4 ⊢ (𝑐 = 𝑑 → ((𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ (𝑑‘𝑖) ∼ (lastS‘𝑑)))
14	10, 13	raleqbidv 3345	. . 3 ⊢ (𝑐 = 𝑑 → (∀𝑖 ∈ (0..^(♯‘𝑐))(𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)))
15		fveq2 6882	. . . . . 6 ⊢ (𝑖 = 𝑗 → (𝑐‘𝑖) = (𝑐‘𝑗))
16	15	breq1d 5123	. . . . 5 ⊢ (𝑖 = 𝑗 → ((𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ (𝑐‘𝑗) ∼ (lastS‘𝑐)))
17	16	cbvralvw 3249	. . . 4 ⊢ (∀𝑖 ∈ (0..^(♯‘𝑐))(𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ ∀𝑗 ∈ (0..^(♯‘𝑐))(𝑐‘𝑗) ∼ (lastS‘𝑐))
18		fveq2 6882	. . . . . 6 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (♯‘𝑐) = (♯‘(𝑑 ++ ⟨“𝑥”⟩)))
19	18	oveq2d 7427	. . . . 5 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (0..^(♯‘𝑐)) = (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩))))
20		fveq1 6881	. . . . . 6 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (𝑐‘𝑗) = ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗))
21		fveq2 6882	. . . . . 6 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (lastS‘𝑐) = (lastS‘(𝑑 ++ ⟨“𝑥”⟩)))
22	20, 21	breq12d 5126	. . . . 5 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → ((𝑐‘𝑗) ∼ (lastS‘𝑐) ↔ ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩))))
23	19, 22	raleqbidv 3345	. . . 4 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (∀𝑗 ∈ (0..^(♯‘𝑐))(𝑐‘𝑗) ∼ (lastS‘𝑐) ↔ ∀𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩))))
24	17, 23	bitrid 286	. . 3 ⊢ (𝑐 = (𝑑 ++ ⟨“𝑥”⟩) → (∀𝑖 ∈ (0..^(♯‘𝑐))(𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ ∀𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩))))
25		fveq2 6882	. . . . 5 ⊢ (𝑐 = 𝐶 → (♯‘𝑐) = (♯‘𝐶))
26	25	oveq2d 7427	. . . 4 ⊢ (𝑐 = 𝐶 → (0..^(♯‘𝑐)) = (0..^(♯‘𝐶)))
27		fveq1 6881	. . . . 5 ⊢ (𝑐 = 𝐶 → (𝑐‘𝑖) = (𝐶‘𝑖))
28		fveq2 6882	. . . . 5 ⊢ (𝑐 = 𝐶 → (lastS‘𝑐) = (lastS‘𝐶))
29	27, 28	breq12d 5126	. . . 4 ⊢ (𝑐 = 𝐶 → ((𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ (𝐶‘𝑖) ∼ (lastS‘𝐶)))
30	26, 29	raleqbidv 3345	. . 3 ⊢ (𝑐 = 𝐶 → (∀𝑖 ∈ (0..^(♯‘𝑐))(𝑐‘𝑖) ∼ (lastS‘𝑐) ↔ ∀𝑖 ∈ (0..^(♯‘𝐶))(𝐶‘𝑖) ∼ (lastS‘𝐶)))
31		chner.2	. . 3 ⊢ (𝜑 → 𝐶 ∈ ( ∼ Chain 𝐴))
32		0nnn 12271	. . . . . . 7 ⊢ ¬ 0 ∈ ℕ
33		hash0 14402	. . . . . . . 8 ⊢ (♯‘∅) = 0
34	33	eleq1i 2860	. . . . . . 7 ⊢ ((♯‘∅) ∈ ℕ ↔ 0 ∈ ℕ)
35	32, 34	mtbir 326	. . . . . 6 ⊢ ¬ (♯‘∅) ∈ ℕ
36		fzo0n0 13744	. . . . . 6 ⊢ ((0..^(♯‘∅)) ≠ ∅ ↔ (♯‘∅) ∈ ℕ)
37	35, 36	mtbir 326	. . . . 5 ⊢ ¬ (0..^(♯‘∅)) ≠ ∅
38		nne 2968	. . . . 5 ⊢ (¬ (0..^(♯‘∅)) ≠ ∅ ↔ (0..^(♯‘∅)) = ∅)
39	37, 38	mpbi 233	. . . 4 ⊢ (0..^(♯‘∅)) = ∅
40		rzal 4460	. . . 4 ⊢ ((0..^(♯‘∅)) = ∅ → ∀𝑖 ∈ (0..^(♯‘∅))(∅‘𝑖) ∼ (lastS‘∅))
41	39, 40	mp1i 14	. . 3 ⊢ (𝜑 → ∀𝑖 ∈ (0..^(♯‘∅))(∅‘𝑖) ∼ (lastS‘∅))
42		chner.1	. . . . . . . 8 ⊢ (𝜑 → ∼ Er 𝐴)
43	42	ad6antr 748	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → ∼ Er 𝐴)
44		simp-5r 797	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑥 ∈ 𝐴)
45	43, 44	erref 8714	. . . . . 6 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑥 ∼ 𝑥)
46		simp-6r 799	. . . . . . . 8 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑑 ∈ ( ∼ Chain 𝐴))
47	46	chnwrd 18663	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑑 ∈ Word 𝐴)
48		simplr 780	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩))))
49		ccatws1len 14657	. . . . . . . . . . . . . 14 ⊢ (𝑑 ∈ Word 𝐴 → (♯‘(𝑑 ++ ⟨“𝑥”⟩)) = ((♯‘𝑑) + 1))
50	47, 49	syl 18	. . . . . . . . . . . . 13 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (♯‘(𝑑 ++ ⟨“𝑥”⟩)) = ((♯‘𝑑) + 1))
51		fveq2 6882	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑑 = ∅ → (♯‘𝑑) = (♯‘∅))
52	51, 33	eqtr2di 2821	. . . . . . . . . . . . . . . . 17 ⊢ (𝑑 = ∅ → 0 = (♯‘𝑑))
53	52	eqcomd 2775	. . . . . . . . . . . . . . . 16 ⊢ (𝑑 = ∅ → (♯‘𝑑) = 0)
54	53	adantl 486	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (♯‘𝑑) = 0)
55	54	oveq1d 7426	. . . . . . . . . . . . . 14 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → ((♯‘𝑑) + 1) = (0 + 1))
56		0p1e1 12360	. . . . . . . . . . . . . 14 ⊢ (0 + 1) = 1
57	55, 56	eqtrdi 2820	. . . . . . . . . . . . 13 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → ((♯‘𝑑) + 1) = 1)
58	50, 57	eqtrd 2804	. . . . . . . . . . . 12 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (♯‘(𝑑 ++ ⟨“𝑥”⟩)) = 1)
59	58	oveq2d 7427	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩))) = (0..^1))
60	48, 59	eleqtrd 2871	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑗 ∈ (0..^1))
61		fzo01 13775	. . . . . . . . . . 11 ⊢ (0..^1) = {0}
62	61	a1i 11	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (0..^1) = {0})
63	60, 62	eleqtrd 2871	. . . . . . . . 9 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑗 ∈ {0})
64		elsni 4611	. . . . . . . . 9 ⊢ (𝑗 ∈ {0} → 𝑗 = 0)
65	63, 64	syl 18	. . . . . . . 8 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑗 = 0)
66	52	adantl 486	. . . . . . . 8 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 0 = (♯‘𝑑))
67	65, 66	eqtrd 2804	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → 𝑗 = (♯‘𝑑))
68		ccats1val2 14664	. . . . . . 7 ⊢ ((𝑑 ∈ Word 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ 𝑗 = (♯‘𝑑)) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) = 𝑥)
69	47, 44, 67, 68	syl3anc 1396	. . . . . 6 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) = 𝑥)
70		lswccats1 14671	. . . . . . 7 ⊢ ((𝑑 ∈ Word 𝐴 ∧ 𝑥 ∈ 𝐴) → (lastS‘(𝑑 ++ ⟨“𝑥”⟩)) = 𝑥)
71	47, 44, 70	syl2anc 595	. . . . . 6 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → (lastS‘(𝑑 ++ ⟨“𝑥”⟩)) = 𝑥)
72	45, 69, 71	3brtr4d 5147	. . . . 5 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 = ∅) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩)))
73	42	ad6antr 748	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → ∼ Er 𝐴)
74		simp-6r 799	. . . . . . . . . . . 12 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → 𝑑 ∈ ( ∼ Chain 𝐴))
75	74	chnwrd 18663	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → 𝑑 ∈ Word 𝐴)
76	75	adantr 485	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → 𝑑 ∈ Word 𝐴)
77		simp-6r 799	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → 𝑥 ∈ 𝐴)
78		simpr 489	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → 𝑗 = (♯‘𝑑))
79	76, 77, 78, 68	syl3anc 1396	. . . . . . . . 9 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) = 𝑥)
80		simp-4r 795	. . . . . . . . . . . 12 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥))
81		neneq 2970	. . . . . . . . . . . . 13 ⊢ (𝑑 ≠ ∅ → ¬ 𝑑 = ∅)
82	81	adantl 486	. . . . . . . . . . . 12 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → ¬ 𝑑 = ∅)
83	80, 82	orcnd 891	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → (lastS‘𝑑) ∼ 𝑥)
84	73, 83	ersym 8706	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → 𝑥 ∼ (lastS‘𝑑))
85	84	adantr 485	. . . . . . . . 9 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → 𝑥 ∼ (lastS‘𝑑))
86	79, 85	eqbrtrd 5137	. . . . . . . 8 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 = (♯‘𝑑)) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘𝑑))
87		fveq2 6882	. . . . . . . . . 10 ⊢ (𝑖 = 𝑗 → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) = ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗))
88	87	breq1d 5123	. . . . . . . . 9 ⊢ (𝑖 = 𝑗 → (((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) ∼ (lastS‘𝑑) ↔ ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘𝑑)))
89		simpr 489	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) → ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑))
90	89	ad3antrrr 742	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑))
91		simplr 780	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → 𝑑 ∈ ( ∼ Chain 𝐴))
92	91	chnwrd 18663	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → 𝑑 ∈ Word 𝐴)
93		simpr 489	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → 𝑖 ∈ (0..^(♯‘𝑑)))
94		ccats1val1 14663	. . . . . . . . . . . . . . 15 ⊢ ((𝑑 ∈ Word 𝐴 ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) = (𝑑‘𝑖))
95	92, 93, 94	syl2anc 595	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) = (𝑑‘𝑖))
96	95	eqcomd 2775	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → (𝑑‘𝑖) = ((𝑑 ++ ⟨“𝑥”⟩)‘𝑖))
97	96	breq1d 5123	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑖 ∈ (0..^(♯‘𝑑))) → ((𝑑‘𝑖) ∼ (lastS‘𝑑) ↔ ((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) ∼ (lastS‘𝑑)))
98	97	ralbidva 3192	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) → (∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑) ↔ ∀𝑖 ∈ (0..^(♯‘𝑑))((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) ∼ (lastS‘𝑑)))
99	98	ad6antr 748	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → (∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑) ↔ ∀𝑖 ∈ (0..^(♯‘𝑑))((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) ∼ (lastS‘𝑑)))
100	90, 99	mpbid 235	. . . . . . . . 9 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → ∀𝑖 ∈ (0..^(♯‘𝑑))((𝑑 ++ ⟨“𝑥”⟩)‘𝑖) ∼ (lastS‘𝑑))
101		simpr 489	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩))))
102		simp-5r 797	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → 𝑑 ∈ ( ∼ Chain 𝐴))
103	102	chnwrd 18663	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → 𝑑 ∈ Word 𝐴)
104	103, 49	syl 18	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → (♯‘(𝑑 ++ ⟨“𝑥”⟩)) = ((♯‘𝑑) + 1))
105	104	oveq2d 7427	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩))) = (0..^((♯‘𝑑) + 1)))
106	101, 105	eleqtrd 2871	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → 𝑗 ∈ (0..^((♯‘𝑑) + 1)))
107	106	ad2antrr 738	. . . . . . . . . . 11 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → 𝑗 ∈ (0..^((♯‘𝑑) + 1)))
108		simp-7r 801	. . . . . . . . . . . . . 14 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → 𝑑 ∈ ( ∼ Chain 𝐴))
109	108	chnwrd 18663	. . . . . . . . . . . . 13 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → 𝑑 ∈ Word 𝐴)
110		lencl 14569	. . . . . . . . . . . . 13 ⊢ (𝑑 ∈ Word 𝐴 → (♯‘𝑑) ∈ ℕ₀)
111		nn0uz 12899	. . . . . . . . . . . . . . 15 ⊢ ℕ₀ = (ℤ_≥‘0)
112	111	eleq2i 2861	. . . . . . . . . . . . . 14 ⊢ ((♯‘𝑑) ∈ ℕ₀ ↔ (♯‘𝑑) ∈ (ℤ_≥‘0))
113	112	biimpi 219	. . . . . . . . . . . . 13 ⊢ ((♯‘𝑑) ∈ ℕ₀ → (♯‘𝑑) ∈ (ℤ_≥‘0))
114	109, 110, 113	3syl 19	. . . . . . . . . . . 12 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → (♯‘𝑑) ∈ (ℤ_≥‘0))
115		fzosplitsni 13807	. . . . . . . . . . . 12 ⊢ ((♯‘𝑑) ∈ (ℤ_≥‘0) → (𝑗 ∈ (0..^((♯‘𝑑) + 1)) ↔ (𝑗 ∈ (0..^(♯‘𝑑)) ∨ 𝑗 = (♯‘𝑑))))
116	114, 115	syl 18	. . . . . . . . . . 11 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → (𝑗 ∈ (0..^((♯‘𝑑) + 1)) ↔ (𝑗 ∈ (0..^(♯‘𝑑)) ∨ 𝑗 = (♯‘𝑑))))
117	107, 116	mpbid 235	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → (𝑗 ∈ (0..^(♯‘𝑑)) ∨ 𝑗 = (♯‘𝑑)))
118		df-ne 2965	. . . . . . . . . . 11 ⊢ (𝑗 ≠ (♯‘𝑑) ↔ ¬ 𝑗 = (♯‘𝑑))
119	118	bilani 509	. . . . . . . . . 10 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → ¬ 𝑗 = (♯‘𝑑))
120	117, 119	olcnd 890	. . . . . . . . 9 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → 𝑗 ∈ (0..^(♯‘𝑑)))
121	88, 100, 120	rspcdva 3591	. . . . . . . 8 ⊢ ((((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) ∧ 𝑗 ≠ (♯‘𝑑)) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘𝑑))
122	86, 121	pm2.61dane 3051	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘𝑑))
123	73, 122, 83	ertrd 8710	. . . . . 6 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ 𝑥)
124		simp-5r 797	. . . . . . 7 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → 𝑥 ∈ 𝐴)
125	75, 124, 70	syl2anc 595	. . . . . 6 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → (lastS‘(𝑑 ++ ⟨“𝑥”⟩)) = 𝑥)
126	123, 125	breqtrrd 5143	. . . . 5 ⊢ (((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) ∧ 𝑑 ≠ ∅) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩)))
127	72, 126	pm2.61dane 3051	. . . 4 ⊢ ((((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) ∧ 𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))) → ((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩)))
128	127	ralrimiva 3163	. . 3 ⊢ (((((𝜑 ∧ 𝑑 ∈ ( ∼ Chain 𝐴)) ∧ 𝑥 ∈ 𝐴) ∧ (𝑑 = ∅ ∨ (lastS‘𝑑) ∼ 𝑥)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑑))(𝑑‘𝑖) ∼ (lastS‘𝑑)) → ∀𝑗 ∈ (0..^(♯‘(𝑑 ++ ⟨“𝑥”⟩)))((𝑑 ++ ⟨“𝑥”⟩)‘𝑗) ∼ (lastS‘(𝑑 ++ ⟨“𝑥”⟩)))
129	8, 14, 24, 30, 31, 41, 128	chnind 18676	. 2 ⊢ (𝜑 → ∀𝑖 ∈ (0..^(♯‘𝐶))(𝐶‘𝑖) ∼ (lastS‘𝐶))
130		chner.3	. 2 ⊢ (𝜑 → 𝐽 ∈ (0..^(♯‘𝐶)))
131	2, 129, 130	rspcdva 3591	1 ⊢ (𝜑 → (𝐶‘𝐽) ∼ (lastS‘𝐶))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∀wral 3085 ∅c0 4294 {csn 4594 class class class wbr 5113 ‘cfv 6537 (class class class)co 7411 Er wer 8690 0cc0 11099 1c1 11100 + caddc 11102 ℕcn 12232 ℕ₀cn0 12503 ℤ_≥cuz 12861 ..^cfzo 13681 ♯chash 14365 Word cword 14549 lastSclsw 14598 ++ cconcat 14606 ⟨“cs1 14632 Chain cchn 18660

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-card 9924 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-nn 12233 df-n0 12504 df-xnn0 12577 df-z 12591 df-uz 12862 df-rp 13016 df-fz 13535 df-fzo 13682 df-hash 14366 df-word 14550 df-lsw 14599 df-concat 14607 df-s1 14633 df-substr 14678 df-pfx 14708 df-chn 18661

This theorem is referenced by: chnerlem2 47490

W3C validator