MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  chnrss Structured version   Visualization version   GIF version

Theorem chnrss 18570
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.
StepHypRef Expression
1 ssbr 5130 . . . . 5 ( <𝑅 → ((𝑥‘(𝑐 − 1)) < (𝑥𝑐) → (𝑥‘(𝑐 − 1))𝑅(𝑥𝑐)))
21ralimdv 3152 . . . 4 ( <𝑅 → (∀𝑐 ∈ (dom 𝑥 ∖ {0})(𝑥‘(𝑐 − 1)) < (𝑥𝑐) → ∀𝑐 ∈ (dom 𝑥 ∖ {0})(𝑥‘(𝑐 − 1))𝑅(𝑥𝑐)))
32anim2d 613 . . 3 ( <𝑅 → ((𝑥 ∈ Word 𝐴 ∧ ∀𝑐 ∈ (dom 𝑥 ∖ {0})(𝑥‘(𝑐 − 1)) < (𝑥𝑐)) → (𝑥 ∈ Word 𝐴 ∧ ∀𝑐 ∈ (dom 𝑥 ∖ {0})(𝑥‘(𝑐 − 1))𝑅(𝑥𝑐))))
4 ischn 18562 . . 3 (𝑥 ∈ ( < Chain 𝐴) ↔ (𝑥 ∈ Word 𝐴 ∧ ∀𝑐 ∈ (dom 𝑥 ∖ {0})(𝑥‘(𝑐 − 1)) < (𝑥𝑐)))
5 ischn 18562 . . 3 (𝑥 ∈ (𝑅 Chain 𝐴) ↔ (𝑥 ∈ Word 𝐴 ∧ ∀𝑐 ∈ (dom 𝑥 ∖ {0})(𝑥‘(𝑐 − 1))𝑅(𝑥𝑐)))
63, 4, 53imtr4g 296 . 2 ( <𝑅 → (𝑥 ∈ ( < Chain 𝐴) → 𝑥 ∈ (𝑅 Chain 𝐴)))
76ssrdv 3928 1 ( <𝑅 → ( < Chain 𝐴) ⊆ (𝑅 Chain 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wcel 2114  wral 3052  cdif 3887  wss 3890  {csn 4568   class class class wbr 5086  dom cdm 5622  cfv 6490  (class class class)co 7358  0cc0 11027  1c1 11028  cmin 11366  Word cword 14464   Chain cchn 18560
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-dm 5632  df-iota 6446  df-fv 6498  df-chn 18561
This theorem is referenced by:  chnrdss  18572
  Copyright terms: Public domain W3C validator