Theorem blenval 49202

Description: The binary length of an integer. (Contributed by AV, 20-May-2020.)

Assertion

Ref	Expression
blenval	⊢ (𝑁 ∈ 𝑉 → (#b‘𝑁) = if(𝑁 = 0, 1, ((⌊‘(2 logb (abs‘𝑁))) + 1)))

Proof of Theorem blenval

Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-blen 49201	. 2 ⊢ #b = (𝑛 ∈ V ↦ if(𝑛 = 0, 1, ((⌊‘(2 logb (abs‘𝑛))) + 1)))
2		eqeq1 2769	. . 3 ⊢ (𝑛 = 𝑁 → (𝑛 = 0 ↔ 𝑁 = 0))
3		fveq2 6871	. . . . . 6 ⊢ (𝑛 = 𝑁 → (abs‘𝑛) = (abs‘𝑁))
4	3	oveq2d 7416	. . . . 5 ⊢ (𝑛 = 𝑁 → (2 logb (abs‘𝑛)) = (2 logb (abs‘𝑁)))
5	4	fveq2d 6875	. . . 4 ⊢ (𝑛 = 𝑁 → (⌊‘(2 logb (abs‘𝑛))) = (⌊‘(2 logb (abs‘𝑁))))
6	5	oveq1d 7415	. . 3 ⊢ (𝑛 = 𝑁 → ((⌊‘(2 logb (abs‘𝑛))) + 1) = ((⌊‘(2 logb (abs‘𝑁))) + 1))
7	2, 6	ifbieq2d 4510	. 2 ⊢ (𝑛 = 𝑁 → if(𝑛 = 0, 1, ((⌊‘(2 logb (abs‘𝑛))) + 1)) = if(𝑁 = 0, 1, ((⌊‘(2 logb (abs‘𝑁))) + 1)))
8		elex 3478	. 2 ⊢ (𝑁 ∈ 𝑉 → 𝑁 ∈ V)
9		1ex 11191	. . . 4 ⊢ 1 ∈ V
10		ovex 7433	. . . 4 ⊢ ((⌊‘(2 logb (abs‘𝑁))) + 1) ∈ V
11	9, 10	ifex 4534	. . 3 ⊢ if(𝑁 = 0, 1, ((⌊‘(2 logb (abs‘𝑁))) + 1)) ∈ V
12	11	a1i 11	. 2 ⊢ (𝑁 ∈ 𝑉 → if(𝑁 = 0, 1, ((⌊‘(2 logb (abs‘𝑁))) + 1)) ∈ V)
13	1, 7, 8, 12	fvmptd3 7003	1 ⊢ (𝑁 ∈ 𝑉 → (#b‘𝑁) = if(𝑁 = 0, 1, ((⌊‘(2 logb (abs‘𝑁))) + 1)))

Syntax hints:   → wi 4   = wceq 1563   ∈ wcel 2145  Vcvv 3457  ifcif 4483  ‘cfv 6525  (class class class)co 7400  0cc0 11088  1c1 11089   + caddc 11091  2c2 12286  ⌊cfl 13814  abscabs 15275   log_b clogb 26887  #_bcblen 49200

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pr 5395  ax-1cn 11146

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-iota 6481  df-fun 6527  df-fv 6533  df-ov 7403  df-blen 49201

This theorem is referenced by:  blen0  49203  blenn0  49204