| 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 11343 | . . . . . . 7 ⊢ +∞ ∉ ℝ | |
| 2 | 1 | neli 3064 | . . . . . 6 ⊢ ¬ +∞ ∈ ℝ |
| 3 | hashinf 14472 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → (♯‘𝐴) = +∞) | |
| 4 | 3 | eleq1d 2846 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ((♯‘𝐴) ∈ ℝ ↔ +∞ ∈ ℝ)) |
| 5 | 2, 4 | mtbiri 330 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ¬ (♯‘𝐴) ∈ ℝ) |
| 6 | id 23 | . . . . . 6 ⊢ ((♯‘𝐴) = 0 → (♯‘𝐴) = 0) | |
| 7 | 0re 11303 | . . . . . 6 ⊢ 0 ∈ ℝ | |
| 8 | 6, 7 | eqeltrdi 2869 | . . . . 5 ⊢ ((♯‘𝐴) = 0 → (♯‘𝐴) ∈ ℝ) |
| 9 | 5, 8 | nsyl 141 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ¬ (♯‘𝐴) = 0) |
| 10 | id 23 | . . . . . . 7 ⊢ (𝐴 = ∅ → 𝐴 = ∅) | |
| 11 | 0fi 9063 | . . . . . . 7 ⊢ ∅ ∈ Fin | |
| 12 | 10, 11 | eqeltrdi 2869 | . . . . . 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 14484 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ ∅ ∈ Fin) → ((♯‘𝐴) = (♯‘∅) ↔ 𝐴 ≈ ∅)) | |
| 18 | 11, 17 | mpan2 704 | . . 3 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) = (♯‘∅) ↔ 𝐴 ≈ ∅)) |
| 19 | fz10 13671 | . . . . . 6 ⊢ (1...0) = ∅ | |
| 20 | 19 | fveq2i 6886 | . . . . 5 ⊢ (♯‘(1...0)) = (♯‘∅) |
| 21 | 0nn0 12614 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 22 | hashfz1 14483 | . . . . . 6 ⊢ (0 ∈ ℕ0 → (♯‘(1...0)) = 0) | |
| 23 | 21, 22 | ax-mp 5 | . . . . 5 ⊢ (♯‘(1...0)) = 0 |
| 24 | 20, 23 | eqtr3i 2786 | . . . 4 ⊢ (♯‘∅) = 0 |
| 25 | 24 | eqeq2i 2774 | . . 3 ⊢ ((♯‘𝐴) = (♯‘∅) ↔ (♯‘𝐴) = 0) |
| 26 | en0 9038 | . . 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 1570 ∈ wcel 2145 ∅c0 4279 class class class wbr 5103 ‘cfv 6537 (class class class)co 7418 ≈ cen 8963 Fincfn 8966 ℝcr 11192 0cc0 11193 1c1 11194 +∞cpnf 11333 ℕ0cn0 12599 ...cfz 13632 ♯chash 14467 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 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 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-1st 7999 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-1o 8469 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-fin 8970 df-card 10013 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-nn 12329 df-n0 12600 df-z 12687 df-uz 12959 df-fz 13633 df-hash 14468 |
| This theorem is used by: hashneq0 14501 hashnncl 14503 hash0 14504 hashelne0d 14505 hashgt0 14525 hashle00 14537 seqcoll2 14603 prprrab 14611 hashle2pr 14615 hashge2el2difr 14619 ccat0 14714 ccat1st1st 14769 wrdind 14864 wrd2ind 14865 swrdccat3blem 14881 rev0 14906 repsw0 14921 cshwidx0 14950 fz1f1o 15869 hashbc0 17176 0hashbc 17178 ram0 17193 cshws0 17272 chnind 18788 chnub 18789 symgvalstruct 19604 gsmsymgrfix 19635 sylow1lem1 19805 sylow1lem4 19808 sylow2blem3 19829 frgpnabllem1 20080 0ringnnzr 20769 01eq0ringOLD 20775 vieta1lem2 26627 tgldimor 28958 uhgr0vsize0 29813 uhgr0edgfi 29814 usgr1v0e 29900 fusgrfisbase 29902 vtxd0nedgb 30062 vtxdusgr0edgnelALT 30070 usgrvd0nedg 30107 vtxdginducedm1lem4 30116 finsumvtxdg2size 30124 cyclnspth 30382 spthcycl 30385 iswwlksnx 30422 umgrclwwlkge2 30575 clwwisshclwws 30599 hashecclwwlkn1 30661 umgrhashecclwwlk 30662 vdn0conngrumgrv2 30790 frgrwopreg 30917 frrusgrord0lem 30933 wlkl0 30961 frgrregord013 30989 frgrregord13 30990 frgrogt3nreg 30991 friendshipgt3 30992 hashne0 33394 wrdt2ind 33509 tocyc01 33672 esplyfval0 34189 vieta 34205 lvecdim0i 34231 hasheuni 34710 signstfvn 35191 signstfveq0a 35198 signshnz 35213 usgrgt2cycl 35888 acycgr1v 35893 umgracycusgr 35898 cusgracyclt3v 35900 elmrsubrn 36264 fsuppind 43598 lindsrng01 49549 |
| Copyright terms: Public domain | W3C validator |