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 11701 | . . . . 5 ⊢ 2 = (1 + 1) | |
2 | 1 | oveq2i 7167 | . . . 4 ⊢ (6 + 2) = (6 + (1 + 1)) |
3 | 6cn 11729 | . . . . 5 ⊢ 6 ∈ ℂ | |
4 | ax-1cn 10595 | . . . . 5 ⊢ 1 ∈ ℂ | |
5 | 3, 4, 4 | addassi 10651 | . . . 4 ⊢ ((6 + 1) + 1) = (6 + (1 + 1)) |
6 | 2, 5 | eqtr4i 2847 | . . 3 ⊢ (6 + 2) = ((6 + 1) + 1) |
7 | df-7 11706 | . . . 4 ⊢ 7 = (6 + 1) | |
8 | 7 | oveq1i 7166 | . . 3 ⊢ (7 + 1) = ((6 + 1) + 1) |
9 | 6, 8 | eqtr4i 2847 | . 2 ⊢ (6 + 2) = (7 + 1) |
10 | df-8 11707 | . 2 ⊢ 8 = (7 + 1) | |
11 | 9, 10 | eqtr4i 2847 | 1 ⊢ (6 + 2) = 8 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 (class class class)co 7156 1c1 10538 + caddc 10540 2c2 11693 6c6 11697 7c7 11698 8c8 11699 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-1cn 10595 ax-addcl 10597 ax-addass 10602 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rab 3147 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-iota 6314 df-fv 6363 df-ov 7159 df-2 11701 df-3 11702 df-4 11703 df-5 11704 df-6 11705 df-7 11706 df-8 11707 |
This theorem is referenced by: 6p3e9 11798 6t3e18 12204 83prm 16456 1259lem2 16465 1259lem5 16468 2503lem2 16471 2503lem3 16472 4001lem1 16474 log2ub 25527 hgt750lem2 31923 3cubeslem3l 39303 lhe4.4ex1a 40681 fmtno5faclem3 43763 |
Copyright terms: Public domain | W3C validator |