| 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 12240 | . . . 4 ⊢ 4 = (3 + 1) | |
| 2 | 1 | oveq2i 7372 | . . 3 ⊢ (5 + 4) = (5 + (3 + 1)) |
| 3 | 5cn 12263 | . . . 4 ⊢ 5 ∈ ℂ | |
| 4 | 3cn 12256 | . . . 4 ⊢ 3 ∈ ℂ | |
| 5 | ax-1cn 11090 | . . . 4 ⊢ 1 ∈ ℂ | |
| 6 | 3, 4, 5 | addassi 11149 | . . 3 ⊢ ((5 + 3) + 1) = (5 + (3 + 1)) |
| 7 | 2, 6 | eqtr4i 2763 | . 2 ⊢ (5 + 4) = ((5 + 3) + 1) |
| 8 | df-9 12245 | . . 3 ⊢ 9 = (8 + 1) | |
| 9 | 5p3e8 12327 | . . . 4 ⊢ (5 + 3) = 8 | |
| 10 | 9 | oveq1i 7371 | . . 3 ⊢ ((5 + 3) + 1) = (8 + 1) |
| 11 | 8, 10 | eqtr4i 2763 | . 2 ⊢ 9 = ((5 + 3) + 1) |
| 12 | 7, 11 | eqtr4i 2763 | 1 ⊢ (5 + 4) = 9 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 (class class class)co 7361 1c1 11033 + caddc 11035 3c3 12231 4c4 12232 5c5 12233 8c8 12236 9c9 12237 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-1cn 11090 ax-addcl 11092 ax-addass 11097 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-iota 6449 df-fv 6501 df-ov 7364 df-2 12238 df-3 12239 df-4 12240 df-5 12241 df-6 12242 df-7 12243 df-8 12244 df-9 12245 |
| This theorem is referenced by: 5p5e10 12709 139prm 17088 1259lem3 17097 1259lem4 17098 2503lem2 17102 4001lem1 17105 4001lem2 17106 hgt750lem2 34815 problem1 35866 problem2 35867 resqrtvalex 44093 imsqrtvalex 44094 inductionexd 44603 139prmALT 48074 |
| Copyright terms: Public domain | W3C validator |