| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > posprs | Structured version Visualization version GIF version | ||
| Description: A poset is a proset. (Contributed by Stefan O'Rear, 1-Feb-2015.) |
| Ref | Expression |
|---|---|
| posprs | ⊢ (𝐾 ∈ Poset → 𝐾 ∈ Proset ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2760 | . . 3 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 2 | eqid 2760 | . . 3 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 3 | 1, 2 | ispos2 18495 | . 2 ⊢ (𝐾 ∈ Poset ↔ (𝐾 ∈ Proset ∧ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)((𝑥(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑥) → 𝑥 = 𝑦))) |
| 4 | 3 | simplbi 502 | 1 ⊢ (𝐾 ∈ Poset → 𝐾 ∈ Proset ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2144 ∀wral 3076 class class class wbr 5102 ‘cfv 6539 Basecbs 17393 lecple 17441 Proset cproset 18472 Posetcpo 18487 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-nul 5259 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-ss 3896 df-dif 4047 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-iota 6494 df-fv 6547 df-proset 18474 df-poset 18493 |
| This theorem is used by: posref 18498 isipodrs 18717 pwrssmgc 33608 mgcf1olem1 33609 mgcf1olem2 33610 mgcf1o 33611 nsgmgc 34010 ordtrest2NEWlem 34601 ordtrest2NEW 34602 ordtconnlem1 34603 exbasprs 50185 basresprsfo 50187 discbas 50804 discthin 50805 |
| Copyright terms: Public domain | W3C validator |