Theorem chnltm1 18664

Description: Basic property of a chain. (Contributed by Thierry Arnoux, 19-Jun-2025.)

Hypotheses

Ref	Expression
chnwrd.1	⊢ (𝜑 → 𝐶 ∈ ( < Chain 𝐴))
chnltm1.2	⊢ (𝜑 → 𝑁 ∈ (dom 𝐶 ∖ {0}))

Assertion

Ref	Expression
chnltm1	⊢ (𝜑 → (𝐶‘(𝑁 − 1)) < (𝐶‘𝑁))

Proof of Theorem chnltm1

Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fvoveq1 7434	. . 3 ⊢ (𝑛 = 𝑁 → (𝐶‘(𝑛 − 1)) = (𝐶‘(𝑁 − 1)))
2		fveq2 6882	. . 3 ⊢ (𝑛 = 𝑁 → (𝐶‘𝑛) = (𝐶‘𝑁))
3	1, 2	breq12d 5126	. 2 ⊢ (𝑛 = 𝑁 → ((𝐶‘(𝑛 − 1)) < (𝐶‘𝑛) ↔ (𝐶‘(𝑁 − 1)) < (𝐶‘𝑁)))
4		chnwrd.1	. . . 4 ⊢ (𝜑 → 𝐶 ∈ ( < Chain 𝐴))
5		ischn 18662	. . . 4 ⊢ (𝐶 ∈ ( < Chain 𝐴) ↔ (𝐶 ∈ Word 𝐴 ∧ ∀𝑛 ∈ (dom 𝐶 ∖ {0})(𝐶‘(𝑛 − 1)) < (𝐶‘𝑛)))
6	4, 5	sylib 221	. . 3 ⊢ (𝜑 → (𝐶 ∈ Word 𝐴 ∧ ∀𝑛 ∈ (dom 𝐶 ∖ {0})(𝐶‘(𝑛 − 1)) < (𝐶‘𝑛)))
7	6	simprd 500	. 2 ⊢ (𝜑 → ∀𝑛 ∈ (dom 𝐶 ∖ {0})(𝐶‘(𝑛 − 1)) < (𝐶‘𝑛))
8		chnltm1.2	. 2 ⊢ (𝜑 → 𝑁 ∈ (dom 𝐶 ∖ {0}))
9	3, 7, 8	rspcdva 3591	1 ⊢ (𝜑 → (𝐶‘(𝑁 − 1)) < (𝐶‘𝑁))

Syntax hints:   → wi 4   ∧ wa 400   = wceq 1567   ∈ wcel 2149  ∀wral 3085   ∖ cdif 3910  {csn 4594   class class class wbr 5113  dom cdm 5662  ‘cfv 6537  (class class class)co 7411  0cc0 11099  1c1 11100   − cmin 11440  Word cword 14549   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-ext 2741

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-dm 5672  df-iota 6493  df-fv 6545  df-ov 7414  df-chn 18661

This theorem is referenced by:  pfxchn  18665  chnccat  18681  chnrev  18682  chnsubseq  47487