|   | 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 16462 | . . 3 ⊢ (𝑚 ∈ (bits‘𝑁) ↔ (𝑁 ∈ ℤ ∧ 𝑚 ∈ ℕ0 ∧ ¬ 2 ∥ (⌊‘(𝑁 / (2↑𝑚))))) | |
| 2 | 1 | simp2bi 1146 | . 2 ⊢ (𝑚 ∈ (bits‘𝑁) → 𝑚 ∈ ℕ0) | 
| 3 | 2 | ssriv 3986 | 1 ⊢ (bits‘𝑁) ⊆ ℕ0 | 
| Colors of variables: wff setvar class | 
| Syntax hints: ¬ wn 3 ∈ wcel 2107 ⊆ wss 3950 class class class wbr 5142 ‘cfv 6560 (class class class)co 7432 / cdiv 11921 2c2 12322 ℕ0cn0 12528 ℤcz 12615 ⌊cfl 13831 ↑cexp 14103 ∥ cdvds 16291 bitscbits 16457 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-sep 5295 ax-nul 5305 ax-pr 5431 ax-un 7756 ax-cnex 11212 ax-1cn 11214 ax-addcl 11216 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-ral 3061 df-rex 3070 df-reu 3380 df-rab 3436 df-v 3481 df-sbc 3788 df-csb 3899 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-pss 3970 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-iun 4992 df-br 5143 df-opab 5205 df-mpt 5225 df-tr 5259 df-id 5577 df-eprel 5583 df-po 5591 df-so 5592 df-fr 5636 df-we 5638 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-pred 6320 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6513 df-fun 6562 df-fn 6563 df-f 6564 df-f1 6565 df-fo 6566 df-f1o 6567 df-fv 6568 df-ov 7435 df-om 7889 df-2nd 8016 df-frecs 8307 df-wrecs 8338 df-recs 8412 df-rdg 8451 df-nn 12268 df-n0 12529 df-bits 16460 | 
| This theorem is referenced by: bitsinv2 16481 bitsf1ocnv 16482 sadaddlem 16504 sadadd 16505 bitsres 16511 bitsshft 16513 smumullem 16530 smumul 16531 eulerpartlemgc 34365 eulerpartlemgvv 34379 eulerpartlemgh 34381 eulerpartlemgs2 34383 | 
| Copyright terms: Public domain | W3C validator |