Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > po0 | GIF version |
Description: Any relation is a partial ordering of 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 3505 | . 2 ⊢ ∀𝑥 ∈ ∅ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) | |
2 | df-po 4268 | . 2 ⊢ (𝑅 Po ∅ ↔ ∀𝑥 ∈ ∅ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))) | |
3 | 1, 2 | mpbir 145 | 1 ⊢ 𝑅 Po ∅ |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ∀wral 2442 ∅c0 3404 class class class wbr 3976 Po wpo 4266 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-ext 2146 |
This theorem depends on definitions: df-bi 116 df-tru 1345 df-nf 1448 df-sb 1750 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ral 2447 df-v 2723 df-dif 3113 df-nul 3405 df-po 4268 |
This theorem is referenced by: so0 4298 |
Copyright terms: Public domain | W3C validator |