Theorem blenval 48307

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 48306	. 2 ⊢ #b = (𝑛 ∈ V ↦ if(𝑛 = 0, 1, ((⌊‘(2 logb (abs‘𝑛))) + 1)))
2		eqeq1 2744	. . 3 ⊢ (𝑛 = 𝑁 → (𝑛 = 0 ↔ 𝑁 = 0))
3		fveq2 6922	. . . . . 6 ⊢ (𝑛 = 𝑁 → (abs‘𝑛) = (abs‘𝑁))
4	3	oveq2d 7466	. . . . 5 ⊢ (𝑛 = 𝑁 → (2 logb (abs‘𝑛)) = (2 logb (abs‘𝑁)))
5	4	fveq2d 6926	. . . 4 ⊢ (𝑛 = 𝑁 → (⌊‘(2 logb (abs‘𝑛))) = (⌊‘(2 logb (abs‘𝑁))))
6	5	oveq1d 7465	. . 3 ⊢ (𝑛 = 𝑁 → ((⌊‘(2 logb (abs‘𝑛))) + 1) = ((⌊‘(2 logb (abs‘𝑁))) + 1))
7	2, 6	ifbieq2d 4574	. 2 ⊢ (𝑛 = 𝑁 → if(𝑛 = 0, 1, ((⌊‘(2 logb (abs‘𝑛))) + 1)) = if(𝑁 = 0, 1, ((⌊‘(2 logb (abs‘𝑁))) + 1)))
8		elex 3509	. 2 ⊢ (𝑁 ∈ 𝑉 → 𝑁 ∈ V)
9		1ex 11288	. . . 4 ⊢ 1 ∈ V
10		ovex 7483	. . . 4 ⊢ ((⌊‘(2 logb (abs‘𝑁))) + 1) ∈ V
11	9, 10	ifex 4598	. . 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 7054	1 ⊢ (𝑁 ∈ 𝑉 → (#b‘𝑁) = if(𝑁 = 0, 1, ((⌊‘(2 logb (abs‘𝑁))) + 1)))

Syntax hints:   → wi 4   = wceq 1537   ∈ wcel 2108  Vcvv 3488  ifcif 4548  ‘cfv 6575  (class class class)co 7450  0cc0 11186  1c1 11187   + caddc 11189  2c2 12350  ⌊cfl 13843  abscabs 15285   log_b clogb 26827  #_bcblen 48305

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-1cn 11244

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-iota 6527  df-fun 6577  df-fv 6583  df-ov 7453  df-blen 48306

This theorem is referenced by:  blen0  48308  blenn0  48309