| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > decbin0 | GIF version | ||
| Description: Decompose base 4 into base 2. (Contributed by Mario Carneiro, 18-Feb-2014.) |
| Ref | Expression |
|---|---|
| decbin.1 | ⊢ 𝐴 ∈ ℕ0 |
| Ref | Expression |
|---|---|
| decbin0 | ⊢ (4 · 𝐴) = (2 · (2 · 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2t2e4 9303 | . . 3 ⊢ (2 · 2) = 4 | |
| 2 | 1 | oveq1i 6033 | . 2 ⊢ ((2 · 2) · 𝐴) = (4 · 𝐴) |
| 3 | 2cn 9219 | . . 3 ⊢ 2 ∈ ℂ | |
| 4 | decbin.1 | . . . 4 ⊢ 𝐴 ∈ ℕ0 | |
| 5 | 4 | nn0cni 9419 | . . 3 ⊢ 𝐴 ∈ ℂ |
| 6 | 3, 3, 5 | mulassi 8193 | . 2 ⊢ ((2 · 2) · 𝐴) = (2 · (2 · 𝐴)) |
| 7 | 2, 6 | eqtr3i 2253 | 1 ⊢ (4 · 𝐴) = (2 · (2 · 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1397 ∈ wcel 2201 (class class class)co 6023 · cmul 8042 2c2 9199 4c4 9201 ℕ0cn0 9407 |
| 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 2212 ax-sep 4208 ax-cnex 8128 ax-resscn 8129 ax-1cn 8130 ax-1re 8131 ax-icn 8132 ax-addcl 8133 ax-addrcl 8134 ax-mulcl 8135 ax-mulcom 8138 ax-addass 8139 ax-mulass 8140 ax-distr 8141 ax-1rid 8144 ax-rnegex 8146 ax-cnre 8148 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1810 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ral 2514 df-rex 2515 df-v 2803 df-un 3203 df-in 3205 df-ss 3212 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-int 3930 df-br 4090 df-iota 5288 df-fv 5336 df-ov 6026 df-inn 9149 df-2 9207 df-3 9208 df-4 9209 df-n0 9408 |
| This theorem is referenced by: decbin2 9756 |
| Copyright terms: Public domain | W3C validator |