![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > hashneq0 | Structured version Visualization version GIF version |
Description: Two ways of saying a set is not empty. (Contributed by Alexander van der Vekens, 23-Sep-2018.) |
Ref | Expression |
---|---|
hashneq0 | ⊢ (𝐴 ∈ 𝑉 → (0 < (♯‘𝐴) ↔ 𝐴 ≠ ∅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hashnn0pnf 13334 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ((♯‘𝐴) ∈ ℕ0 ∨ (♯‘𝐴) = +∞)) | |
2 | nn0re 11508 | . . . . . 6 ⊢ ((♯‘𝐴) ∈ ℕ0 → (♯‘𝐴) ∈ ℝ) | |
3 | nn0ge0 11525 | . . . . . 6 ⊢ ((♯‘𝐴) ∈ ℕ0 → 0 ≤ (♯‘𝐴)) | |
4 | ne0gt0 10348 | . . . . . 6 ⊢ (((♯‘𝐴) ∈ ℝ ∧ 0 ≤ (♯‘𝐴)) → ((♯‘𝐴) ≠ 0 ↔ 0 < (♯‘𝐴))) | |
5 | 2, 3, 4 | syl2anc 573 | . . . . 5 ⊢ ((♯‘𝐴) ∈ ℕ0 → ((♯‘𝐴) ≠ 0 ↔ 0 < (♯‘𝐴))) |
6 | 5 | bicomd 213 | . . . 4 ⊢ ((♯‘𝐴) ∈ ℕ0 → (0 < (♯‘𝐴) ↔ (♯‘𝐴) ≠ 0)) |
7 | breq2 4791 | . . . . 5 ⊢ ((♯‘𝐴) = +∞ → (0 < (♯‘𝐴) ↔ 0 < +∞)) | |
8 | neeq1 3005 | . . . . . 6 ⊢ ((♯‘𝐴) = +∞ → ((♯‘𝐴) ≠ 0 ↔ +∞ ≠ 0)) | |
9 | 0ltpnf 12161 | . . . . . . 7 ⊢ 0 < +∞ | |
10 | 0re 10246 | . . . . . . . . 9 ⊢ 0 ∈ ℝ | |
11 | renepnf 10293 | . . . . . . . . 9 ⊢ (0 ∈ ℝ → 0 ≠ +∞) | |
12 | 10, 11 | ax-mp 5 | . . . . . . . 8 ⊢ 0 ≠ +∞ |
13 | 12 | necomi 2997 | . . . . . . 7 ⊢ +∞ ≠ 0 |
14 | 9, 13 | 2th 254 | . . . . . 6 ⊢ (0 < +∞ ↔ +∞ ≠ 0) |
15 | 8, 14 | syl6rbbr 279 | . . . . 5 ⊢ ((♯‘𝐴) = +∞ → (0 < +∞ ↔ (♯‘𝐴) ≠ 0)) |
16 | 7, 15 | bitrd 268 | . . . 4 ⊢ ((♯‘𝐴) = +∞ → (0 < (♯‘𝐴) ↔ (♯‘𝐴) ≠ 0)) |
17 | 6, 16 | jaoi 846 | . . 3 ⊢ (((♯‘𝐴) ∈ ℕ0 ∨ (♯‘𝐴) = +∞) → (0 < (♯‘𝐴) ↔ (♯‘𝐴) ≠ 0)) |
18 | 1, 17 | syl 17 | . 2 ⊢ (𝐴 ∈ 𝑉 → (0 < (♯‘𝐴) ↔ (♯‘𝐴) ≠ 0)) |
19 | hasheq0 13356 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅)) | |
20 | 19 | necon3bid 2987 | . 2 ⊢ (𝐴 ∈ 𝑉 → ((♯‘𝐴) ≠ 0 ↔ 𝐴 ≠ ∅)) |
21 | 18, 20 | bitrd 268 | 1 ⊢ (𝐴 ∈ 𝑉 → (0 < (♯‘𝐴) ↔ 𝐴 ≠ ∅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∨ wo 836 = wceq 1631 ∈ wcel 2145 ≠ wne 2943 ∅c0 4063 class class class wbr 4787 ‘cfv 6030 ℝcr 10141 0cc0 10142 +∞cpnf 10277 < clt 10280 ≤ cle 10281 ℕ0cn0 11499 ♯chash 13321 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-8 2147 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-sep 4916 ax-nul 4924 ax-pow 4975 ax-pr 5035 ax-un 7100 ax-cnex 10198 ax-resscn 10199 ax-1cn 10200 ax-icn 10201 ax-addcl 10202 ax-addrcl 10203 ax-mulcl 10204 ax-mulrcl 10205 ax-mulcom 10206 ax-addass 10207 ax-mulass 10208 ax-distr 10209 ax-i2m1 10210 ax-1ne0 10211 ax-1rid 10212 ax-rnegex 10213 ax-rrecex 10214 ax-cnre 10215 ax-pre-lttri 10216 ax-pre-lttrn 10217 ax-pre-ltadd 10218 ax-pre-mulgt0 10219 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-3or 1072 df-3an 1073 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-pss 3739 df-nul 4064 df-if 4227 df-pw 4300 df-sn 4318 df-pr 4320 df-tp 4322 df-op 4324 df-uni 4576 df-int 4613 df-iun 4657 df-br 4788 df-opab 4848 df-mpt 4865 df-tr 4888 df-id 5158 df-eprel 5163 df-po 5171 df-so 5172 df-fr 5209 df-we 5211 df-xp 5256 df-rel 5257 df-cnv 5258 df-co 5259 df-dm 5260 df-rn 5261 df-res 5262 df-ima 5263 df-pred 5822 df-ord 5868 df-on 5869 df-lim 5870 df-suc 5871 df-iota 5993 df-fun 6032 df-fn 6033 df-f 6034 df-f1 6035 df-fo 6036 df-f1o 6037 df-fv 6038 df-riota 6757 df-ov 6799 df-oprab 6800 df-mpt2 6801 df-om 7217 df-1st 7319 df-2nd 7320 df-wrecs 7563 df-recs 7625 df-rdg 7663 df-1o 7717 df-er 7900 df-en 8114 df-dom 8115 df-sdom 8116 df-fin 8117 df-card 8969 df-pnf 10282 df-mnf 10283 df-xr 10284 df-ltxr 10285 df-le 10286 df-sub 10474 df-neg 10475 df-nn 11227 df-n0 11500 df-xnn0 11571 df-z 11585 df-uz 11894 df-fz 12534 df-hash 13322 |
This theorem is referenced by: hashgt0n0 13358 wrdlenge1n0 13536 ccatws1n0 13616 ccatws1n0OLD 13617 swrdlsw 13661 2swrd1eqwrdeq 13663 ccats1swrdeq 13678 ccats1swrdeqrex 13687 wwlksnextinj 27043 clwwlkgt0 27136 clwwlkext2edg 27213 wwlksext2clwwlk 27214 wwlksext2clwwlkOLD 27215 numclwwlk2lem1lem 27525 numclwwlk2lem1lemOLD 27526 tgoldbachgt 31081 pfxsuff1eqwrdeq 41930 ccats1pfxeq 41944 |
Copyright terms: Public domain | W3C validator |