| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > predprc | Structured version Visualization version GIF version | ||
| Description: The predecessor of a proper class is empty. (Contributed by Scott Fenton, 25-Nov-2024.) |
| Ref | Expression |
|---|---|
| predprc | ⊢ (¬ 𝑋 ∈ V → Pred(𝑅, 𝐴, 𝑋) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-pred 6267 | . 2 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋})) | |
| 2 | snprc 4676 | . . . . . . 7 ⊢ (¬ 𝑋 ∈ V ↔ {𝑋} = ∅) | |
| 3 | 2 | biimpi 216 | . . . . . 6 ⊢ (¬ 𝑋 ∈ V → {𝑋} = ∅) |
| 4 | 3 | imaeq2d 6027 | . . . . 5 ⊢ (¬ 𝑋 ∈ V → (◡𝑅 “ {𝑋}) = (◡𝑅 “ ∅)) |
| 5 | ima0 6044 | . . . . 5 ⊢ (◡𝑅 “ ∅) = ∅ | |
| 6 | 4, 5 | eqtrdi 2788 | . . . 4 ⊢ (¬ 𝑋 ∈ V → (◡𝑅 “ {𝑋}) = ∅) |
| 7 | 6 | ineq2d 4174 | . . 3 ⊢ (¬ 𝑋 ∈ V → (𝐴 ∩ (◡𝑅 “ {𝑋})) = (𝐴 ∩ ∅)) |
| 8 | in0 4349 | . . 3 ⊢ (𝐴 ∩ ∅) = ∅ | |
| 9 | 7, 8 | eqtrdi 2788 | . 2 ⊢ (¬ 𝑋 ∈ V → (𝐴 ∩ (◡𝑅 “ {𝑋})) = ∅) |
| 10 | 1, 9 | eqtrid 2784 | 1 ⊢ (¬ 𝑋 ∈ V → Pred(𝑅, 𝐴, 𝑋) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1542 ∈ wcel 2114 Vcvv 3442 ∩ cin 3902 ∅c0 4287 {csn 4582 ◡ccnv 5631 “ cima 5635 Predcpred 6266 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-xp 5638 df-cnv 5640 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 |
| This theorem is referenced by: predres 6305 |
| Copyright terms: Public domain | W3C validator |