| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > po0 | Structured version Visualization version GIF version | ||
| Description: Any relation is a partial order on the empty set. (Contributed by NM, 28-Mar-1997.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) |
| Ref | Expression |
|---|---|
| po0 | ⊢ 𝑅 Po ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ral0 4458 | . 2 ⊢ ∀𝑥 ∈ ∅ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) | |
| 2 | df-po 5568 | . 2 ⊢ (𝑅 Po ∅ ↔ ∀𝑥 ∈ ∅ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))) | |
| 3 | 1, 2 | mpbir 234 | 1 ⊢ 𝑅 Po ∅ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 400 ∀wral 3078 ∅c0 4285 class class class wbr 5108 Po wpo 5566 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-9 2152 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-ral 3079 df-dif 3907 df-nul 4286 df-po 5568 |
| This theorem is used by: so0 5606 posn 5746 dfpo2 6297 ipo0 45186 |
| Copyright terms: Public domain | W3C validator |