| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 6p2e8 | Structured version Visualization version GIF version | ||
| Description: 6 + 2 = 8. (Contributed by NM, 11-May-2004.) |
| Ref | Expression |
|---|---|
| 6p2e8 | ⊢ (6 + 2) = 8 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-2 12206 | . . . . 5 ⊢ 2 = (1 + 1) | |
| 2 | 1 | oveq2i 7367 | . . . 4 ⊢ (6 + 2) = (6 + (1 + 1)) |
| 3 | 6cn 12234 | . . . . 5 ⊢ 6 ∈ ℂ | |
| 4 | ax-1cn 11082 | . . . . 5 ⊢ 1 ∈ ℂ | |
| 5 | 3, 4, 4 | addassi 11140 | . . . 4 ⊢ ((6 + 1) + 1) = (6 + (1 + 1)) |
| 6 | 2, 5 | eqtr4i 2760 | . . 3 ⊢ (6 + 2) = ((6 + 1) + 1) |
| 7 | df-7 12211 | . . . 4 ⊢ 7 = (6 + 1) | |
| 8 | 7 | oveq1i 7366 | . . 3 ⊢ (7 + 1) = ((6 + 1) + 1) |
| 9 | 6, 8 | eqtr4i 2760 | . 2 ⊢ (6 + 2) = (7 + 1) |
| 10 | df-8 12212 | . 2 ⊢ 8 = (7 + 1) | |
| 11 | 9, 10 | eqtr4i 2760 | 1 ⊢ (6 + 2) = 8 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 (class class class)co 7356 1c1 11025 + caddc 11027 2c2 12198 6c6 12202 7c7 12203 8c8 12204 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2706 ax-1cn 11082 ax-addcl 11084 ax-addass 11089 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4284 df-if 4478 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-iota 6446 df-fv 6498 df-ov 7359 df-2 12206 df-3 12207 df-4 12208 df-5 12209 df-6 12210 df-7 12211 df-8 12212 |
| This theorem is referenced by: 6p3e9 12298 6t3e18 12710 83prm 17048 1259lem2 17057 1259lem5 17060 2503lem2 17063 2503lem3 17064 4001lem1 17066 log2ub 26913 hgt750lem2 34758 3exp7 42246 3cubeslem3l 42870 resqrtvalex 43828 imsqrtvalex 43829 lhe4.4ex1a 44512 fmtno5faclem3 47769 |
| Copyright terms: Public domain | W3C validator |