Theorem decbin2 9626

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 9172	. . 3 |- ( 2 x. 1 ) = 2
2	1	oveq2i 5945	. 2 |- ( ( 2 x. ( 2 x. A ) ) + ( 2 x. 1 ) ) = ( ( 2 x. ( 2 x. A ) ) + 2 )
3		2cn 9089	. . 3 |- 2 e. CC
4		decbin.1	. . . . 5 |- A e. NN0
5	4	nn0cni 9289	. . . 4 |- A e. CC
6	3, 5	mulcli 8059	. . 3 |- ( 2 x. A ) e. CC
7		ax-1cn 8000	. . 3 |- 1 e. CC
8	3, 6, 7	adddii 8064	. 2 |- ( 2 x. ( ( 2 x. A ) + 1 ) ) = ( ( 2 x. ( 2 x. A ) ) + ( 2 x. 1 ) )
9	4	decbin0 9625	. . 3 |- ( 4 x. A ) = ( 2 x. ( 2 x. A ) )
10	9	oveq1i 5944	. 2 |- ( ( 4 x. A ) + 2 ) = ( ( 2 x. ( 2 x. A ) ) + 2 )
11	2, 8, 10	3eqtr4ri 2236	1 |- ( ( 4 x. A ) + 2 ) = ( 2 x. ( ( 2 x. A ) + 1 ) )

Syntax hints:   = wceq 1372   e. wcel 2175  (class class class)co 5934   1c1 7908   + caddc 7910   x. cmul 7912   2c2 9069   4c4 9071   NN0cn0 9277

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 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-ext 2186  ax-sep 4161  ax-cnex 7998  ax-resscn 7999  ax-1cn 8000  ax-1re 8001  ax-icn 8002  ax-addcl 8003  ax-addrcl 8004  ax-mulcl 8005  ax-mulcom 8008  ax-addass 8009  ax-mulass 8010  ax-distr 8011  ax-1rid 8014  ax-rnegex 8016  ax-cnre 8018

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-v 2773  df-un 3169  df-in 3171  df-ss 3178  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-int 3885  df-br 4044  df-iota 5229  df-fv 5276  df-ov 5937  df-inn 9019  df-2 9077  df-3 9078  df-4 9079  df-n0 9278

This theorem is referenced by:  decbin3  9627