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

Theorem chneq1 18547
Description: Equality theorem for chains. (Contributed by Ender Ting, 17-Jan-2026.)
Assertion
Ref Expression
chneq1 ( < = 𝑅 → ( < Chain 𝐴) = (𝑅 Chain 𝐴))

Proof of Theorem chneq1
Dummy variables 𝑥 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq 5102 . . . 4 ( < = 𝑅 → ((𝑐‘(𝑥 − 1)) < (𝑐𝑥) ↔ (𝑐‘(𝑥 − 1))𝑅(𝑐𝑥)))
21ralbidv 3161 . . 3 ( < = 𝑅 → (∀𝑥 ∈ (dom 𝑐 ∖ {0})(𝑐‘(𝑥 − 1)) < (𝑐𝑥) ↔ ∀𝑥 ∈ (dom 𝑐 ∖ {0})(𝑐‘(𝑥 − 1))𝑅(𝑐𝑥)))
32rabbidv 3408 . 2 ( < = 𝑅 → {𝑐 ∈ Word 𝐴 ∣ ∀𝑥 ∈ (dom 𝑐 ∖ {0})(𝑐‘(𝑥 − 1)) < (𝑐𝑥)} = {𝑐 ∈ Word 𝐴 ∣ ∀𝑥 ∈ (dom 𝑐 ∖ {0})(𝑐‘(𝑥 − 1))𝑅(𝑐𝑥)})
4 df-chn 18541 . 2 ( < Chain 𝐴) = {𝑐 ∈ Word 𝐴 ∣ ∀𝑥 ∈ (dom 𝑐 ∖ {0})(𝑐‘(𝑥 − 1)) < (𝑐𝑥)}
5 df-chn 18541 . 2 (𝑅 Chain 𝐴) = {𝑐 ∈ Word 𝐴 ∣ ∀𝑥 ∈ (dom 𝑐 ∖ {0})(𝑐‘(𝑥 − 1))𝑅(𝑐𝑥)}
63, 4, 53eqtr4g 2797 1 ( < = 𝑅 → ( < Chain 𝐴) = (𝑅 Chain 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wral 3052  {crab 3401  cdif 3900  {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-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rab 3402  df-br 5101  df-chn 18541
This theorem is referenced by:  chneq12  18549
  Copyright terms: Public domain W3C validator