| 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 12305 | . . . 4 ⊢ 4 = (3 + 1) | |
| 2 | 1 | oveq2i 7422 | . . 3 ⊢ (5 + 4) = (5 + (3 + 1)) |
| 3 | 5cn 12329 | . . . 4 ⊢ 5 ∈ ℂ | |
| 4 | 3cn 12322 | . . . 4 ⊢ 3 ∈ ℂ | |
| 5 | ax-1cn 11158 | . . . 4 ⊢ 1 ∈ ℂ | |
| 6 | 3, 4, 5 | addassi 11219 | . . 3 ⊢ ((5 + 3) + 1) = (5 + (3 + 1)) |
| 7 | 2, 6 | eqtr4i 2795 | . 2 ⊢ (5 + 4) = ((5 + 3) + 1) |
| 8 | df-9 12310 | . . 3 ⊢ 9 = (8 + 1) | |
| 9 | 5p3e8 12397 | . . . 4 ⊢ (5 + 3) = 8 | |
| 10 | 9 | oveq1i 7421 | . . 3 ⊢ ((5 + 3) + 1) = (8 + 1) |
| 11 | 8, 10 | eqtr4i 2795 | . 2 ⊢ 9 = ((5 + 3) + 1) |
| 12 | 7, 11 | eqtr4i 2795 | 1 ⊢ (5 + 4) = 9 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1567 (class class class)co 7411 1c1 11101 + caddc 11103 3c3 12296 4c4 12297 5c5 12298 8c8 12301 9c9 12302 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-1cn 11158 ax-addcl 11160 ax-addass 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-iota 6493 df-fv 6545 df-ov 7414 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 |
| This theorem is referenced by: 5p5e10 12787 139prm 17184 1259lem3 17193 1259lem4 17194 2503lem2 17198 4001lem1 17201 4001lem2 17202 hgt750lem2 34984 problem1 36090 problem2 36091 resqrtvalex 44297 imsqrtvalex 44298 inductionexd 44807 139prmALT 48271 |
| Copyright terms: Public domain | W3C validator |