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 47709
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 18697 . . . 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 3256 . . . 4 (((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) ∧ 𝑛 ∈ (dom 𝐴 ∖ {0})) → (𝐴‘(𝑛 − 1))𝑅(𝐴𝑛))
7 ischn 18697 . . . . . . 7 (𝐴 ∈ ( < Chain 𝐵) ↔ (𝐴 ∈ Word 𝐵 ∧ ∀𝑛 ∈ (dom 𝐴 ∖ {0})(𝐴‘(𝑛 − 1)) < (𝐴𝑛)))
87simprbi 503 . . . . . 6 (𝐴 ∈ ( < Chain 𝐵) → ∀𝑛 ∈ (dom 𝐴 ∖ {0})(𝐴‘(𝑛 − 1)) < (𝐴𝑛))
98adantl 487 . . . . 5 ((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) → ∀𝑛 ∈ (dom 𝐴 ∖ {0})(𝐴‘(𝑛 − 1)) < (𝐴𝑛))
109r19.21bi 3256 . . . 4 (((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) ∧ 𝑛 ∈ (dom 𝐴 ∖ {0})) → (𝐴‘(𝑛 − 1)) < (𝐴𝑛))
11 brin 5161 . . . 4 ((𝐴‘(𝑛 − 1))(𝑅< )(𝐴𝑛) ↔ ((𝐴‘(𝑛 − 1))𝑅(𝐴𝑛) ∧ (𝐴‘(𝑛 − 1)) < (𝐴𝑛)))
126, 10, 11sylanbrc 595 . . 3 (((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) ∧ 𝑛 ∈ (dom 𝐴 ∖ {0})) → (𝐴‘(𝑛 − 1))(𝑅< )(𝐴𝑛))
1312ralrimiva 3156 . 2 ((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) → ∀𝑛 ∈ (dom 𝐴 ∖ {0})(𝐴‘(𝑛 − 1))(𝑅< )(𝐴𝑛))
14 ischn 18697 . 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 2145  wral 3078  cdif 3899  cin 3901  {csn 4587   class class class wbr 5107  dom cdm 5659  cfv 6537  (class class class)co 7416  0cc0 11125  1c1 11126  cmin 11466  Word cword 14578   Chain cchn 18695
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-12 2215  ax-ext 2734
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-dm 5669  df-iota 6493  df-fv 6545  df-chn 18696
This theorem is used by:  chnrin2  47711
  Copyright terms: Public domain W3C validator