| 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 12251 | . . . 4 ⊢ 4 = (3 + 1) | |
| 2 | 1 | oveq2i 7398 | . . 3 ⊢ (5 + 4) = (5 + (3 + 1)) |
| 3 | 5cn 12274 | . . . 4 ⊢ 5 ∈ ℂ | |
| 4 | 3cn 12267 | . . . 4 ⊢ 3 ∈ ℂ | |
| 5 | ax-1cn 11126 | . . . 4 ⊢ 1 ∈ ℂ | |
| 6 | 3, 4, 5 | addassi 11184 | . . 3 ⊢ ((5 + 3) + 1) = (5 + (3 + 1)) |
| 7 | 2, 6 | eqtr4i 2755 | . 2 ⊢ (5 + 4) = ((5 + 3) + 1) |
| 8 | df-9 12256 | . . 3 ⊢ 9 = (8 + 1) | |
| 9 | 5p3e8 12338 | . . . 4 ⊢ (5 + 3) = 8 | |
| 10 | 9 | oveq1i 7397 | . . 3 ⊢ ((5 + 3) + 1) = (8 + 1) |
| 11 | 8, 10 | eqtr4i 2755 | . 2 ⊢ 9 = ((5 + 3) + 1) |
| 12 | 7, 11 | eqtr4i 2755 | 1 ⊢ (5 + 4) = 9 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1540 (class class class)co 7387 1c1 11069 + caddc 11071 3c3 12242 4c4 12243 5c5 12244 8c8 12247 9c9 12248 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 ax-1cn 11126 ax-addcl 11128 ax-addass 11133 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-iota 6464 df-fv 6519 df-ov 7390 df-2 12249 df-3 12250 df-4 12251 df-5 12252 df-6 12253 df-7 12254 df-8 12255 df-9 12256 |
| This theorem is referenced by: 5p5e10 12720 139prm 17094 1259lem3 17103 1259lem4 17104 2503lem2 17108 4001lem1 17111 4001lem2 17112 hgt750lem2 34643 problem1 35652 problem2 35653 resqrtvalex 43634 imsqrtvalex 43635 inductionexd 44144 139prmALT 47594 |
| Copyright terms: Public domain | W3C validator |