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

Theorem chnrss 18550
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 5144 . . . . 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 18542 . . 3 (𝑥 ∈ ( < Chain 𝐴) ↔ (𝑥 ∈ Word 𝐴 ∧ ∀𝑐 ∈ (dom 𝑥 ∖ {0})(𝑥‘(𝑐 − 1)) < (𝑥𝑐)))
5 ischn 18542 . . 3 (𝑥 ∈ (𝑅 Chain 𝐴) ↔ (𝑥 ∈ Word 𝐴 ∧ ∀𝑐 ∈ (dom 𝑥 ∖ {0})(𝑥‘(𝑐 − 1))𝑅(𝑥𝑐)))
63, 4, 53imtr4g 296 . 2 ( <𝑅 → (𝑥 ∈ ( < Chain 𝐴) → 𝑥 ∈ (𝑅 Chain 𝐴)))
76ssrdv 3941 1 ( <𝑅 → ( < Chain 𝐴) ⊆ (𝑅 Chain 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wcel 2114  wral 3052  cdif 3900  wss 3903  {csn 4582   class class class wbr 5100  dom cdm 5632  cfv 6500  (class class class)co 7368  0cc0 11038  1c1 11039  cmin 11376  Word cword 14448   Chain cchn 18540
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 3402  df-v 3444  df-dif 3906  df-un 3908  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-dm 5642  df-iota 6456  df-fv 6508  df-chn 18541
This theorem is referenced by:  chnrdss  18552
  Copyright terms: Public domain W3C validator