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

Theorem postr 18378
Description: A poset ordering is transitive. (Contributed by NM, 11-Sep-2011.)
Hypotheses
Ref Expression
posi.b 𝐵 = (Base‘𝐾)
posi.l = (le‘𝐾)
Assertion
Ref Expression
postr ((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 𝑌𝑌 𝑍) → 𝑋 𝑍))

Proof of Theorem postr
StepHypRef Expression
1 posi.b . . 3 𝐵 = (Base‘𝐾)
2 posi.l . . 3 = (le‘𝐾)
31, 2posi 18375 . 2 ((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑋 𝑋 ∧ ((𝑋 𝑌𝑌 𝑋) → 𝑋 = 𝑌) ∧ ((𝑋 𝑌𝑌 𝑍) → 𝑋 𝑍)))
43simp3d 1143 1 ((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 𝑌𝑌 𝑍) → 𝑋 𝑍))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1537  wcel 2106   class class class wbr 5148  cfv 6563  Basecbs 17245  lecple 17305  Posetcpo 18365
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706  ax-nul 5312
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-iota 6516  df-fv 6571  df-poset 18371
This theorem is referenced by:  odupos  18386  plttr  18400  joinle  18444  meetle  18458  lattr  18502  omndadd2d  33068  omndadd2rd  33069  omndmul2  33072  atlatle  39302  cvratlem  39404  llncmp  39505  llncvrlpln  39541  lplncmp  39545  lplncvrlvol  39599  lvolcmp  39600  pmaple  39744
  Copyright terms: Public domain W3C validator