| 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 5578 | . . 3 ⊢ (𝑅 Po 𝐴 → ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴) → (¬ 𝐵𝑅𝐵 ∧ ((𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷) → 𝐵𝑅𝐷)))) | |
| 2 | 1 | imp 411 | . 2 ⊢ ((𝑅 Po 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (¬ 𝐵𝑅𝐵 ∧ ((𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷) → 𝐵𝑅𝐷))) |
| 3 | 2 | simprd 500 | 1 ⊢ ((𝑅 Po 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷) → 𝐵𝑅𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∧ w3a 1101 ∈ wcel 2149 class class class wbr 5113 Po wpo 5568 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ral 3086 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5114 df-po 5570 |
| This theorem is referenced by: po2nr 5584 po3nr 5585 pofun 5588 sotr 5595 poltletr 6133 frpomin 6342 poxp 8123 poxp2 8138 poxp3 8145 poseq 8153 fprlem2 8297 frfi 9244 wemaplem2 9508 sornom 10260 zorn2lem7 10485 pospo 18398 chnub 18677 pocnv 36153 weiunpo 36864 seqpo 38285 oneptr 43873 |
| Copyright terms: Public domain | W3C validator |