![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > hashfiv01gt1 | GIF version |
Description: The size of a finite set is either 0 or 1 or greater than 1. (Contributed by Jim Kingdon, 21-Feb-2022.) |
Ref | Expression |
---|---|
hashfiv01gt1 | ⊢ (𝑀 ∈ Fin → ((♯‘𝑀) = 0 ∨ (♯‘𝑀) = 1 ∨ 1 < (♯‘𝑀))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpr 110 | . . 3 ⊢ ((𝑀 ∈ Fin ∧ (♯‘𝑀) < 0) → (♯‘𝑀) < 0) | |
2 | hashcl 10754 | . . . . 5 ⊢ (𝑀 ∈ Fin → (♯‘𝑀) ∈ ℕ0) | |
3 | nn0nlt0 9198 | . . . . 5 ⊢ ((♯‘𝑀) ∈ ℕ0 → ¬ (♯‘𝑀) < 0) | |
4 | 2, 3 | syl 14 | . . . 4 ⊢ (𝑀 ∈ Fin → ¬ (♯‘𝑀) < 0) |
5 | 4 | adantr 276 | . . 3 ⊢ ((𝑀 ∈ Fin ∧ (♯‘𝑀) < 0) → ¬ (♯‘𝑀) < 0) |
6 | 1, 5 | pm2.21dd 620 | . 2 ⊢ ((𝑀 ∈ Fin ∧ (♯‘𝑀) < 0) → ((♯‘𝑀) = 0 ∨ (♯‘𝑀) = 1 ∨ 1 < (♯‘𝑀))) |
7 | orc 712 | . . . 4 ⊢ (((♯‘𝑀) = 0 ∨ (♯‘𝑀) = 1) → (((♯‘𝑀) = 0 ∨ (♯‘𝑀) = 1) ∨ 1 < (♯‘𝑀))) | |
8 | fz01or 10106 | . . . 4 ⊢ ((♯‘𝑀) ∈ (0...1) ↔ ((♯‘𝑀) = 0 ∨ (♯‘𝑀) = 1)) | |
9 | df-3or 979 | . . . 4 ⊢ (((♯‘𝑀) = 0 ∨ (♯‘𝑀) = 1 ∨ 1 < (♯‘𝑀)) ↔ (((♯‘𝑀) = 0 ∨ (♯‘𝑀) = 1) ∨ 1 < (♯‘𝑀))) | |
10 | 7, 8, 9 | 3imtr4i 201 | . . 3 ⊢ ((♯‘𝑀) ∈ (0...1) → ((♯‘𝑀) = 0 ∨ (♯‘𝑀) = 1 ∨ 1 < (♯‘𝑀))) |
11 | 10 | adantl 277 | . 2 ⊢ ((𝑀 ∈ Fin ∧ (♯‘𝑀) ∈ (0...1)) → ((♯‘𝑀) = 0 ∨ (♯‘𝑀) = 1 ∨ 1 < (♯‘𝑀))) |
12 | 3mix3 1168 | . . 3 ⊢ (1 < (♯‘𝑀) → ((♯‘𝑀) = 0 ∨ (♯‘𝑀) = 1 ∨ 1 < (♯‘𝑀))) | |
13 | 12 | adantl 277 | . 2 ⊢ ((𝑀 ∈ Fin ∧ 1 < (♯‘𝑀)) → ((♯‘𝑀) = 0 ∨ (♯‘𝑀) = 1 ∨ 1 < (♯‘𝑀))) |
14 | 2 | nn0zd 9369 | . . 3 ⊢ (𝑀 ∈ Fin → (♯‘𝑀) ∈ ℤ) |
15 | 0zd 9261 | . . 3 ⊢ (𝑀 ∈ Fin → 0 ∈ ℤ) | |
16 | 1zzd 9276 | . . 3 ⊢ (𝑀 ∈ Fin → 1 ∈ ℤ) | |
17 | fztri3or 10034 | . . 3 ⊢ (((♯‘𝑀) ∈ ℤ ∧ 0 ∈ ℤ ∧ 1 ∈ ℤ) → ((♯‘𝑀) < 0 ∨ (♯‘𝑀) ∈ (0...1) ∨ 1 < (♯‘𝑀))) | |
18 | 14, 15, 16, 17 | syl3anc 1238 | . 2 ⊢ (𝑀 ∈ Fin → ((♯‘𝑀) < 0 ∨ (♯‘𝑀) ∈ (0...1) ∨ 1 < (♯‘𝑀))) |
19 | 6, 11, 13, 18 | mpjao3dan 1307 | 1 ⊢ (𝑀 ∈ Fin → ((♯‘𝑀) = 0 ∨ (♯‘𝑀) = 1 ∨ 1 < (♯‘𝑀))) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 708 ∨ w3o 977 = wceq 1353 ∈ wcel 2148 class class class wbr 4002 ‘cfv 5215 (class class class)co 5872 Fincfn 6737 0cc0 7808 1c1 7809 < clt 7988 ℕ0cn0 9172 ℤcz 9249 ...cfz 10004 ♯chash 10748 |
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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4117 ax-sep 4120 ax-nul 4128 ax-pow 4173 ax-pr 4208 ax-un 4432 ax-setind 4535 ax-iinf 4586 ax-cnex 7899 ax-resscn 7900 ax-1cn 7901 ax-1re 7902 ax-icn 7903 ax-addcl 7904 ax-addrcl 7905 ax-mulcl 7906 ax-addcom 7908 ax-addass 7910 ax-distr 7912 ax-i2m1 7913 ax-0lt1 7914 ax-0id 7916 ax-rnegex 7917 ax-cnre 7919 ax-pre-ltirr 7920 ax-pre-ltwlin 7921 ax-pre-lttrn 7922 ax-pre-apti 7923 ax-pre-ltadd 7924 |
This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2739 df-sbc 2963 df-csb 3058 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-nul 3423 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3810 df-int 3845 df-iun 3888 df-br 4003 df-opab 4064 df-mpt 4065 df-tr 4101 df-id 4292 df-iord 4365 df-on 4367 df-ilim 4368 df-suc 4370 df-iom 4589 df-xp 4631 df-rel 4632 df-cnv 4633 df-co 4634 df-dm 4635 df-rn 4636 df-res 4637 df-ima 4638 df-iota 5177 df-fun 5217 df-fn 5218 df-f 5219 df-f1 5220 df-fo 5221 df-f1o 5222 df-fv 5223 df-riota 5828 df-ov 5875 df-oprab 5876 df-mpo 5877 df-recs 6303 df-frec 6389 df-er 6532 df-en 6738 df-dom 6739 df-fin 6740 df-pnf 7990 df-mnf 7991 df-xr 7992 df-ltxr 7993 df-le 7994 df-sub 8126 df-neg 8127 df-inn 8916 df-n0 9173 df-z 9250 df-uz 9525 df-fz 10005 df-ihash 10749 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |