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

Theorem decbin0 9895
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 9438 . . 3  |-  ( 2  x.  2 )  =  4
21oveq1i 6085 . 2  |-  ( ( 2  x.  2 )  x.  A )  =  ( 4  x.  A
)
3 2cn 9354 . . 3  |-  2  e.  CC
4 decbin.1 . . . 4  |-  A  e. 
NN0
54nn0cni 9554 . . 3  |-  A  e.  CC
63, 3, 5mulassi 8325 . 2  |-  ( ( 2  x.  2 )  x.  A )  =  ( 2  x.  (
2  x.  A ) )
72, 6eqtr3i 2261 1  |-  ( 4  x.  A )  =  ( 2  x.  (
2  x.  A ) )
Colors of variables: wff set class
Syntax hints:    = wceq 1402    e. wcel 2209  (class class class)co 6075    x. cmul 8174   2c2 9334   4c4 9336   NN0cn0 9542
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220  ax-sep 4244  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-1rid 8276  ax-rnegex 8278  ax-cnre 8280
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-iota 5332  df-fv 5380  df-ov 6078  df-inn 9284  df-2 9342  df-3 9343  df-4 9344  df-n0 9543
This theorem is referenced by:  decbin2  9896
  Copyright terms: Public domain W3C validator