| 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 6259 | . 2 ⊢ Pred(𝑅, ∅, 𝑋) = (∅ ∩ (◡𝑅 “ {𝑋})) | |
| 2 | 0in 4332 | . 2 ⊢ (∅ ∩ (◡𝑅 “ {𝑋})) = ∅ | |
| 3 | 1, 2 | eqtri 2763 | 1 ⊢ Pred(𝑅, ∅, 𝑋) = ∅ |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1547 ∩ cin 3889 ∅c0 4268 {csn 4562 ◡ccnv 5624 “ cima 5628 Predcpred 6258 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2712 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-rab 3393 df-v 3434 df-dif 3893 df-in 3897 df-nul 4269 df-pred 6259 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |