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 11907 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
2 | 2re 11712 | . . . 4 ⊢ 2 ∈ ℝ | |
3 | 2 | a1i 11 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℝ) |
4 | 1lt2 11809 | . . . 4 ⊢ 1 < 2 | |
5 | 4 | a1i 11 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 1 < 2) |
6 | expnbnd 13594 | . . 3 ⊢ ((𝑁 ∈ ℝ ∧ 2 ∈ ℝ ∧ 1 < 2) → ∃𝑚 ∈ ℕ 𝑁 < (2↑𝑚)) | |
7 | 1, 3, 5, 6 | syl3anc 1367 | . 2 ⊢ (𝑁 ∈ ℕ0 → ∃𝑚 ∈ ℕ 𝑁 < (2↑𝑚)) |
8 | fzofi 13343 | . . 3 ⊢ (0..^𝑚) ∈ Fin | |
9 | simpl 485 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → 𝑁 ∈ ℕ0) | |
10 | nn0uz 12281 | . . . . . 6 ⊢ ℕ0 = (ℤ≥‘0) | |
11 | 9, 10 | eleqtrdi 2923 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → 𝑁 ∈ (ℤ≥‘0)) |
12 | 2nn 11711 | . . . . . . . 8 ⊢ 2 ∈ ℕ | |
13 | 12 | a1i 11 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → 2 ∈ ℕ) |
14 | simprl 769 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → 𝑚 ∈ ℕ) | |
15 | 14 | nnnn0d 11956 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → 𝑚 ∈ ℕ0) |
16 | 13, 15 | nnexpcld 13607 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → (2↑𝑚) ∈ ℕ) |
17 | 16 | nnzd 12087 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → (2↑𝑚) ∈ ℤ) |
18 | simprr 771 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → 𝑁 < (2↑𝑚)) | |
19 | elfzo2 13042 | . . . . 5 ⊢ (𝑁 ∈ (0..^(2↑𝑚)) ↔ (𝑁 ∈ (ℤ≥‘0) ∧ (2↑𝑚) ∈ ℤ ∧ 𝑁 < (2↑𝑚))) | |
20 | 11, 17, 18, 19 | syl3anbrc 1339 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → 𝑁 ∈ (0..^(2↑𝑚))) |
21 | 9 | nn0zd 12086 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → 𝑁 ∈ ℤ) |
22 | bitsfzo 15784 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝑚 ∈ ℕ0) → (𝑁 ∈ (0..^(2↑𝑚)) ↔ (bits‘𝑁) ⊆ (0..^𝑚))) | |
23 | 21, 15, 22 | syl2anc 586 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → (𝑁 ∈ (0..^(2↑𝑚)) ↔ (bits‘𝑁) ⊆ (0..^𝑚))) |
24 | 20, 23 | mpbid 234 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → (bits‘𝑁) ⊆ (0..^𝑚)) |
25 | ssfi 8738 | . . 3 ⊢ (((0..^𝑚) ∈ Fin ∧ (bits‘𝑁) ⊆ (0..^𝑚)) → (bits‘𝑁) ∈ Fin) | |
26 | 8, 24, 25 | sylancr 589 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑚 ∈ ℕ ∧ 𝑁 < (2↑𝑚))) → (bits‘𝑁) ∈ Fin) |
27 | 7, 26 | rexlimddv 3291 | 1 ⊢ (𝑁 ∈ ℕ0 → (bits‘𝑁) ∈ Fin) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∈ wcel 2114 ∃wrex 3139 ⊆ wss 3936 class class class wbr 5066 ‘cfv 6355 (class class class)co 7156 Fincfn 8509 ℝcr 10536 0cc0 10537 1c1 10538 < clt 10675 ℕcn 11638 2c2 11693 ℕ0cn0 11898 ℤcz 11982 ℤ≥cuz 12244 ..^cfzo 13034 ↑cexp 13430 bitscbits 15768 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 ax-pre-sup 10615 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-1o 8102 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-fin 8513 df-sup 8906 df-inf 8907 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-div 11298 df-nn 11639 df-2 11701 df-n0 11899 df-z 11983 df-uz 12245 df-rp 12391 df-fz 12894 df-fzo 13035 df-fl 13163 df-seq 13371 df-exp 13431 df-dvds 15608 df-bits 15771 |
This theorem is referenced by: bitsinv2 15792 bitsf1ocnv 15793 bitsf1 15795 eulerpartlemgc 31620 eulerpartlemgs2 31638 |
Copyright terms: Public domain | W3C validator |