Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > bitsfi | Structured version Visualization version GIF version |
Description: Every number is associated with a finite set of bits. (Contributed by Mario Carneiro, 5-Sep-2016.) |
Ref | Expression |
---|---|
bitsfi | ⊢ (𝑁 ∈ ℕ0 → (bits‘𝑁) ∈ Fin) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nn0re 11985 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
2 | 2re 11790 | . . . 4 ⊢ 2 ∈ ℝ | |
3 | 2 | a1i 11 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℝ) |
4 | 1lt2 11887 | . . . 4 ⊢ 1 < 2 | |
5 | 4 | a1i 11 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 1 < 2) |
6 | expnbnd 13685 | . . 3 ⊢ ((𝑁 ∈ ℝ ∧ 2 ∈ ℝ ∧ 1 < 2) → ∃𝑚 ∈ ℕ 𝑁 < (2↑𝑚)) | |
7 | 1, 3, 5, 6 | syl3anc 1372 | . 2 ⊢ (𝑁 ∈ ℕ0 → ∃𝑚 ∈ ℕ 𝑁 < (2↑𝑚)) |
8 | fzofi 13433 | . . 3 ⊢ (0..^𝑚) ∈ Fin | |
9 | simpl 486 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → 𝑁 ∈ ℕ0) | |
10 | nn0uz 12362 | . . . . . 6 ⊢ ℕ0 = (ℤ≥‘0) | |
11 | 9, 10 | eleqtrdi 2843 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → 𝑁 ∈ (ℤ≥‘0)) |
12 | 2nn 11789 | . . . . . . . 8 ⊢ 2 ∈ ℕ | |
13 | 12 | a1i 11 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → 2 ∈ ℕ) |
14 | simprl 771 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → 𝑚 ∈ ℕ) | |
15 | 14 | nnnn0d 12036 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → 𝑚 ∈ ℕ0) |
16 | 13, 15 | nnexpcld 13698 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → (2↑𝑚) ∈ ℕ) |
17 | 16 | nnzd 12167 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → (2↑𝑚) ∈ ℤ) |
18 | simprr 773 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → 𝑁 < (2↑𝑚)) | |
19 | elfzo2 13132 | . . . . 5 ⊢ (𝑁 ∈ (0..^(2↑𝑚)) ↔ (𝑁 ∈ (ℤ≥‘0) ∧ (2↑𝑚) ∈ ℤ ∧ 𝑁 < (2↑𝑚))) | |
20 | 11, 17, 18, 19 | syl3anbrc 1344 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → 𝑁 ∈ (0..^(2↑𝑚))) |
21 | 9 | nn0zd 12166 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → 𝑁 ∈ ℤ) |
22 | bitsfzo 15878 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝑚 ∈ ℕ0) → (𝑁 ∈ (0..^(2↑𝑚)) ↔ (bits‘𝑁) ⊆ (0..^𝑚))) | |
23 | 21, 15, 22 | syl2anc 587 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → (𝑁 ∈ (0..^(2↑𝑚)) ↔ (bits‘𝑁) ⊆ (0..^𝑚))) |
24 | 20, 23 | mpbid 235 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → (bits‘𝑁) ⊆ (0..^𝑚)) |
25 | ssfi 8772 | . . 3 ⊢ (((0..^𝑚) ∈ Fin ∧ (bits‘𝑁) ⊆ (0..^𝑚)) → (bits‘𝑁) ∈ Fin) | |
26 | 8, 24, 25 | sylancr 590 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → (bits‘𝑁) ∈ Fin) |
27 | 7, 26 | rexlimddv 3201 | 1 ⊢ (𝑁 ∈ ℕ0 → (bits‘𝑁) ∈ Fin) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∈ wcel 2114 ∃wrex 3054 ⊆ wss 3843 class class class wbr 5030 ‘cfv 6339 (class class class)co 7170 Fincfn 8555 ℝcr 10614 0cc0 10615 1c1 10616 < clt 10753 ℕcn 11716 2c2 11771 ℕ0cn0 11976 ℤcz 12062 ℤ≥cuz 12324 ..^cfzo 13124 ↑cexp 13521 bitscbits 15862 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2710 ax-sep 5167 ax-nul 5174 ax-pow 5232 ax-pr 5296 ax-un 7479 ax-cnex 10671 ax-resscn 10672 ax-1cn 10673 ax-icn 10674 ax-addcl 10675 ax-addrcl 10676 ax-mulcl 10677 ax-mulrcl 10678 ax-mulcom 10679 ax-addass 10680 ax-mulass 10681 ax-distr 10682 ax-i2m1 10683 ax-1ne0 10684 ax-1rid 10685 ax-rnegex 10686 ax-rrecex 10687 ax-cnre 10688 ax-pre-lttri 10689 ax-pre-lttrn 10690 ax-pre-ltadd 10691 ax-pre-mulgt0 10692 ax-pre-sup 10693 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2540 df-eu 2570 df-clab 2717 df-cleq 2730 df-clel 2811 df-nfc 2881 df-ne 2935 df-nel 3039 df-ral 3058 df-rex 3059 df-reu 3060 df-rmo 3061 df-rab 3062 df-v 3400 df-sbc 3681 df-csb 3791 df-dif 3846 df-un 3848 df-in 3850 df-ss 3860 df-pss 3862 df-nul 4212 df-if 4415 df-pw 4490 df-sn 4517 df-pr 4519 df-tp 4521 df-op 4523 df-uni 4797 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5429 df-eprel 5434 df-po 5442 df-so 5443 df-fr 5483 df-we 5485 df-xp 5531 df-rel 5532 df-cnv 5533 df-co 5534 df-dm 5535 df-rn 5536 df-res 5537 df-ima 5538 df-pred 6129 df-ord 6175 df-on 6176 df-lim 6177 df-suc 6178 df-iota 6297 df-fun 6341 df-fn 6342 df-f 6343 df-f1 6344 df-fo 6345 df-f1o 6346 df-fv 6347 df-riota 7127 df-ov 7173 df-oprab 7174 df-mpo 7175 df-om 7600 df-1st 7714 df-2nd 7715 df-wrecs 7976 df-recs 8037 df-rdg 8075 df-1o 8131 df-er 8320 df-en 8556 df-dom 8557 df-sdom 8558 df-fin 8559 df-sup 8979 df-inf 8980 df-pnf 10755 df-mnf 10756 df-xr 10757 df-ltxr 10758 df-le 10759 df-sub 10950 df-neg 10951 df-div 11376 df-nn 11717 df-2 11779 df-n0 11977 df-z 12063 df-uz 12325 df-rp 12473 df-fz 12982 df-fzo 13125 df-fl 13253 df-seq 13461 df-exp 13522 df-dvds 15700 df-bits 15865 |
This theorem is referenced by: bitsinv2 15886 bitsf1ocnv 15887 bitsf1 15889 eulerpartlemgc 31899 eulerpartlemgs2 31917 |
Copyright terms: Public domain | W3C validator |