| 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 12208 | . . . 4 ⊢ 4 = (3 + 1) | |
| 2 | 1 | oveq2i 7367 | . . 3 ⊢ (5 + 4) = (5 + (3 + 1)) |
| 3 | 5cn 12231 | . . . 4 ⊢ 5 ∈ ℂ | |
| 4 | 3cn 12224 | . . . 4 ⊢ 3 ∈ ℂ | |
| 5 | ax-1cn 11082 | . . . 4 ⊢ 1 ∈ ℂ | |
| 6 | 3, 4, 5 | addassi 11140 | . . 3 ⊢ ((5 + 3) + 1) = (5 + (3 + 1)) |
| 7 | 2, 6 | eqtr4i 2760 | . 2 ⊢ (5 + 4) = ((5 + 3) + 1) |
| 8 | df-9 12213 | . . 3 ⊢ 9 = (8 + 1) | |
| 9 | 5p3e8 12295 | . . . 4 ⊢ (5 + 3) = 8 | |
| 10 | 9 | oveq1i 7366 | . . 3 ⊢ ((5 + 3) + 1) = (8 + 1) |
| 11 | 8, 10 | eqtr4i 2760 | . 2 ⊢ 9 = ((5 + 3) + 1) |
| 12 | 7, 11 | eqtr4i 2760 | 1 ⊢ (5 + 4) = 9 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 (class class class)co 7356 1c1 11025 + caddc 11027 3c3 12199 4c4 12200 5c5 12201 8c8 12204 9c9 12205 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2706 ax-1cn 11082 ax-addcl 11084 ax-addass 11089 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4284 df-if 4478 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-iota 6446 df-fv 6498 df-ov 7359 df-2 12206 df-3 12207 df-4 12208 df-5 12209 df-6 12210 df-7 12211 df-8 12212 df-9 12213 |
| This theorem is referenced by: 5p5e10 12676 139prm 17049 1259lem3 17058 1259lem4 17059 2503lem2 17063 4001lem1 17066 4001lem2 17067 hgt750lem2 34758 problem1 35808 problem2 35809 resqrtvalex 43828 imsqrtvalex 43829 inductionexd 44338 139prmALT 47784 |
| Copyright terms: Public domain | W3C validator |