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 13696 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ((♯‘𝐴) ∈ ℕ0 ∨ (♯‘𝐴) = +∞)) | |
2 | nn0re 11900 | . . . . . 6 ⊢ ((♯‘𝐴) ∈ ℕ0 → (♯‘𝐴) ∈ ℝ) | |
3 | nn0ge0 11916 | . . . . . 6 ⊢ ((♯‘𝐴) ∈ ℕ0 → 0 ≤ (♯‘𝐴)) | |
4 | ne0gt0 10739 | . . . . . 6 ⊢ (((♯‘𝐴) ∈ ℝ ∧ 0 ≤ (♯‘𝐴)) → ((♯‘𝐴) ≠ 0 ↔ 0 < (♯‘𝐴))) | |
5 | 2, 3, 4 | syl2anc 586 | . . . . 5 ⊢ ((♯‘𝐴) ∈ ℕ0 → ((♯‘𝐴) ≠ 0 ↔ 0 < (♯‘𝐴))) |
6 | 5 | bicomd 225 | . . . 4 ⊢ ((♯‘𝐴) ∈ ℕ0 → (0 < (♯‘𝐴) ↔ (♯‘𝐴) ≠ 0)) |
7 | breq2 5062 | . . . . 5 ⊢ ((♯‘𝐴) = +∞ → (0 < (♯‘𝐴) ↔ 0 < +∞)) | |
8 | neeq1 3078 | . . . . . 6 ⊢ ((♯‘𝐴) = +∞ → ((♯‘𝐴) ≠ 0 ↔ +∞ ≠ 0)) | |
9 | 0ltpnf 12511 | . . . . . . 7 ⊢ 0 < +∞ | |
10 | 0re 10637 | . . . . . . . . 9 ⊢ 0 ∈ ℝ | |
11 | renepnf 10683 | . . . . . . . . 9 ⊢ (0 ∈ ℝ → 0 ≠ +∞) | |
12 | 10, 11 | ax-mp 5 | . . . . . . . 8 ⊢ 0 ≠ +∞ |
13 | 12 | necomi 3070 | . . . . . . 7 ⊢ +∞ ≠ 0 |
14 | 9, 13 | 2th 266 | . . . . . 6 ⊢ (0 < +∞ ↔ +∞ ≠ 0) |
15 | 8, 14 | syl6rbbr 292 | . . . . 5 ⊢ ((♯‘𝐴) = +∞ → (0 < +∞ ↔ (♯‘𝐴) ≠ 0)) |
16 | 7, 15 | bitrd 281 | . . . 4 ⊢ ((♯‘𝐴) = +∞ → (0 < (♯‘𝐴) ↔ (♯‘𝐴) ≠ 0)) |
17 | 6, 16 | jaoi 853 | . . 3 ⊢ (((♯‘𝐴) ∈ ℕ0 ∨ (♯‘𝐴) = +∞) → (0 < (♯‘𝐴) ↔ (♯‘𝐴) ≠ 0)) |
18 | 1, 17 | syl 17 | . 2 ⊢ (𝐴 ∈ 𝑉 → (0 < (♯‘𝐴) ↔ (♯‘𝐴) ≠ 0)) |
19 | hasheq0 13718 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅)) | |
20 | 19 | necon3bid 3060 | . 2 ⊢ (𝐴 ∈ 𝑉 → ((♯‘𝐴) ≠ 0 ↔ 𝐴 ≠ ∅)) |
21 | 18, 20 | bitrd 281 | 1 ⊢ (𝐴 ∈ 𝑉 → (0 < (♯‘𝐴) ↔ 𝐴 ≠ ∅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∨ wo 843 = wceq 1533 ∈ wcel 2110 ≠ wne 3016 ∅c0 4290 class class class wbr 5058 ‘cfv 6349 ℝcr 10530 0cc0 10531 +∞cpnf 10666 < clt 10669 ≤ cle 10670 ℕ0cn0 11891 ♯chash 13684 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-card 9362 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-n0 11892 df-xnn0 11962 df-z 11976 df-uz 12238 df-fz 12887 df-hash 13685 |
This theorem is referenced by: hashgt0n0 13720 wrdlenge1n0 13896 ccatws1n0 13985 swrdlsw 14023 pfxsuff1eqwrdeq 14055 ccats1pfxeq 14070 wwlksnextinj 27671 clwwlkext2edg 27829 wwlksext2clwwlk 27830 numclwwlk2lem1lem 28115 tgoldbachgt 31929 lfuhgr2 32360 |
Copyright terms: Public domain | W3C validator |