Users' Mathboxes Mathbox for Ender Ting < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  chnrin Structured version   Visualization version   GIF version

Theorem chnrin 47906
Description: Satisfying two chain relations makes a chain under their intersection. (Contributed by Ender Ting, 24-Jul-2026.)
Assertion
Ref Expression
chnrin ((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) → 𝐴 ∈ ((𝑅 ∩ < ) Chain 𝐵))

Proof of Theorem chnrin
Dummy variable 𝑛 is distinct from all other variables.
StepHypRef Expression
1 ischn 18781 . . . 4 (𝐴 ∈ (𝑅 Chain 𝐵) ↔ (𝐴 ∈ Word 𝐵 ∧ ∀𝑛 ∈ (dom 𝐴 ∖ {0})(𝐴‘(𝑛 − 1))𝑅(𝐴‘𝑛)))
21simplbi 502 . . 3 (𝐴 ∈ (𝑅 Chain 𝐵) → 𝐴 ∈ Word 𝐵)
32adantr 486 . 2 ((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) → 𝐴 ∈ Word 𝐵)
41simprbi 503 . . . . . 6 (𝐴 ∈ (𝑅 Chain 𝐵) → ∀𝑛 ∈ (dom 𝐴 ∖ {0})(𝐴‘(𝑛 − 1))𝑅(𝐴‘𝑛))
54adantr 486 . . . . 5 ((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) → ∀𝑛 ∈ (dom 𝐴 ∖ {0})(𝐴‘(𝑛 − 1))𝑅(𝐴‘𝑛))
65r19.21bi 3254 . . . 4 (((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) ∧ 𝑛 ∈ (dom 𝐴 ∖ {0})) → (𝐴‘(𝑛 − 1))𝑅(𝐴‘𝑛))
7 ischn 18781 . . . . . . 7 (𝐴 ∈ ( < Chain 𝐵) ↔ (𝐴 ∈ Word 𝐵 ∧ ∀𝑛 ∈ (dom 𝐴 ∖ {0})(𝐴‘(𝑛 − 1)) < (𝐴‘𝑛)))
87simprbi 503 . . . . . 6 (𝐴 ∈ ( < Chain 𝐵) → ∀𝑛 ∈ (dom 𝐴 ∖ {0})(𝐴‘(𝑛 − 1)) < (𝐴‘𝑛))
98adantl 487 . . . . 5 ((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) → ∀𝑛 ∈ (dom 𝐴 ∖ {0})(𝐴‘(𝑛 − 1)) < (𝐴‘𝑛))
109r19.21bi 3254 . . . 4 (((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) ∧ 𝑛 ∈ (dom 𝐴 ∖ {0})) → (𝐴‘(𝑛 − 1)) < (𝐴‘𝑛))
11 brin 5156 . . . 4 ((𝐴‘(𝑛 − 1))(𝑅 ∩ < )(𝐴‘𝑛) ↔ ((𝐴‘(𝑛 − 1))𝑅(𝐴‘𝑛) ∧ (𝐴‘(𝑛 − 1)) < (𝐴‘𝑛)))
126, 10, 11sylanbrc 595 . . 3 (((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) ∧ 𝑛 ∈ (dom 𝐴 ∖ {0})) → (𝐴‘(𝑛 − 1))(𝑅 ∩ < )(𝐴‘𝑛))
1312ralrimiva 3154 . 2 ((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) → ∀𝑛 ∈ (dom 𝐴 ∖ {0})(𝐴‘(𝑛 − 1))(𝑅 ∩ < )(𝐴‘𝑛))
14 ischn 18781 . 2 (𝐴 ∈ ((𝑅 ∩ < ) Chain 𝐵) ↔ (𝐴 ∈ Word 𝐵 ∧ ∀𝑛 ∈ (dom 𝐴 ∖ {0})(𝐴‘(𝑛 − 1))(𝑅 ∩ < )(𝐴‘𝑛)))
153, 13, 14sylanbrc 595 1 ((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) → 𝐴 ∈ ((𝑅 ∩ < ) Chain 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2144  ∀wral 3076   ∖ cdif 4045   ∩ cin 4089  {csn 4583   class class class wbr 5102  dom cdm 5650  ‘cfv 6538  (class class class)co 7420  0cc0 11200  1c1 11201   − cmin 11541  Word cword 14658   Chain cchn 18779
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-12 2212  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-dm 5660  df-iota 6494  df-fv 6546  df-chn 18780
This theorem is used by:  chnrin2  47908
  Copyright terms: Public domain W3C validator