chnccats1 - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > chnccats1		Structured version Visualization version GIF version

Theorem chnccats1 32948

Description: Extend a chain with a single element. (Contributed by Thierry Arnoux, 19-Oct-2025.)

**Hypotheses**
Ref	Expression
chnccats1.1	⊢ (𝜑 → 𝑋 ∈ 𝐴)
chnccats1.2	⊢ (𝜑 → 𝑇 ∈ ( < Chain𝐴))
chnccats1.3	⊢ (𝜑 → (𝑇 = ∅ ∨ (lastS‘𝑇) < 𝑋))

**Assertion**
Ref	Expression
chnccats1	⊢ (𝜑 → (𝑇 ++ ⟨“𝑋”⟩) ∈ ( < Chain𝐴))

Proof of Theorem chnccats1 Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		chnccats1.2	. . . 4 ⊢ (𝜑 → 𝑇 ∈ ( < Chain𝐴))
2	1	chnwrd 32940	. . 3 ⊢ (𝜑 → 𝑇 ∈ Word 𝐴)
3		chnccats1.1	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
4	3	s1cld 14575	. . 3 ⊢ (𝜑 → ⟨“𝑋”⟩ ∈ Word 𝐴)
5		ccatcl 14546	. . 3 ⊢ ((𝑇 ∈ Word 𝐴 ∧ ⟨“𝑋”⟩ ∈ Word 𝐴) → (𝑇 ++ ⟨“𝑋”⟩) ∈ Word 𝐴)
6	2, 4, 5	syl2anc 584	. 2 ⊢ (𝜑 → (𝑇 ++ ⟨“𝑋”⟩) ∈ Word 𝐴)
7		eqidd 2731	. . . . . . . . . . . 12 ⊢ (𝜑 → (♯‘𝑇) = (♯‘𝑇))
8	7, 2	wrdfd 14491	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑇:(0..^(♯‘𝑇))⟶𝐴)
9	8	fdmd 6701	. . . . . . . . . 10 ⊢ (𝜑 → dom 𝑇 = (0..^(♯‘𝑇)))
10	9	difeq1d 4091	. . . . . . . . 9 ⊢ (𝜑 → (dom 𝑇 ∖ {0}) = ((0..^(♯‘𝑇)) ∖ {0}))
11	10	eleq2d 2815	. . . . . . . 8 ⊢ (𝜑 → (𝑛 ∈ (dom 𝑇 ∖ {0}) ↔ 𝑛 ∈ ((0..^(♯‘𝑇)) ∖ {0})))
12	11	biimpar 477	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ((0..^(♯‘𝑇)) ∖ {0})) → 𝑛 ∈ (dom 𝑇 ∖ {0}))
13		ischn 32939	. . . . . . . . . 10 ⊢ (𝑇 ∈ ( < Chain𝐴) ↔ (𝑇 ∈ Word 𝐴 ∧ ∀𝑛 ∈ (dom 𝑇 ∖ {0})(𝑇‘(𝑛 − 1)) < (𝑇‘𝑛)))
14	1, 13	sylib 218	. . . . . . . . 9 ⊢ (𝜑 → (𝑇 ∈ Word 𝐴 ∧ ∀𝑛 ∈ (dom 𝑇 ∖ {0})(𝑇‘(𝑛 − 1)) < (𝑇‘𝑛)))
15	14	simprd 495	. . . . . . . 8 ⊢ (𝜑 → ∀𝑛 ∈ (dom 𝑇 ∖ {0})(𝑇‘(𝑛 − 1)) < (𝑇‘𝑛))
16	15	r19.21bi 3230	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (dom 𝑇 ∖ {0})) → (𝑇‘(𝑛 − 1)) < (𝑇‘𝑛))
17	12, 16	syldan 591	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ((0..^(♯‘𝑇)) ∖ {0})) → (𝑇‘(𝑛 − 1)) < (𝑇‘𝑛))
18	2	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ((0..^(♯‘𝑇)) ∖ {0})) → 𝑇 ∈ Word 𝐴)
19		simpr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ((0..^(♯‘𝑇)) ∖ {0})) → 𝑛 ∈ ((0..^(♯‘𝑇)) ∖ {0}))
20		lencl 14505	. . . . . . . . 9 ⊢ (𝑇 ∈ Word 𝐴 → (♯‘𝑇) ∈ ℕ₀)
21	18, 20	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ((0..^(♯‘𝑇)) ∖ {0})) → (♯‘𝑇) ∈ ℕ₀)
22	19, 21	elfzodif0 32724	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ((0..^(♯‘𝑇)) ∖ {0})) → (𝑛 − 1) ∈ (0..^(♯‘𝑇)))
23		ccats1val1 14598	. . . . . . 7 ⊢ ((𝑇 ∈ Word 𝐴 ∧ (𝑛 − 1) ∈ (0..^(♯‘𝑇))) → ((𝑇 ++ ⟨“𝑋”⟩)‘(𝑛 − 1)) = (𝑇‘(𝑛 − 1)))
24	18, 22, 23	syl2anc 584	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ((0..^(♯‘𝑇)) ∖ {0})) → ((𝑇 ++ ⟨“𝑋”⟩)‘(𝑛 − 1)) = (𝑇‘(𝑛 − 1)))
25	19	eldifad 3929	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ((0..^(♯‘𝑇)) ∖ {0})) → 𝑛 ∈ (0..^(♯‘𝑇)))
26		ccats1val1 14598	. . . . . . 7 ⊢ ((𝑇 ∈ Word 𝐴 ∧ 𝑛 ∈ (0..^(♯‘𝑇))) → ((𝑇 ++ ⟨“𝑋”⟩)‘𝑛) = (𝑇‘𝑛))
27	18, 25, 26	syl2anc 584	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ((0..^(♯‘𝑇)) ∖ {0})) → ((𝑇 ++ ⟨“𝑋”⟩)‘𝑛) = (𝑇‘𝑛))
28	17, 24, 27	3brtr4d 5142	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ((0..^(♯‘𝑇)) ∖ {0})) → ((𝑇 ++ ⟨“𝑋”⟩)‘(𝑛 − 1)) < ((𝑇 ++ ⟨“𝑋”⟩)‘𝑛))
29	28	adantlr 715	. . . 4 ⊢ (((𝜑 ∧ 𝑛 ∈ (dom (𝑇 ++ ⟨“𝑋”⟩) ∖ {0})) ∧ 𝑛 ∈ ((0..^(♯‘𝑇)) ∖ {0})) → ((𝑇 ++ ⟨“𝑋”⟩)‘(𝑛 − 1)) < ((𝑇 ++ ⟨“𝑋”⟩)‘𝑛))
30		simpr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) → 𝑛 ∈ ({(♯‘𝑇)} ∖ {0}))
31	30	adantr 480	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ 𝑇 = ∅) → 𝑛 ∈ ({(♯‘𝑇)} ∖ {0}))
32		noel 4304	. . . . . . . 8 ⊢ ¬ 𝑛 ∈ ∅
33		fveq2 6861	. . . . . . . . . . . . . 14 ⊢ (𝑇 = ∅ → (♯‘𝑇) = (♯‘∅))
34		hash0 14339	. . . . . . . . . . . . . 14 ⊢ (♯‘∅) = 0
35	33, 34	eqtrdi 2781	. . . . . . . . . . . . 13 ⊢ (𝑇 = ∅ → (♯‘𝑇) = 0)
36	35	adantl 481	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ 𝑇 = ∅) → (♯‘𝑇) = 0)
37	36	sneqd 4604	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ 𝑇 = ∅) → {(♯‘𝑇)} = {0})
38	37	difeq1d 4091	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ 𝑇 = ∅) → ({(♯‘𝑇)} ∖ {0}) = ({0} ∖ {0}))
39		difid 4342	. . . . . . . . . 10 ⊢ ({0} ∖ {0}) = ∅
40	38, 39	eqtrdi 2781	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ 𝑇 = ∅) → ({(♯‘𝑇)} ∖ {0}) = ∅)
41	40	eleq2d 2815	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ 𝑇 = ∅) → (𝑛 ∈ ({(♯‘𝑇)} ∖ {0}) ↔ 𝑛 ∈ ∅))
42	32, 41	mtbiri 327	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ 𝑇 = ∅) → ¬ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0}))
43	31, 42	pm2.21dd 195	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ 𝑇 = ∅) → ((𝑇 ++ ⟨“𝑋”⟩)‘(𝑛 − 1)) < ((𝑇 ++ ⟨“𝑋”⟩)‘𝑛))
44		simpr 484	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ (lastS‘𝑇) < 𝑋) → (lastS‘𝑇) < 𝑋)
45	30	eldifad 3929	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) → 𝑛 ∈ {(♯‘𝑇)})
46	45	elsnd 4610	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) → 𝑛 = (♯‘𝑇))
47	46	oveq1d 7405	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) → (𝑛 − 1) = ((♯‘𝑇) − 1))
48	47	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ (lastS‘𝑇) < 𝑋) → (𝑛 − 1) = ((♯‘𝑇) − 1))
49	48	fveq2d 6865	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ (lastS‘𝑇) < 𝑋) → (𝑇‘(𝑛 − 1)) = (𝑇‘((♯‘𝑇) − 1)))
50	2	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ (lastS‘𝑇) < 𝑋) → 𝑇 ∈ Word 𝐴)
51	2	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) → 𝑇 ∈ Word 𝐴)
52	51, 20	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) → (♯‘𝑇) ∈ ℕ₀)
53	46, 30	eqeltrrd 2830	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) → (♯‘𝑇) ∈ ({(♯‘𝑇)} ∖ {0}))
54	53	eldifbd 3930	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) → ¬ (♯‘𝑇) ∈ {0})
55	52, 54	eldifd 3928	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) → (♯‘𝑇) ∈ (ℕ₀ ∖ {0}))
56		dfn2 12462	. . . . . . . . . . . . 13 ⊢ ℕ = (ℕ₀ ∖ {0})
57	55, 56	eleqtrrdi 2840	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) → (♯‘𝑇) ∈ ℕ)
58		fzo0end 13726	. . . . . . . . . . . 12 ⊢ ((♯‘𝑇) ∈ ℕ → ((♯‘𝑇) − 1) ∈ (0..^(♯‘𝑇)))
59	57, 58	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) → ((♯‘𝑇) − 1) ∈ (0..^(♯‘𝑇)))
60	47, 59	eqeltrd 2829	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) → (𝑛 − 1) ∈ (0..^(♯‘𝑇)))
61	60	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ (lastS‘𝑇) < 𝑋) → (𝑛 − 1) ∈ (0..^(♯‘𝑇)))
62	50, 61, 23	syl2anc 584	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ (lastS‘𝑇) < 𝑋) → ((𝑇 ++ ⟨“𝑋”⟩)‘(𝑛 − 1)) = (𝑇‘(𝑛 − 1)))
63		lsw 14536	. . . . . . . . 9 ⊢ (𝑇 ∈ Word 𝐴 → (lastS‘𝑇) = (𝑇‘((♯‘𝑇) − 1)))
64	50, 63	syl 17	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ (lastS‘𝑇) < 𝑋) → (lastS‘𝑇) = (𝑇‘((♯‘𝑇) − 1)))
65	49, 62, 64	3eqtr4d 2775	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ (lastS‘𝑇) < 𝑋) → ((𝑇 ++ ⟨“𝑋”⟩)‘(𝑛 − 1)) = (lastS‘𝑇))
66	46	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ (lastS‘𝑇) < 𝑋) → 𝑛 = (♯‘𝑇))
67	66	fveq2d 6865	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ (lastS‘𝑇) < 𝑋) → ((𝑇 ++ ⟨“𝑋”⟩)‘𝑛) = ((𝑇 ++ ⟨“𝑋”⟩)‘(♯‘𝑇)))
68	3	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ (lastS‘𝑇) < 𝑋) → 𝑋 ∈ 𝐴)
69		eqidd 2731	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ (lastS‘𝑇) < 𝑋) → (♯‘𝑇) = (♯‘𝑇))
70		ccats1val2 14599	. . . . . . . . 9 ⊢ ((𝑇 ∈ Word 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (♯‘𝑇) = (♯‘𝑇)) → ((𝑇 ++ ⟨“𝑋”⟩)‘(♯‘𝑇)) = 𝑋)
71	50, 68, 69, 70	syl3anc 1373	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ (lastS‘𝑇) < 𝑋) → ((𝑇 ++ ⟨“𝑋”⟩)‘(♯‘𝑇)) = 𝑋)
72	67, 71	eqtrd 2765	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ (lastS‘𝑇) < 𝑋) → ((𝑇 ++ ⟨“𝑋”⟩)‘𝑛) = 𝑋)
73	44, 65, 72	3brtr4d 5142	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) ∧ (lastS‘𝑇) < 𝑋) → ((𝑇 ++ ⟨“𝑋”⟩)‘(𝑛 − 1)) < ((𝑇 ++ ⟨“𝑋”⟩)‘𝑛))
74		chnccats1.3	. . . . . . 7 ⊢ (𝜑 → (𝑇 = ∅ ∨ (lastS‘𝑇) < 𝑋))
75	74	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) → (𝑇 = ∅ ∨ (lastS‘𝑇) < 𝑋))
76	43, 73, 75	mpjaodan 960	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) → ((𝑇 ++ ⟨“𝑋”⟩)‘(𝑛 − 1)) < ((𝑇 ++ ⟨“𝑋”⟩)‘𝑛))
77	76	adantlr 715	. . . 4 ⊢ (((𝜑 ∧ 𝑛 ∈ (dom (𝑇 ++ ⟨“𝑋”⟩) ∖ {0})) ∧ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})) → ((𝑇 ++ ⟨“𝑋”⟩)‘(𝑛 − 1)) < ((𝑇 ++ ⟨“𝑋”⟩)‘𝑛))
78		ccatws1len 14592	. . . . . . . . . . . . . 14 ⊢ (𝑇 ∈ Word 𝐴 → (♯‘(𝑇 ++ ⟨“𝑋”⟩)) = ((♯‘𝑇) + 1))
79	2, 78	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → (♯‘(𝑇 ++ ⟨“𝑋”⟩)) = ((♯‘𝑇) + 1))
80	79	eqcomd 2736	. . . . . . . . . . . 12 ⊢ (𝜑 → ((♯‘𝑇) + 1) = (♯‘(𝑇 ++ ⟨“𝑋”⟩)))
81	80, 6	wrdfd 14491	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑇 ++ ⟨“𝑋”⟩):(0..^((♯‘𝑇) + 1))⟶𝐴)
82	81	fdmd 6701	. . . . . . . . . 10 ⊢ (𝜑 → dom (𝑇 ++ ⟨“𝑋”⟩) = (0..^((♯‘𝑇) + 1)))
83	2, 20	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → (♯‘𝑇) ∈ ℕ₀)
84		nn0uz 12842	. . . . . . . . . . . 12 ⊢ ℕ₀ = (ℤ_≥‘0)
85	83, 84	eleqtrdi 2839	. . . . . . . . . . 11 ⊢ (𝜑 → (♯‘𝑇) ∈ (ℤ_≥‘0))
86		fzosplitsn 13743	. . . . . . . . . . 11 ⊢ ((♯‘𝑇) ∈ (ℤ_≥‘0) → (0..^((♯‘𝑇) + 1)) = ((0..^(♯‘𝑇)) ∪ {(♯‘𝑇)}))
87	85, 86	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (0..^((♯‘𝑇) + 1)) = ((0..^(♯‘𝑇)) ∪ {(♯‘𝑇)}))
88	82, 87	eqtrd 2765	. . . . . . . . 9 ⊢ (𝜑 → dom (𝑇 ++ ⟨“𝑋”⟩) = ((0..^(♯‘𝑇)) ∪ {(♯‘𝑇)}))
89	88	difeq1d 4091	. . . . . . . 8 ⊢ (𝜑 → (dom (𝑇 ++ ⟨“𝑋”⟩) ∖ {0}) = (((0..^(♯‘𝑇)) ∪ {(♯‘𝑇)}) ∖ {0}))
90		difundir 4257	. . . . . . . 8 ⊢ (((0..^(♯‘𝑇)) ∪ {(♯‘𝑇)}) ∖ {0}) = (((0..^(♯‘𝑇)) ∖ {0}) ∪ ({(♯‘𝑇)} ∖ {0}))
91	89, 90	eqtrdi 2781	. . . . . . 7 ⊢ (𝜑 → (dom (𝑇 ++ ⟨“𝑋”⟩) ∖ {0}) = (((0..^(♯‘𝑇)) ∖ {0}) ∪ ({(♯‘𝑇)} ∖ {0})))
92	91	eleq2d 2815	. . . . . 6 ⊢ (𝜑 → (𝑛 ∈ (dom (𝑇 ++ ⟨“𝑋”⟩) ∖ {0}) ↔ 𝑛 ∈ (((0..^(♯‘𝑇)) ∖ {0}) ∪ ({(♯‘𝑇)} ∖ {0}))))
93	92	biimpa 476	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (dom (𝑇 ++ ⟨“𝑋”⟩) ∖ {0})) → 𝑛 ∈ (((0..^(♯‘𝑇)) ∖ {0}) ∪ ({(♯‘𝑇)} ∖ {0})))
94		elun 4119	. . . . 5 ⊢ (𝑛 ∈ (((0..^(♯‘𝑇)) ∖ {0}) ∪ ({(♯‘𝑇)} ∖ {0})) ↔ (𝑛 ∈ ((0..^(♯‘𝑇)) ∖ {0}) ∨ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})))
95	93, 94	sylib 218	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (dom (𝑇 ++ ⟨“𝑋”⟩) ∖ {0})) → (𝑛 ∈ ((0..^(♯‘𝑇)) ∖ {0}) ∨ 𝑛 ∈ ({(♯‘𝑇)} ∖ {0})))
96	29, 77, 95	mpjaodan 960	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ (dom (𝑇 ++ ⟨“𝑋”⟩) ∖ {0})) → ((𝑇 ++ ⟨“𝑋”⟩)‘(𝑛 − 1)) < ((𝑇 ++ ⟨“𝑋”⟩)‘𝑛))
97	96	ralrimiva 3126	. 2 ⊢ (𝜑 → ∀𝑛 ∈ (dom (𝑇 ++ ⟨“𝑋”⟩) ∖ {0})((𝑇 ++ ⟨“𝑋”⟩)‘(𝑛 − 1)) < ((𝑇 ++ ⟨“𝑋”⟩)‘𝑛))
98		ischn 32939	. 2 ⊢ ((𝑇 ++ ⟨“𝑋”⟩) ∈ ( < Chain𝐴) ↔ ((𝑇 ++ ⟨“𝑋”⟩) ∈ Word 𝐴 ∧ ∀𝑛 ∈ (dom (𝑇 ++ ⟨“𝑋”⟩) ∖ {0})((𝑇 ++ ⟨“𝑋”⟩)‘(𝑛 − 1)) < ((𝑇 ++ ⟨“𝑋”⟩)‘𝑛)))
99	6, 97, 98	sylanbrc 583	1 ⊢ (𝜑 → (𝑇 ++ ⟨“𝑋”⟩) ∈ ( < Chain𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1540 ∈ wcel 2109 ∀wral 3045 ∖ cdif 3914 ∪ cun 3915 ∅c0 4299 {csn 4592 class class class wbr 5110 dom cdm 5641 ‘cfv 6514 (class class class)co 7390 0cc0 11075 1c1 11076 + caddc 11078 − cmin 11412 ℕcn 12193 ℕ₀cn0 12449 ℤ_≥cuz 12800 ..^cfzo 13622 ♯chash 14302 Word cword 14485 lastSclsw 14534 ++ cconcat 14542 ⟨“cs1 14567 Chaincchn 32937

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4914 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-1o 8437 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-card 9899 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-nn 12194 df-n0 12450 df-z 12537 df-uz 12801 df-fz 13476 df-fzo 13623 df-hash 14303 df-word 14486 df-lsw 14535 df-concat 14543 df-s1 14568 df-chn 32938

This theorem is referenced by: constrextdg2lem 33745

W3C validator