| 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 6304 | . 2 ⊢ Pred(𝑅, ∅, 𝑋) = (∅ ∩ (◡𝑅 “ {𝑋})) | |
| 2 | 0in 4355 | . 2 ⊢ (∅ ∩ (◡𝑅 “ {𝑋})) = ∅ | |
| 3 | 1, 2 | eqtri 2786 | 1 ⊢ Pred(𝑅, ∅, 𝑋) = ∅ |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1570 ∩ cin 3905 ∅c0 4287 {csn 4590 ◡ccnv 5662 “ cima 5666 Predcpred 6303 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3417 df-v 3457 df-dif 3909 df-in 3913 df-nul 4288 df-pred 6304 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |