| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fihasheq0 | GIF version | ||
| Description: Two ways of saying a finite set is empty. (Contributed by Paul Chapman, 26-Oct-2012.) (Revised by Mario Carneiro, 27-Jul-2014.) (Intuitionized by Jim Kingdon, 23-Feb-2022.) |
| Ref | Expression |
|---|---|
| fihasheq0 | ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0fi 7154 | . . 3 ⊢ ∅ ∈ Fin | |
| 2 | hashen 11172 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ ∅ ∈ Fin) → ((♯‘𝐴) = (♯‘∅) ↔ 𝐴 ≈ ∅)) | |
| 3 | 1, 2 | mpan2 425 | . 2 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) = (♯‘∅) ↔ 𝐴 ≈ ∅)) |
| 4 | fz10 10400 | . . . . 5 ⊢ (1...0) = ∅ | |
| 5 | 4 | fveq2i 5678 | . . . 4 ⊢ (♯‘(1...0)) = (♯‘∅) |
| 6 | 0nn0 9528 | . . . . 5 ⊢ 0 ∈ ℕ0 | |
| 7 | hashfz1 11171 | . . . . 5 ⊢ (0 ∈ ℕ0 → (♯‘(1...0)) = 0) | |
| 8 | 6, 7 | ax-mp 5 | . . . 4 ⊢ (♯‘(1...0)) = 0 |
| 9 | 5, 8 | eqtr3i 2257 | . . 3 ⊢ (♯‘∅) = 0 |
| 10 | 9 | eqeq2i 2245 | . 2 ⊢ ((♯‘𝐴) = (♯‘∅) ↔ (♯‘𝐴) = 0) |
| 11 | en0 7048 | . 2 ⊢ (𝐴 ≈ ∅ ↔ 𝐴 = ∅) | |
| 12 | 3, 10, 11 | 3bitr3g 222 | 1 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1398 ∈ wcel 2205 ∅c0 3512 class class class wbr 4114 ‘cfv 5357 (class class class)co 6058 ≈ cen 6986 Fincfn 6988 0cc0 8143 1c1 8144 ℕ0cn0 9513 ...cfz 10361 ♯chash 11163 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-addcom 8243 ax-addass 8245 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-0id 8251 ax-rnegex 8252 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-apti 8258 ax-pre-ltadd 8259 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-iord 4492 df-on 4494 df-ilim 4495 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-recs 6549 df-frec 6635 df-1o 6660 df-er 6780 df-en 6989 df-dom 6990 df-fin 6991 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8462 df-neg 8463 df-inn 9255 df-n0 9514 df-z 9595 df-uz 9872 df-fz 10362 df-ihash 11164 |
| This theorem is referenced by: fihashneq0 11182 hashnncl 11183 hash0 11184 fihashelne0d 11185 ccat0 11309 ccat1st1st 11354 wrdind 11439 wrd2ind 11440 swrdccat3blem 11456 fz1f1o 12085 gfsumval 14102 vtxd0nedgbfi 16420 umgrclwwlkge2 16523 |
| Copyright terms: Public domain | W3C validator |