![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > bitsfval | Structured version Visualization version GIF version |
Description: Expand the definition of the bits of an integer. (Contributed by Mario Carneiro, 5-Sep-2016.) |
Ref | Expression |
---|---|
bitsfval | ⊢ (𝑁 ∈ ℤ → (bits‘𝑁) = {𝑚 ∈ ℕ0 ∣ ¬ 2 ∥ (⌊‘(𝑁 / (2↑𝑚)))}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvoveq1 7158 | . . . . 5 ⊢ (𝑛 = 𝑁 → (⌊‘(𝑛 / (2↑𝑚))) = (⌊‘(𝑁 / (2↑𝑚)))) | |
2 | 1 | breq2d 5042 | . . . 4 ⊢ (𝑛 = 𝑁 → (2 ∥ (⌊‘(𝑛 / (2↑𝑚))) ↔ 2 ∥ (⌊‘(𝑁 / (2↑𝑚))))) |
3 | 2 | notbid 321 | . . 3 ⊢ (𝑛 = 𝑁 → (¬ 2 ∥ (⌊‘(𝑛 / (2↑𝑚))) ↔ ¬ 2 ∥ (⌊‘(𝑁 / (2↑𝑚))))) |
4 | 3 | rabbidv 3427 | . 2 ⊢ (𝑛 = 𝑁 → {𝑚 ∈ ℕ0 ∣ ¬ 2 ∥ (⌊‘(𝑛 / (2↑𝑚)))} = {𝑚 ∈ ℕ0 ∣ ¬ 2 ∥ (⌊‘(𝑁 / (2↑𝑚)))}) |
5 | df-bits 15761 | . 2 ⊢ bits = (𝑛 ∈ ℤ ↦ {𝑚 ∈ ℕ0 ∣ ¬ 2 ∥ (⌊‘(𝑛 / (2↑𝑚)))}) | |
6 | nn0ex 11891 | . . 3 ⊢ ℕ0 ∈ V | |
7 | 6 | rabex 5199 | . 2 ⊢ {𝑚 ∈ ℕ0 ∣ ¬ 2 ∥ (⌊‘(𝑁 / (2↑𝑚)))} ∈ V |
8 | 4, 5, 7 | fvmpt 6745 | 1 ⊢ (𝑁 ∈ ℤ → (bits‘𝑁) = {𝑚 ∈ ℕ0 ∣ ¬ 2 ∥ (⌊‘(𝑁 / (2↑𝑚)))}) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1538 ∈ wcel 2111 {crab 3110 class class class wbr 5030 ‘cfv 6324 (class class class)co 7135 / cdiv 11286 2c2 11680 ℕ0cn0 11885 ℤcz 11969 ⌊cfl 13155 ↑cexp 13425 ∥ cdvds 15599 bitscbits 15758 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-1cn 10584 ax-addcl 10586 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-ov 7138 df-om 7561 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-nn 11626 df-n0 11886 df-bits 15761 |
This theorem is referenced by: bitsval 15763 |
Copyright terms: Public domain | W3C validator |