Theorem chnrss 18751

Description: Chains under a relation are also chains under any superset relation. (Contributed by Ender Ting, 20-Jan-2026.)

Assertion

Ref	Expression
chnrss	⊢ ( < ⊆ 𝑅 → ( < Chain 𝐴) ⊆ (𝑅 Chain 𝐴))

Proof of Theorem chnrss

Dummy variables 𝑥 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssbr 5148	. . . . 5 ⊢ ( < ⊆ 𝑅 → ((𝑥‘(𝑐 − 1)) < (𝑥‘𝑐) → (𝑥‘(𝑐 − 1))𝑅(𝑥‘𝑐)))
2	1	ralimdv 3176	. . . 4 ⊢ ( < ⊆ 𝑅 → (∀𝑐 ∈ (dom 𝑥 ∖ {0})(𝑥‘(𝑐 − 1)) < (𝑥‘𝑐) → ∀𝑐 ∈ (dom 𝑥 ∖ {0})(𝑥‘(𝑐 − 1))𝑅(𝑥‘𝑐)))
3	2	anim2d 624	. . 3 ⊢ ( < ⊆ 𝑅 → ((𝑥 ∈ Word 𝐴 ∧ ∀𝑐 ∈ (dom 𝑥 ∖ {0})(𝑥‘(𝑐 − 1)) < (𝑥‘𝑐)) → (𝑥 ∈ Word 𝐴 ∧ ∀𝑐 ∈ (dom 𝑥 ∖ {0})(𝑥‘(𝑐 − 1))𝑅(𝑥‘𝑐))))
4		ischn 18743	. . 3 ⊢ (𝑥 ∈ ( < Chain 𝐴) ↔ (𝑥 ∈ Word 𝐴 ∧ ∀𝑐 ∈ (dom 𝑥 ∖ {0})(𝑥‘(𝑐 − 1)) < (𝑥‘𝑐)))
5		ischn 18743	. . 3 ⊢ (𝑥 ∈ (𝑅 Chain 𝐴) ↔ (𝑥 ∈ Word 𝐴 ∧ ∀𝑐 ∈ (dom 𝑥 ∖ {0})(𝑥‘(𝑐 − 1))𝑅(𝑥‘𝑐)))
6	3, 4, 5	3imtr4g 299	. 2 ⊢ ( < ⊆ 𝑅 → (𝑥 ∈ ( < Chain 𝐴) → 𝑥 ∈ (𝑅 Chain 𝐴)))
7	6	ssrdv 3936	1 ⊢ ( < ⊆ 𝑅 → ( < Chain 𝐴) ⊆ (𝑅 Chain 𝐴))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2145  ∀wral 3076   ∖ cdif 3895   ⊆ wss 3898  {csn 4583   class class class wbr 5102  dom cdm 5647  ‘cfv 6527  (class class class)co 7408  0cc0 11172  1c1 11173   − cmin 11513  Word cword 14626   Chain cchn 18741

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-dm 5657  df-iota 6483  df-fv 6535  df-chn 18742

This theorem is used by:  chnrdss  18753  chnrrin  47829  chnrun  47831