| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hasheq0 | Structured version Visualization version GIF version | ||
| Description: Two ways of saying a set is empty. (Contributed by Paul Chapman, 26-Oct-2012.) (Revised by Mario Carneiro, 27-Jul-2014.) |
| Ref | Expression |
|---|---|
| hasheq0 | ⊢ (𝐴 ∈ 𝑉 → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pnfnre 11357 | . . . . . . 7 ⊢ +∞ ∉ ℝ | |
| 2 | 1 | neli 3063 | . . . . . 6 ⊢ ¬ +∞ ∈ ℝ |
| 3 | hashinf 14486 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → (♯‘𝐴) = +∞) | |
| 4 | 3 | eleq1d 2845 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ((♯‘𝐴) ∈ ℝ ↔ +∞ ∈ ℝ)) |
| 5 | 2, 4 | mtbiri 330 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ¬ (♯‘𝐴) ∈ ℝ) |
| 6 | id 23 | . . . . . 6 ⊢ ((♯‘𝐴) = 0 → (♯‘𝐴) = 0) | |
| 7 | 0re 11317 | . . . . . 6 ⊢ 0 ∈ ℝ | |
| 8 | 6, 7 | eqeltrdi 2868 | . . . . 5 ⊢ ((♯‘𝐴) = 0 → (♯‘𝐴) ∈ ℝ) |
| 9 | 5, 8 | nsyl 141 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ¬ (♯‘𝐴) = 0) |
| 10 | id 23 | . . . . . . 7 ⊢ (𝐴 = ∅ → 𝐴 = ∅) | |
| 11 | 0fi 9077 | . . . . . . 7 ⊢ ∅ ∈ Fin | |
| 12 | 10, 11 | eqeltrdi 2868 | . . . . . 6 ⊢ (𝐴 = ∅ → 𝐴 ∈ Fin) |
| 13 | 12 | con3i 155 | . . . . 5 ⊢ (¬ 𝐴 ∈ Fin → ¬ 𝐴 = ∅) |
| 14 | 13 | adantl 487 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ¬ 𝐴 = ∅) |
| 15 | 9, 14 | 2falsed 379 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅)) |
| 16 | 15 | ex 418 | . 2 ⊢ (𝐴 ∈ 𝑉 → (¬ 𝐴 ∈ Fin → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅))) |
| 17 | hashen 14498 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ ∅ ∈ Fin) → ((♯‘𝐴) = (♯‘∅) ↔ 𝐴 ≈ ∅)) | |
| 18 | 11, 17 | mpan2 704 | . . 3 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) = (♯‘∅) ↔ 𝐴 ≈ ∅)) |
| 19 | fz10 13685 | . . . . . 6 ⊢ (1...0) = ∅ | |
| 20 | 19 | fveq2i 6893 | . . . . 5 ⊢ (♯‘(1...0)) = (♯‘∅) |
| 21 | 0nn0 12628 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 22 | hashfz1 14497 | . . . . . 6 ⊢ (0 ∈ ℕ0 → (♯‘(1...0)) = 0) | |
| 23 | 21, 22 | ax-mp 5 | . . . . 5 ⊢ (♯‘(1...0)) = 0 |
| 24 | 20, 23 | eqtr3i 2785 | . . . 4 ⊢ (♯‘∅) = 0 |
| 25 | 24 | eqeq2i 2773 | . . 3 ⊢ ((♯‘𝐴) = (♯‘∅) ↔ (♯‘𝐴) = 0) |
| 26 | en0 9052 | . . 3 ⊢ (𝐴 ≈ ∅ ↔ 𝐴 = ∅) | |
| 27 | 18, 25, 26 | 3bitr3g 316 | . 2 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅)) |
| 28 | 16, 27 | pm2.61d2 183 | 1 ⊢ (𝐴 ∈ 𝑉 → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∅c0 4277 class class class wbr 5102 ‘cfv 6543 (class class class)co 7424 ≈ cen 8977 Fincfn 8980 ℝcr 11206 0cc0 11207 1c1 11208 +∞cpnf 11347 ℕ0cn0 12613 ...cfz 13646 ♯chash 14481 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-frecs 8306 df-wrecs 8337 df-recs 8386 df-rdg 8425 df-1o 8483 df-er 8724 df-en 8981 df-dom 8982 df-sdom 8983 df-fin 8984 df-card 10027 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-nn 12343 df-n0 12614 df-z 12701 df-uz 12973 df-fz 13647 df-hash 14482 |
| This theorem is used by: hashneq0 14515 hashnncl 14517 hash0 14518 hashelne0d 14519 hashgt0 14539 hashle00 14551 seqcoll2 14617 prprrab 14625 hashle2pr 14629 hashge2el2difr 14633 ccat0 14728 ccat1st1st 14784 wrdind 14879 wrd2ind 14880 swrdccat3blem 14896 rev0 14921 repsw0 14936 cshwidx0 14965 fz1f1o 15885 hashbc0 17192 0hashbc 17194 ram0 17209 cshws0 17288 chnind 18804 chnub 18805 symgvalstruct 19620 gsmsymgrfix 19651 sylow1lem1 19821 sylow1lem4 19824 sylow2blem3 19845 frgpnabllem1 20096 0ringnnzr 20785 01eq0ringOLD 20791 vieta1lem2 26643 tgldimor 28974 uhgr0vsize0 29829 uhgr0edgfi 29830 usgr1v0e 29916 fusgrfisbase 29918 vtxd0nedgb 30078 vtxdusgr0edgnelALT 30086 usgrvd0nedg 30123 vtxdginducedm1lem4 30132 finsumvtxdg2size 30140 cyclnspth 30398 spthcycl 30401 iswwlksnx 30438 umgrclwwlkge2 30591 clwwisshclwws 30615 hashecclwwlkn1 30677 umgrhashecclwwlk 30678 vdn0conngrumgrv2 30806 frgrwopreg 30933 frrusgrord0lem 30949 wlkl0 30977 frgrregord013 31005 frgrregord13 31006 frgrogt3nreg 31007 friendshipgt3 31008 hashne0 33451 wrdt2ind 33566 tocyc01 33729 esplyfval0 34246 vieta 34262 lvecdim0i 34288 hasheuni 34767 signstfvn 35248 signstfveq0a 35255 signshnz 35270 usgrgt2cycl 35989 acycgr1v 35994 umgracycusgr 35999 cusgracyclt3v 36001 elmrsubrn 36375 fsuppind 43727 lindsrng01 49688 |
| Copyright terms: Public domain | W3C validator |