Theorem decbin2 9750

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 9296	. . 3 |- ( 2 x. 1 ) = 2
2	1	oveq2i 6028	. 2 |- ( ( 2 x. ( 2 x. A ) ) + ( 2 x. 1 ) ) = ( ( 2 x. ( 2 x. A ) ) + 2 )
3		2cn 9213	. . 3 |- 2 e. CC
4		decbin.1	. . . . 5 |- A e. NN0
5	4	nn0cni 9413	. . . 4 |- A e. CC
6	3, 5	mulcli 8183	. . 3 |- ( 2 x. A ) e. CC
7		ax-1cn 8124	. . 3 |- 1 e. CC
8	3, 6, 7	adddii 8188	. 2 |- ( 2 x. ( ( 2 x. A ) + 1 ) ) = ( ( 2 x. ( 2 x. A ) ) + ( 2 x. 1 ) )
9	4	decbin0 9749	. . 3 |- ( 4 x. A ) = ( 2 x. ( 2 x. A ) )
10	9	oveq1i 6027	. 2 |- ( ( 4 x. A ) + 2 ) = ( ( 2 x. ( 2 x. A ) ) + 2 )
11	2, 8, 10	3eqtr4ri 2263	1 |- ( ( 4 x. A ) + 2 ) = ( 2 x. ( ( 2 x. A ) + 1 ) )

Syntax hints:   = wceq 1397   e. wcel 2202  (class class class)co 6017   1c1 8032   + caddc 8034   x. cmul 8036   2c2 9193   4c4 9195   NN0cn0 9401

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213  ax-sep 4207  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-1rid 8138  ax-rnegex 8140  ax-cnre 8142

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-iota 5286  df-fv 5334  df-ov 6020  df-inn 9143  df-2 9201  df-3 9202  df-4 9203  df-n0 9402

This theorem is referenced by:  decbin3  9751