![]() |
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 14236? (Contributed by Alexander van der Vekens, 6-Dec-2017.) |
Ref | Expression |
---|---|
hashnn0pnf | ⊢ (𝑀 ∈ 𝑉 → ((♯‘𝑀) ∈ ℕ0 ∨ (♯‘𝑀) = +∞)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hashf 14235 | . . . 4 ⊢ ♯:V⟶(ℕ0 ∪ {+∞}) | |
2 | 1 | a1i 11 | . . 3 ⊢ (𝑀 ∈ 𝑉 → ♯:V⟶(ℕ0 ∪ {+∞})) |
3 | elex 3462 | . . 3 ⊢ (𝑀 ∈ 𝑉 → 𝑀 ∈ V) | |
4 | 2, 3 | ffvelcdmd 7033 | . 2 ⊢ (𝑀 ∈ 𝑉 → (♯‘𝑀) ∈ (ℕ0 ∪ {+∞})) |
5 | elun 4107 | . . 3 ⊢ ((♯‘𝑀) ∈ (ℕ0 ∪ {+∞}) ↔ ((♯‘𝑀) ∈ ℕ0 ∨ (♯‘𝑀) ∈ {+∞})) | |
6 | elsni 4602 | . . . 4 ⊢ ((♯‘𝑀) ∈ {+∞} → (♯‘𝑀) = +∞) | |
7 | 6 | orim2i 909 | . . 3 ⊢ (((♯‘𝑀) ∈ ℕ0 ∨ (♯‘𝑀) ∈ {+∞}) → ((♯‘𝑀) ∈ ℕ0 ∨ (♯‘𝑀) = +∞)) |
8 | 5, 7 | sylbi 216 | . 2 ⊢ ((♯‘𝑀) ∈ (ℕ0 ∪ {+∞}) → ((♯‘𝑀) ∈ ℕ0 ∨ (♯‘𝑀) = +∞)) |
9 | 4, 8 | syl 17 | 1 ⊢ (𝑀 ∈ 𝑉 → ((♯‘𝑀) ∈ ℕ0 ∨ (♯‘𝑀) = +∞)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∨ wo 845 = wceq 1541 ∈ wcel 2106 Vcvv 3444 ∪ cun 3907 {csn 4585 ⟶wf 6490 ‘cfv 6494 +∞cpnf 11183 ℕ0cn0 12410 ♯chash 14227 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-sep 5255 ax-nul 5262 ax-pow 5319 ax-pr 5383 ax-un 7669 ax-cnex 11104 ax-resscn 11105 ax-1cn 11106 ax-icn 11107 ax-addcl 11108 ax-addrcl 11109 ax-mulcl 11110 ax-mulrcl 11111 ax-mulcom 11112 ax-addass 11113 ax-mulass 11114 ax-distr 11115 ax-i2m1 11116 ax-1ne0 11117 ax-1rid 11118 ax-rnegex 11119 ax-rrecex 11120 ax-cnre 11121 ax-pre-lttri 11122 ax-pre-lttrn 11123 ax-pre-ltadd 11124 ax-pre-mulgt0 11125 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3064 df-rex 3073 df-reu 3353 df-rab 3407 df-v 3446 df-sbc 3739 df-csb 3855 df-dif 3912 df-un 3914 df-in 3916 df-ss 3926 df-pss 3928 df-nul 4282 df-if 4486 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4865 df-int 4907 df-iun 4955 df-br 5105 df-opab 5167 df-mpt 5188 df-tr 5222 df-id 5530 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5587 df-we 5589 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6252 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6446 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-riota 7310 df-ov 7357 df-oprab 7358 df-mpo 7359 df-om 7800 df-2nd 7919 df-frecs 8209 df-wrecs 8240 df-recs 8314 df-rdg 8353 df-1o 8409 df-er 8645 df-en 8881 df-dom 8882 df-sdom 8883 df-fin 8884 df-card 9872 df-pnf 11188 df-mnf 11189 df-xr 11190 df-ltxr 11191 df-le 11192 df-sub 11384 df-neg 11385 df-nn 12151 df-n0 12411 df-xnn0 12483 df-z 12497 df-uz 12761 df-hash 14228 |
This theorem is referenced by: hashnnn0genn0 14240 hashnemnf 14241 hashv01gt1 14242 hashneq0 14261 hashinfxadd 14282 hashge2el2difr 14377 tgldimor 27342 |
Copyright terms: Public domain | W3C validator |