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

Theorem chneq1 18620
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 5096 . . . 4 ( < = 𝑅 → ((𝑐‘(𝑥 − 1)) < (𝑐𝑥) ↔ (𝑐‘(𝑥 − 1))𝑅(𝑐𝑥)))
21ralbidv 3179 . . 3 ( < = 𝑅 → (∀𝑥 ∈ (dom 𝑐 ∖ {0})(𝑐‘(𝑥 − 1)) < (𝑐𝑥) ↔ ∀𝑥 ∈ (dom 𝑐 ∖ {0})(𝑐‘(𝑥 − 1))𝑅(𝑐𝑥)))
32rabbidv 3415 . 2 ( < = 𝑅 → {𝑐 ∈ Word 𝐴 ∣ ∀𝑥 ∈ (dom 𝑐 ∖ {0})(𝑐‘(𝑥 − 1)) < (𝑐𝑥)} = {𝑐 ∈ Word 𝐴 ∣ ∀𝑥 ∈ (dom 𝑐 ∖ {0})(𝑐‘(𝑥 − 1))𝑅(𝑐𝑥)})
4 df-chn 18614 . 2 ( < Chain 𝐴) = {𝑐 ∈ Word 𝐴 ∣ ∀𝑥 ∈ (dom 𝑐 ∖ {0})(𝑐‘(𝑥 − 1)) < (𝑐𝑥)}
5 df-chn 18614 . 2 (𝑅 Chain 𝐴) = {𝑐 ∈ Word 𝐴 ∣ ∀𝑥 ∈ (dom 𝑐 ∖ {0})(𝑐‘(𝑥 − 1))𝑅(𝑐𝑥)}
63, 4, 53eqtr4g 2816 1 ( < = 𝑅 → ( < Chain 𝐴) = (𝑅 Chain 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1554  wral 3070  {crab 3408  cdif 3896  {csn 4576   class class class wbr 5094  dom cdm 5640  cfv 6510  (class class class)co 7385  0cc0 11063  1c1 11064  cmin 11404  Word cword 14516   Chain cchn 18613
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-ext 2728
This theorem depends on definitions:  df-bi 209  df-an 399  df-ex 1794  df-sb 2085  df-clab 2735  df-cleq 2748  df-clel 2831  df-ral 3071  df-rab 3409  df-br 5095  df-chn 18614
This theorem is referenced by:  chneq12  18622
  Copyright terms: Public domain W3C validator