ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  decbin0 Unicode version

Theorem decbin0 9794
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
decbin0  |-  ( 4  x.  A )  =  ( 2  x.  (
2  x.  A ) )

Proof of Theorem decbin0
StepHypRef Expression
1 2t2e4 9340 . . 3  |-  ( 2  x.  2 )  =  4
21oveq1i 6038 . 2  |-  ( ( 2  x.  2 )  x.  A )  =  ( 4  x.  A
)
3 2cn 9256 . . 3  |-  2  e.  CC
4 decbin.1 . . . 4  |-  A  e. 
NN0
54nn0cni 9456 . . 3  |-  A  e.  CC
63, 3, 5mulassi 8231 . 2  |-  ( ( 2  x.  2 )  x.  A )  =  ( 2  x.  (
2  x.  A ) )
72, 6eqtr3i 2254 1  |-  ( 4  x.  A )  =  ( 2  x.  (
2  x.  A ) )
Colors of variables: wff set class
Syntax hints:    = wceq 1398    e. wcel 2202  (class class class)co 6028    x. cmul 8080   2c2 9236   4c4 9238   NN0cn0 9444
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213  ax-sep 4212  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-mulcom 8176  ax-addass 8177  ax-mulass 8178  ax-distr 8179  ax-1rid 8182  ax-rnegex 8184  ax-cnre 8186
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-iota 5293  df-fv 5341  df-ov 6031  df-inn 9186  df-2 9244  df-3 9245  df-4 9246  df-n0 9445
This theorem is referenced by:  decbin2  9795
  Copyright terms: Public domain W3C validator