Theorem chnwrd 18520

Description: A chain is an ordered sequence, i.e. a word. (Contributed by Thierry Arnoux, 19-Jun-2025.)

Hypothesis

Ref	Expression
chnwrd.1	⊢ (𝜑 → 𝐶 ∈ ( < Chain 𝐴))

Assertion

Ref	Expression
chnwrd	⊢ (𝜑 → 𝐶 ∈ Word 𝐴)

Proof of Theorem chnwrd

Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		chnwrd.1	. 2 ⊢ (𝜑 → 𝐶 ∈ ( < Chain 𝐴))
2		ischn 18519	. . 3 ⊢ (𝐶 ∈ ( < Chain 𝐴) ↔ (𝐶 ∈ Word 𝐴 ∧ ∀𝑛 ∈ (dom 𝐶 ∖ {0})(𝐶‘(𝑛 − 1)) < (𝐶‘𝑛)))
3	2	simplbi 497	. 2 ⊢ (𝐶 ∈ ( < Chain 𝐴) → 𝐶 ∈ Word 𝐴)
4	1, 3	syl 17	1 ⊢ (𝜑 → 𝐶 ∈ Word 𝐴)

Syntax hints:   → wi 4   ∈ wcel 2111  ∀wral 3047   ∖ cdif 3894  {csn 4575   class class class wbr 5093  dom cdm 5619  ‘cfv 6487  (class class class)co 7352  0cc0 11012  1c1 11013   − cmin 11350  Word cword 14426   Chain cchn 18517

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 2113  ax-9 2121  ax-ext 2703

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-ss 3914  df-nul 4283  df-if 4475  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-br 5094  df-dm 5629  df-iota 6443  df-fv 6495  df-chn 18518

This theorem is referenced by:  pfxchn  18522  chnexg  18530  chnind  18533  chnub  18534  chnlt  18535  chnccats1  18537  chnccat  18538  chnrev  18539  chnflenfi  18540  chnf  18541  chnpolleha  18544  chnpolfz  18545  fldext2chn  33748  constrextdg2lem  33768  constrext2chnlem  33770  chnsubseqword  46981  chnsubseqwl  46982  chnsubseq  46983  chnsuslle  46984  chnerlem1  46985  chnerlem2  46986  chner  46988