| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pred0 | Structured version Visualization version GIF version | ||
| Description: The predecessor class over ∅ is always ∅. (Contributed by Scott Fenton, 16-Apr-2011.) (Proof shortened by AV, 11-Jun-2021.) |
| Ref | Expression |
|---|---|
| pred0 | ⊢ Pred(𝑅, ∅, 𝑋) = ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-pred 6284 | . 2 ⊢ Pred(𝑅, ∅, 𝑋) = (∅ ∩ (◡𝑅 “ {𝑋})) | |
| 2 | 0in 4350 | . 2 ⊢ (∅ ∩ (◡𝑅 “ {𝑋})) = ∅ | |
| 3 | 1, 2 | eqtri 2784 | 1 ⊢ Pred(𝑅, ∅, 𝑋) = ∅ |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1559 ∩ cin 3903 ∅c0 4285 {csn 4581 ◡ccnv 5644 “ cima 5648 Predcpred 6283 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-rab 3414 df-v 3455 df-dif 3907 df-in 3911 df-nul 4286 df-pred 6284 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |