| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hashnemnf | Structured version Visualization version GIF version | ||
| Description: The size of a set is never minus infinity. (Contributed by Alexander van der Vekens, 21-Dec-2017.) |
| Ref | Expression |
|---|---|
| hashnemnf | ⊢ (𝐴 ∈ 𝑉 → (♯‘𝐴) ≠ -∞) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hashnn0pnf 14348 | . 2 ⊢ (𝐴 ∈ 𝑉 → ((♯‘𝐴) ∈ ℕ0 ∨ (♯‘𝐴) = +∞)) | |
| 2 | mnfnre 11218 | . . . . . 6 ⊢ -∞ ∉ ℝ | |
| 3 | df-nel 3061 | . . . . . . 7 ⊢ (-∞ ∉ ℝ ↔ ¬ -∞ ∈ ℝ) | |
| 4 | nn0re 12483 | . . . . . . . 8 ⊢ (-∞ ∈ ℕ0 → -∞ ∈ ℝ) | |
| 5 | 4 | con3i 154 | . . . . . . 7 ⊢ (¬ -∞ ∈ ℝ → ¬ -∞ ∈ ℕ0) |
| 6 | 3, 5 | sylbi 219 | . . . . . 6 ⊢ (-∞ ∉ ℝ → ¬ -∞ ∈ ℕ0) |
| 7 | 2, 6 | ax-mp 5 | . . . . 5 ⊢ ¬ -∞ ∈ ℕ0 |
| 8 | eleq1 2849 | . . . . 5 ⊢ ((♯‘𝐴) = -∞ → ((♯‘𝐴) ∈ ℕ0 ↔ -∞ ∈ ℕ0)) | |
| 9 | 7, 8 | mtbiri 329 | . . . 4 ⊢ ((♯‘𝐴) = -∞ → ¬ (♯‘𝐴) ∈ ℕ0) |
| 10 | 9 | necon2ai 2985 | . . 3 ⊢ ((♯‘𝐴) ∈ ℕ0 → (♯‘𝐴) ≠ -∞) |
| 11 | pnfnemnf 11230 | . . . 4 ⊢ +∞ ≠ -∞ | |
| 12 | neeq1 3018 | . . . 4 ⊢ ((♯‘𝐴) = +∞ → ((♯‘𝐴) ≠ -∞ ↔ +∞ ≠ -∞)) | |
| 13 | 11, 12 | mpbiri 260 | . . 3 ⊢ ((♯‘𝐴) = +∞ → (♯‘𝐴) ≠ -∞) |
| 14 | 10, 13 | jaoi 868 | . 2 ⊢ (((♯‘𝐴) ∈ ℕ0 ∨ (♯‘𝐴) = +∞) → (♯‘𝐴) ≠ -∞) |
| 15 | 1, 14 | syl 17 | 1 ⊢ (𝐴 ∈ 𝑉 → (♯‘𝐴) ≠ -∞) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∨ wo 858 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 ∉ wnel 3060 ‘cfv 6515 ℝcr 11065 +∞cpnf 11206 -∞cmnf 11207 ℕ0cn0 12474 ♯chash 14336 |
| 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-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7712 ax-cnex 11122 ax-resscn 11123 ax-1cn 11124 ax-icn 11125 ax-addcl 11126 ax-addrcl 11127 ax-mulcl 11128 ax-mulrcl 11129 ax-mulcom 11130 ax-addass 11131 ax-mulass 11132 ax-distr 11133 ax-i2m1 11134 ax-1ne0 11135 ax-1rid 11136 ax-rnegex 11137 ax-rrecex 11138 ax-cnre 11139 ax-pre-lttri 11140 ax-pre-lttrn 11141 ax-pre-ltadd 11142 ax-pre-mulgt0 11143 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4903 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7841 df-2nd 7965 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-rdg 8374 df-1o 8430 df-er 8671 df-en 8921 df-dom 8922 df-sdom 8923 df-fin 8924 df-card 9890 df-pnf 11211 df-mnf 11212 df-xr 11213 df-ltxr 11214 df-le 11215 df-sub 11409 df-neg 11410 df-nn 12204 df-n0 12475 df-xnn0 12548 df-z 12562 df-uz 12833 df-hash 14337 |
| This theorem is referenced by: hashinfxadd 14391 |
| Copyright terms: Public domain | W3C validator |