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 48109
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 18807 . . . 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 3258 . . . 4 (((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) ∧ 𝑛 ∈ (dom 𝐴 ∖ {0})) → (𝐴‘(𝑛 − 1))𝑅(𝐴‘𝑛))
7 ischn 18807 . . . . . . 7 (𝐴 ∈ ( < Chain 𝐵) ↔ (𝐴 ∈ Word 𝐵 ∧ ∀𝑛 ∈ (dom 𝐴 ∖ {0})(𝐴‘(𝑛 − 1)) < (𝐴‘𝑛)))
87simprbi 503 . . . . . 6 (𝐴 ∈ ( < Chain 𝐵) → ∀𝑛 ∈ (dom 𝐴 ∖ {0})(𝐴‘(𝑛 − 1)) < (𝐴‘𝑛))
98adantl 487 . . . . 5 ((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) → ∀𝑛 ∈ (dom 𝐴 ∖ {0})(𝐴‘(𝑛 − 1)) < (𝐴‘𝑛))
109r19.21bi 3258 . . . 4 (((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) ∧ 𝑛 ∈ (dom 𝐴 ∖ {0})) → (𝐴‘(𝑛 − 1)) < (𝐴‘𝑛))
11 brin 5160 . . . 4 ((𝐴‘(𝑛 − 1))(𝑅 ∩ < )(𝐴‘𝑛) ↔ ((𝐴‘(𝑛 − 1))𝑅(𝐴‘𝑛) ∧ (𝐴‘(𝑛 − 1)) < (𝐴‘𝑛)))
126, 10, 11sylanbrc 595 . . 3 (((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) ∧ 𝑛 ∈ (dom 𝐴 ∖ {0})) → (𝐴‘(𝑛 − 1))(𝑅 ∩ < )(𝐴‘𝑛))
1312ralrimiva 3158 . 2 ((𝐴 ∈ (𝑅 Chain 𝐵) ∧ 𝐴 ∈ ( < Chain 𝐵)) → ∀𝑛 ∈ (dom 𝐴 ∖ {0})(𝐴‘(𝑛 − 1))(𝑅 ∩ < )(𝐴‘𝑛))
14 ischn 18807 . 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 2147  ∀wral 3080   ∖ cdif 4048   ∩ cin 4092  {csn 4588   class class class wbr 5106  dom cdm 5655  ‘cfv 6555  (class class class)co 7440  0cc0 11224  1c1 11225   − cmin 11565  Word cword 14682   Chain cchn 18805
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-12 2216  ax-ext 2735
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-dm 5665  df-iota 6509  df-fv 6563  df-chn 18806
This theorem is used by:  chnrin2  48111
  Copyright terms: Public domain W3C validator