| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > potr | Structured version Visualization version GIF version | ||
| Description: A partial order is a transitive relation. (Contributed by NM, 27-Mar-1997.) |
| Ref | Expression |
|---|---|
| potr | ⊢ ((𝑅 Po 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷) → 𝐵𝑅𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pocl 5552 | . . 3 ⊢ (𝑅 Po 𝐴 → ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴) → (¬ 𝐵𝑅𝐵 ∧ ((𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷) → 𝐵𝑅𝐷)))) | |
| 2 | 1 | imp 409 | . 2 ⊢ ((𝑅 Po 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (¬ 𝐵𝑅𝐵 ∧ ((𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷) → 𝐵𝑅𝐷))) |
| 3 | 2 | simprd 498 | 1 ⊢ ((𝑅 Po 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷) → 𝐵𝑅𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∧ w3a 1095 ∈ wcel 2132 class class class wbr 5090 Po wpo 5542 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-ext 2724 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-sb 2081 df-clab 2731 df-cleq 2744 df-clel 2827 df-ral 3067 df-rab 3405 df-v 3446 df-dif 3898 df-un 3900 df-ss 3912 df-nul 4277 df-if 4471 df-sn 4573 df-pr 4575 df-op 4579 df-br 5091 df-po 5544 |
| This theorem is referenced by: po2nr 5558 po3nr 5559 pofun 5562 sotr 5569 poltletr 6105 frpomin 6312 poxp 8092 poxp2 8107 poxp3 8114 poseq 8122 fprlem2 8266 frfi 9214 wemaplem2 9481 sornom 10220 zorn2lem7 10445 pospo 18347 chnub 18626 pocnv 36051 weiunpo 36763 seqpo 38184 oneptr 43770 |
| Copyright terms: Public domain | W3C validator |