Theorem blenval 49059

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 49058	. 2 ⊢ #b = (𝑛 ∈ V ↦ if(𝑛 = 0, 1, ((⌊‘(2 logb (abs‘𝑛))) + 1)))
2		eqeq1 2741	. . 3 ⊢ (𝑛 = 𝑁 → (𝑛 = 0 ↔ 𝑁 = 0))
3		fveq2 6834	. . . . . 6 ⊢ (𝑛 = 𝑁 → (abs‘𝑛) = (abs‘𝑁))
4	3	oveq2d 7376	. . . . 5 ⊢ (𝑛 = 𝑁 → (2 logb (abs‘𝑛)) = (2 logb (abs‘𝑁)))
5	4	fveq2d 6838	. . . 4 ⊢ (𝑛 = 𝑁 → (⌊‘(2 logb (abs‘𝑛))) = (⌊‘(2 logb (abs‘𝑁))))
6	5	oveq1d 7375	. . 3 ⊢ (𝑛 = 𝑁 → ((⌊‘(2 logb (abs‘𝑛))) + 1) = ((⌊‘(2 logb (abs‘𝑁))) + 1))
7	2, 6	ifbieq2d 4494	. 2 ⊢ (𝑛 = 𝑁 → if(𝑛 = 0, 1, ((⌊‘(2 logb (abs‘𝑛))) + 1)) = if(𝑁 = 0, 1, ((⌊‘(2 logb (abs‘𝑁))) + 1)))
8		elex 3451	. 2 ⊢ (𝑁 ∈ 𝑉 → 𝑁 ∈ V)
9		1ex 11131	. . . 4 ⊢ 1 ∈ V
10		ovex 7393	. . . 4 ⊢ ((⌊‘(2 logb (abs‘𝑁))) + 1) ∈ V
11	9, 10	ifex 4518	. . 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 6965	1 ⊢ (𝑁 ∈ 𝑉 → (#b‘𝑁) = if(𝑁 = 0, 1, ((⌊‘(2 logb (abs‘𝑁))) + 1)))

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  Vcvv 3430  ifcif 4467  ‘cfv 6492  (class class class)co 7360  0cc0 11029  1c1 11030   + caddc 11032  2c2 12227  ⌊cfl 13740  abscabs 15187   log_b clogb 26741  #_bcblen 49057

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pr 5370  ax-1cn 11087

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-iota 6448  df-fun 6494  df-fv 6500  df-ov 7363  df-blen 49058

This theorem is referenced by:  blen0  49060  blenn0  49061