Theorem decbin2 9741

Description: Decompose base 4 into base 2. (Contributed by Mario Carneiro, 18-Feb-2014.)

Hypothesis

Ref	Expression
decbin.1	|- A e. NN0

Assertion

Ref	Expression
decbin2	|- ( ( 4 x. A ) + 2 ) = ( 2 x. ( ( 2 x. A ) + 1 ) )

Proof of Theorem decbin2

Step	Hyp	Ref	Expression
1		2t1e2 9287	. . 3 |- ( 2 x. 1 ) = 2
2	1	oveq2i 6024	. 2 |- ( ( 2 x. ( 2 x. A ) ) + ( 2 x. 1 ) ) = ( ( 2 x. ( 2 x. A ) ) + 2 )
3		2cn 9204	. . 3 |- 2 e. CC
4		decbin.1	. . . . 5 |- A e. NN0
5	4	nn0cni 9404	. . . 4 |- A e. CC
6	3, 5	mulcli 8174	. . 3 |- ( 2 x. A ) e. CC
7		ax-1cn 8115	. . 3 |- 1 e. CC
8	3, 6, 7	adddii 8179	. 2 |- ( 2 x. ( ( 2 x. A ) + 1 ) ) = ( ( 2 x. ( 2 x. A ) ) + ( 2 x. 1 ) )
9	4	decbin0 9740	. . 3 |- ( 4 x. A ) = ( 2 x. ( 2 x. A ) )
10	9	oveq1i 6023	. 2 |- ( ( 4 x. A ) + 2 ) = ( ( 2 x. ( 2 x. A ) ) + 2 )
11	2, 8, 10	3eqtr4ri 2261	1 |- ( ( 4 x. A ) + 2 ) = ( 2 x. ( ( 2 x. A ) + 1 ) )

Syntax hints:   = wceq 1395   e. wcel 2200  (class class class)co 6013   1c1 8023   + caddc 8025   x. cmul 8027   2c2 9184   4c4 9186   NN0cn0 9392

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211  ax-sep 4205  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-mulcom 8123  ax-addass 8124  ax-mulass 8125  ax-distr 8126  ax-1rid 8129  ax-rnegex 8131  ax-cnre 8133

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2802  df-un 3202  df-in 3204  df-ss 3211  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-iota 5284  df-fv 5332  df-ov 6016  df-inn 9134  df-2 9192  df-3 9193  df-4 9194  df-n0 9393

This theorem is referenced by:  decbin3  9742