| 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 12283 | . . . 4 ⊢ 4 = (3 + 1) | |
| 2 | 1 | oveq2i 7408 | . . 3 ⊢ (5 + 4) = (5 + (3 + 1)) |
| 3 | 5cn 12307 | . . . 4 ⊢ 5 ∈ ℂ | |
| 4 | 3cn 12300 | . . . 4 ⊢ 3 ∈ ℂ | |
| 5 | ax-1cn 11132 | . . . 4 ⊢ 1 ∈ ℂ | |
| 6 | 3, 4, 5 | addassi 11193 | . . 3 ⊢ ((5 + 3) + 1) = (5 + (3 + 1)) |
| 7 | 2, 6 | eqtr4i 2789 | . 2 ⊢ (5 + 4) = ((5 + 3) + 1) |
| 8 | df-9 12288 | . . 3 ⊢ 9 = (8 + 1) | |
| 9 | 5p3e8 12375 | . . . 4 ⊢ (5 + 3) = 8 | |
| 10 | 9 | oveq1i 7407 | . . 3 ⊢ ((5 + 3) + 1) = (8 + 1) |
| 11 | 8, 10 | eqtr4i 2789 | . 2 ⊢ 9 = ((5 + 3) + 1) |
| 12 | 7, 11 | eqtr4i 2789 | 1 ⊢ (5 + 4) = 9 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1561 (class class class)co 7397 1c1 11075 + caddc 11077 3c3 12274 4c4 12275 5c5 12276 8c8 12279 9c9 12280 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-ext 2735 ax-1cn 11132 ax-addcl 11134 ax-addass 11139 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-sb 2092 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3416 df-v 3457 df-dif 3908 df-un 3910 df-ss 3922 df-nul 4287 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5102 df-iota 6478 df-fv 6530 df-ov 7400 df-2 12281 df-3 12282 df-4 12283 df-5 12284 df-6 12285 df-7 12286 df-8 12287 df-9 12288 |
| This theorem is referenced by: 5p5e10 12765 139prm 17161 1259lem3 17170 1259lem4 17171 2503lem2 17175 4001lem1 17178 4001lem2 17179 hgt750lem2 34947 problem1 36016 problem2 36017 resqrtvalex 44222 imsqrtvalex 44223 inductionexd 44732 139prmALT 48206 |
| Copyright terms: Public domain | W3C validator |