| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > bitsss | Structured version Visualization version GIF version | ||
| Description: The set of bits of an integer is a subset of ℕ0. (Contributed by Mario Carneiro, 5-Sep-2016.) |
| Ref | Expression |
|---|---|
| bitsss | ⊢ (bits‘𝑁) ⊆ ℕ0 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bitsval 16599 | . . 3 ⊢ (𝑚 ∈ (bits‘𝑁) ↔ (𝑁 ∈ ℤ ∧ 𝑚 ∈ ℕ0 ∧ ¬ 2 ∥ (⌊‘(𝑁 / (2↑𝑚))))) | |
| 2 | 1 | simp2bi 1164 | . 2 ⊢ (𝑚 ∈ (bits‘𝑁) → 𝑚 ∈ ℕ0) |
| 3 | 2 | ssriv 3912 | 1 ⊢ (bits‘𝑁) ⊆ ℕ0 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ∈ wcel 2144 ⊆ wss 3895 class class class wbr 5102 ‘cfv 6538 (class class class)co 7420 / cdiv 11976 2c2 12400 ℕ0cn0 12609 ℤcz 12696 ⌊cfl 13933 ↑cexp 14207 ∥ cdvds 16427 bitscbits 16594 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-1cn 11261 ax-addcl 11263 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-om 7878 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-nn 12339 df-n0 12610 df-bits 16597 |
| This theorem is used by: bitsinv2 16618 bitsf1ocnv 16619 sadaddlem 16641 sadadd 16642 bitsres 16648 bitsshft 16650 smumullem 16667 smumul 16668 eulerpartlemgc 35040 eulerpartlemgvv 35054 eulerpartlemgh 35056 eulerpartlemgs2 35058 |
| Copyright terms: Public domain | W3C validator |