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

Theorem pltletr 18398
Description: Transitive law for chained "less than" and "less than or equal to". (psssstr 4065 analog.) (Contributed by NM, 2-Dec-2011.)
Hypotheses
Ref Expression
pltletr.b 𝐵 = (Base‘𝐾)
pltletr.l = (le‘𝐾)
pltletr.s < = (lt‘𝐾)
Assertion
Ref Expression
pltletr ((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 < 𝑌𝑌 𝑍) → 𝑋 < 𝑍))

Proof of Theorem pltletr
StepHypRef Expression
1 pltletr.b . . . . . 6 𝐵 = (Base‘𝐾)
2 pltletr.l . . . . . 6 = (le‘𝐾)
3 pltletr.s . . . . . 6 < = (lt‘𝐾)
41, 2, 3pleval2 18392 . . . . 5 ((𝐾 ∈ Poset ∧ 𝑌𝐵𝑍𝐵) → (𝑌 𝑍 ↔ (𝑌 < 𝑍𝑌 = 𝑍)))
543adant3r1 1201 . . . 4 ((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑌 𝑍 ↔ (𝑌 < 𝑍𝑌 = 𝑍)))
65adantr 485 . . 3 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) ∧ 𝑋 < 𝑌) → (𝑌 𝑍 ↔ (𝑌 < 𝑍𝑌 = 𝑍)))
71, 3plttr 18397 . . . . 5 ((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 < 𝑌𝑌 < 𝑍) → 𝑋 < 𝑍))
87expdimp 457 . . . 4 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) ∧ 𝑋 < 𝑌) → (𝑌 < 𝑍𝑋 < 𝑍))
9 breq2 5114 . . . . . 6 (𝑌 = 𝑍 → (𝑋 < 𝑌𝑋 < 𝑍))
109biimpcd 252 . . . . 5 (𝑋 < 𝑌 → (𝑌 = 𝑍𝑋 < 𝑍))
1110adantl 486 . . . 4 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) ∧ 𝑋 < 𝑌) → (𝑌 = 𝑍𝑋 < 𝑍))
128, 11jaod 872 . . 3 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) ∧ 𝑋 < 𝑌) → ((𝑌 < 𝑍𝑌 = 𝑍) → 𝑋 < 𝑍))
136, 12sylbid 243 . 2 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) ∧ 𝑋 < 𝑌) → (𝑌 𝑍𝑋 < 𝑍))
1413expimpd 458 1 ((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 < 𝑌𝑌 𝑍) → 𝑋 < 𝑍))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wo 860  w3a 1103   = wceq 1570  wcel 2143   class class class wbr 5110  cfv 6538  Basecbs 17270  lecple 17318  Posetcpo 18364  ltcplt 18365
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pr 5406
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3746  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6494  df-fun 6540  df-fv 6546  df-proset 18351  df-poset 18370  df-plt 18385
This theorem is referenced by:  cvrletrN  40028  atlen0  40065  atlelt  40193  2atlt  40194  ps-2  40233  llnnleat  40268  lplnnle2at  40296  lvolnle3at  40337  dalemcea  40415  2atm2atN  40540  dia2dimlem2  41820  dia2dimlem3  41821
  Copyright terms: Public domain W3C validator