| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 5p4e9 | Structured version Visualization version GIF version | ||
| Description: 5 + 4 = 9. (Contributed by NM, 11-May-2004.) |
| Ref | Expression |
|---|---|
| 5p4e9 | ⊢ (5 + 4) = 9 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-4 12237 | . . . 4 ⊢ 4 = (3 + 1) | |
| 2 | 1 | oveq2i 7367 | . . 3 ⊢ (5 + 4) = (5 + (3 + 1)) |
| 3 | 5cn 12260 | . . . 4 ⊢ 5 ∈ ℂ | |
| 4 | 3cn 12253 | . . . 4 ⊢ 3 ∈ ℂ | |
| 5 | ax-1cn 11087 | . . . 4 ⊢ 1 ∈ ℂ | |
| 6 | 3, 4, 5 | addassi 11146 | . . 3 ⊢ ((5 + 3) + 1) = (5 + (3 + 1)) |
| 7 | 2, 6 | eqtr4i 2765 | . 2 ⊢ (5 + 4) = ((5 + 3) + 1) |
| 8 | df-9 12242 | . . 3 ⊢ 9 = (8 + 1) | |
| 9 | 5p3e8 12324 | . . . 4 ⊢ (5 + 3) = 8 | |
| 10 | 9 | oveq1i 7366 | . . 3 ⊢ ((5 + 3) + 1) = (8 + 1) |
| 11 | 8, 10 | eqtr4i 2765 | . 2 ⊢ 9 = ((5 + 3) + 1) |
| 12 | 7, 11 | eqtr4i 2765 | 1 ⊢ (5 + 4) = 9 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1547 (class class class)co 7356 1c1 11030 + caddc 11032 3c3 12228 4c4 12229 5c5 12230 8c8 12233 9c9 12234 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 ax-1cn 11087 ax-addcl 11089 ax-addass 11094 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-ss 3900 df-nul 4262 df-if 4455 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-iota 6441 df-fv 6493 df-ov 7359 df-2 12235 df-3 12236 df-4 12237 df-5 12238 df-6 12239 df-7 12240 df-8 12241 df-9 12242 |
| This theorem is referenced by: 5p5e10 12706 139prm 17085 1259lem3 17094 1259lem4 17095 2503lem2 17099 4001lem1 17102 4001lem2 17103 hgt750lem2 34836 problem1 35893 problem2 35894 resqrtvalex 44089 imsqrtvalex 44090 inductionexd 44599 139prmALT 48074 |
| Copyright terms: Public domain | W3C validator |