Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 5p3e8 | Structured version Visualization version GIF version |
Description: 5 + 3 = 8. (Contributed by NM, 11-May-2004.) |
Ref | Expression |
---|---|
5p3e8 | ⊢ (5 + 3) = 8 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-3 11689 | . . . 4 ⊢ 3 = (2 + 1) | |
2 | 1 | oveq2i 7146 | . . 3 ⊢ (5 + 3) = (5 + (2 + 1)) |
3 | 5cn 11713 | . . . 4 ⊢ 5 ∈ ℂ | |
4 | 2cn 11700 | . . . 4 ⊢ 2 ∈ ℂ | |
5 | ax-1cn 10584 | . . . 4 ⊢ 1 ∈ ℂ | |
6 | 3, 4, 5 | addassi 10640 | . . 3 ⊢ ((5 + 2) + 1) = (5 + (2 + 1)) |
7 | 2, 6 | eqtr4i 2824 | . 2 ⊢ (5 + 3) = ((5 + 2) + 1) |
8 | df-8 11694 | . . 3 ⊢ 8 = (7 + 1) | |
9 | 5p2e7 11781 | . . . 4 ⊢ (5 + 2) = 7 | |
10 | 9 | oveq1i 7145 | . . 3 ⊢ ((5 + 2) + 1) = (7 + 1) |
11 | 8, 10 | eqtr4i 2824 | . 2 ⊢ 8 = ((5 + 2) + 1) |
12 | 7, 11 | eqtr4i 2824 | 1 ⊢ (5 + 3) = 8 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1538 (class class class)co 7135 1c1 10527 + caddc 10529 2c2 11680 3c3 11681 5c5 11683 7c7 11685 8c8 11686 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 ax-1cn 10584 ax-addcl 10586 ax-addass 10591 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-v 3443 df-un 3886 df-in 3888 df-ss 3898 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-iota 6283 df-fv 6332 df-ov 7138 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 |
This theorem is referenced by: 5p4e9 11783 ef01bndlem 15529 2exp16 16416 1259lem2 16457 log2ublem3 25534 log2ub 25535 bposlem8 25875 lgsdir2lem1 25909 fib6 31774 235t711 39485 ex-decpmul 39486 fmtno5lem2 44071 fmtno5lem4 44073 257prm 44078 gbpart8 44286 8gbe 44291 evengpop3 44316 ackval3012 45106 |
Copyright terms: Public domain | W3C validator |