| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hashnn0pnf | Structured version Visualization version GIF version | ||
| Description: The value of the hash function for a set is either a nonnegative integer or positive infinity. TODO-AV: mark as OBSOLETE and replace it by hashxnn0 14371? (Contributed by Alexander van der Vekens, 6-Dec-2017.) |
| Ref | Expression |
|---|---|
| hashnn0pnf | ⊢ (𝑀 ∈ 𝑉 → ((♯‘𝑀) ∈ ℕ0 ∨ (♯‘𝑀) = +∞)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hashf 14370 | . . . 4 ⊢ ♯:V⟶(ℕ0 ∪ {+∞}) | |
| 2 | 1 | a1i 11 | . . 3 ⊢ (𝑀 ∈ 𝑉 → ♯:V⟶(ℕ0 ∪ {+∞})) |
| 3 | elex 3476 | . . 3 ⊢ (𝑀 ∈ 𝑉 → 𝑀 ∈ V) | |
| 4 | 2, 3 | ffvelcdmd 7080 | . 2 ⊢ (𝑀 ∈ 𝑉 → (♯‘𝑀) ∈ (ℕ0 ∪ {+∞})) |
| 5 | elun 4107 | . . 3 ⊢ ((♯‘𝑀) ∈ (ℕ0 ∪ {+∞}) ↔ ((♯‘𝑀) ∈ ℕ0 ∨ (♯‘𝑀) ∈ {+∞})) | |
| 6 | elsni 4606 | . . . 4 ⊢ ((♯‘𝑀) ∈ {+∞} → (♯‘𝑀) = +∞) | |
| 7 | 6 | orim2i 923 | . . 3 ⊢ (((♯‘𝑀) ∈ ℕ0 ∨ (♯‘𝑀) ∈ {+∞}) → ((♯‘𝑀) ∈ ℕ0 ∨ (♯‘𝑀) = +∞)) |
| 8 | 5, 7 | sylbi 220 | . 2 ⊢ ((♯‘𝑀) ∈ (ℕ0 ∪ {+∞}) → ((♯‘𝑀) ∈ ℕ0 ∨ (♯‘𝑀) = +∞)) |
| 9 | 4, 8 | syl 18 | 1 ⊢ (𝑀 ∈ 𝑉 → ((♯‘𝑀) ∈ ℕ0 ∨ (♯‘𝑀) = +∞)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 860 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∪ cun 3903 {csn 4589 ⟶wf 6532 ‘cfv 6536 +∞cpnf 11235 ℕ0cn0 12499 ♯chash 14362 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 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 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-nn 12229 df-n0 12500 df-xnn0 12573 df-z 12587 df-uz 12858 df-hash 14363 |
| This theorem is referenced by: hashnnn0genn0 14375 hashnemnf 14376 hashv01gt1 14377 hashneq0 14396 hashinfxadd 14417 hashge2el2difr 14514 tgldimor 28771 |
| Copyright terms: Public domain | W3C validator |