| 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 11246 | . . . . . . 7 ⊢ +∞ ∉ ℝ | |
| 2 | 1 | neli 3072 | . . . . . 6 ⊢ ¬ +∞ ∈ ℝ |
| 3 | hashinf 14367 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → (♯‘𝐴) = +∞) | |
| 4 | 3 | eleq1d 2854 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ((♯‘𝐴) ∈ ℝ ↔ +∞ ∈ ℝ)) |
| 5 | 2, 4 | mtbiri 330 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ¬ (♯‘𝐴) ∈ ℝ) |
| 6 | id 23 | . . . . . 6 ⊢ ((♯‘𝐴) = 0 → (♯‘𝐴) = 0) | |
| 7 | 0re 11206 | . . . . . 6 ⊢ 0 ∈ ℝ | |
| 8 | 6, 7 | eqeltrdi 2877 | . . . . 5 ⊢ ((♯‘𝐴) = 0 → (♯‘𝐴) ∈ ℝ) |
| 9 | 5, 8 | nsyl 141 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ¬ (♯‘𝐴) = 0) |
| 10 | id 23 | . . . . . . 7 ⊢ (𝐴 = ∅ → 𝐴 = ∅) | |
| 11 | 0fi 9035 | . . . . . . 7 ⊢ ∅ ∈ Fin | |
| 12 | 10, 11 | eqeltrdi 2877 | . . . . . 6 ⊢ (𝐴 = ∅ → 𝐴 ∈ Fin) |
| 13 | 12 | con3i 155 | . . . . 5 ⊢ (¬ 𝐴 ∈ Fin → ¬ 𝐴 = ∅) |
| 14 | 13 | adantl 486 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ¬ 𝐴 = ∅) |
| 15 | 9, 14 | 2falsed 379 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅)) |
| 16 | 15 | ex 417 | . 2 ⊢ (𝐴 ∈ 𝑉 → (¬ 𝐴 ∈ Fin → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅))) |
| 17 | hashen 14379 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ ∅ ∈ Fin) → ((♯‘𝐴) = (♯‘∅) ↔ 𝐴 ≈ ∅)) | |
| 18 | 11, 17 | mpan2 703 | . . 3 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) = (♯‘∅) ↔ 𝐴 ≈ ∅)) |
| 19 | fz10 13569 | . . . . . 6 ⊢ (1...0) = ∅ | |
| 20 | 19 | fveq2i 6882 | . . . . 5 ⊢ (♯‘(1...0)) = (♯‘∅) |
| 21 | 0nn0 12515 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 22 | hashfz1 14378 | . . . . . 6 ⊢ (0 ∈ ℕ0 → (♯‘(1...0)) = 0) | |
| 23 | 21, 22 | ax-mp 5 | . . . . 5 ⊢ (♯‘(1...0)) = 0 |
| 24 | 20, 23 | eqtr3i 2794 | . . . 4 ⊢ (♯‘∅) = 0 |
| 25 | 24 | eqeq2i 2782 | . . 3 ⊢ ((♯‘𝐴) = (♯‘∅) ↔ (♯‘𝐴) = 0) |
| 26 | en0 9011 | . . 3 ⊢ (𝐴 ≈ ∅ ↔ 𝐴 = ∅) | |
| 27 | 18, 25, 26 | 3bitr3g 316 | . 2 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅)) |
| 28 | 16, 27 | pm2.61d2 183 | 1 ⊢ (𝐴 ∈ 𝑉 → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∅c0 4294 class class class wbr 5110 ‘cfv 6533 (class class class)co 7408 ≈ cen 8936 Fincfn 8939 ℝcr 11095 0cc0 11096 1c1 11097 +∞cpnf 11236 ℕ0cn0 12500 ...cfz 13531 ♯chash 14362 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-card 9921 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-nn 12230 df-n0 12501 df-z 12588 df-uz 12859 df-fz 13532 df-hash 14363 |
| This theorem is referenced by: hashneq0 14396 hashnncl 14398 hash0 14399 hashelne0d 14400 hashgt0 14420 hashle00 14432 seqcoll2 14498 prprrab 14506 hashle2pr 14510 hashge2el2difr 14514 ccat0 14609 ccat1st1st 14662 wrdind 14755 wrd2ind 14756 swrdccat3blem 14772 rev0 14797 repsw0 14810 cshwidx0 14839 fz1f1o 15757 hashbc0 17061 0hashbc 17063 ram0 17078 cshws0 17157 chnind 18673 chnub 18674 symgvalstruct 19463 gsmsymgrfix 19494 sylow1lem1 19664 sylow1lem4 19667 sylow2blem3 19688 frgpnabllem1 19939 0ringnnzr 20605 01eq0ringOLD 20611 vieta1lem2 26437 tgldimor 28733 uhgr0vsize0 29526 uhgr0edgfi 29527 usgr1v0e 29613 fusgrfisbase 29615 vtxd0nedgb 29775 vtxdusgr0edgnelALT 29783 usgrvd0nedg 29820 vtxdginducedm1lem4 29829 finsumvtxdg2size 29837 cyclnspth 30087 iswwlksnx 30126 umgrclwwlkge2 30279 clwwisshclwws 30303 hashecclwwlkn1 30365 umgrhashecclwwlk 30366 vdn0conngrumgrv2 30484 frgrwopreg 30611 frrusgrord0lem 30627 wlkl0 30655 frgrregord013 30683 frgrregord13 30684 frgrogt3nreg 30685 friendshipgt3 30686 hashne0 33091 wrdt2ind 33210 tocyc01 33375 esplyfval0 33895 vieta 33911 lvecdim0i 33937 hasheuni 34416 signstfvn 34897 signstfveq0a 34904 signshnz 34919 spthcycl 35516 usgrgt2cycl 35517 acycgr1v 35536 umgracycusgr 35541 cusgracyclt3v 35543 elmrsubrn 35907 fsuppind 43207 lindsrng01 49126 |
| Copyright terms: Public domain | W3C validator |