| 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 7116 | . . 3 ⊢ ∅ ∈ Fin | |
| 2 | hashen 11109 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ ∅ ∈ Fin) → ((♯‘𝐴) = (♯‘∅) ↔ 𝐴 ≈ ∅)) | |
| 3 | 1, 2 | mpan2 425 | . 2 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) = (♯‘∅) ↔ 𝐴 ≈ ∅)) |
| 4 | fz10 10343 | . . . . 5 ⊢ (1...0) = ∅ | |
| 5 | 4 | fveq2i 5651 | . . . 4 ⊢ (♯‘(1...0)) = (♯‘∅) |
| 6 | 0nn0 9476 | . . . . 5 ⊢ 0 ∈ ℕ0 | |
| 7 | hashfz1 11108 | . . . . 5 ⊢ (0 ∈ ℕ0 → (♯‘(1...0)) = 0) | |
| 8 | 6, 7 | ax-mp 5 | . . . 4 ⊢ (♯‘(1...0)) = 0 |
| 9 | 5, 8 | eqtr3i 2254 | . . 3 ⊢ (♯‘∅) = 0 |
| 10 | 9 | eqeq2i 2242 | . 2 ⊢ ((♯‘𝐴) = (♯‘∅) ↔ (♯‘𝐴) = 0) |
| 11 | en0 7012 | . 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 2202 ∅c0 3496 class class class wbr 4093 ‘cfv 5333 (class class class)co 6028 ≈ cen 6950 Fincfn 6952 0cc0 8092 1c1 8093 ℕ0cn0 9461 ...cfz 10305 ♯chash 11100 |
| 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 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 ax-cnex 8183 ax-resscn 8184 ax-1cn 8185 ax-1re 8186 ax-icn 8187 ax-addcl 8188 ax-addrcl 8189 ax-mulcl 8190 ax-addcom 8192 ax-addass 8194 ax-distr 8196 ax-i2m1 8197 ax-0lt1 8198 ax-0id 8200 ax-rnegex 8201 ax-cnre 8203 ax-pre-ltirr 8204 ax-pre-ltwlin 8205 ax-pre-lttrn 8206 ax-pre-apti 8207 ax-pre-ltadd 8208 |
| 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 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-iord 4469 df-on 4471 df-ilim 4472 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-recs 6514 df-frec 6600 df-1o 6625 df-er 6745 df-en 6953 df-dom 6954 df-fin 6955 df-pnf 8275 df-mnf 8276 df-xr 8277 df-ltxr 8278 df-le 8279 df-sub 8411 df-neg 8412 df-inn 9203 df-n0 9462 df-z 9541 df-uz 9817 df-fz 10306 df-ihash 11101 |
| This theorem is referenced by: fihashneq0 11119 hashnncl 11120 hash0 11121 fihashelne0d 11122 ccat0 11239 ccat1st1st 11284 wrdind 11369 wrd2ind 11370 swrdccat3blem 11386 fz1f1o 12015 vtxd0nedgbfi 16240 umgrclwwlkge2 16343 gfsumval 16809 |
| Copyright terms: Public domain | W3C validator |