![]() |
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 11690 | . . . 4 ⊢ 4 = (3 + 1) | |
2 | 1 | oveq2i 7146 | . . 3 ⊢ (5 + 4) = (5 + (3 + 1)) |
3 | 5cn 11713 | . . . 4 ⊢ 5 ∈ ℂ | |
4 | 3cn 11706 | . . . 4 ⊢ 3 ∈ ℂ | |
5 | ax-1cn 10584 | . . . 4 ⊢ 1 ∈ ℂ | |
6 | 3, 4, 5 | addassi 10640 | . . 3 ⊢ ((5 + 3) + 1) = (5 + (3 + 1)) |
7 | 2, 6 | eqtr4i 2824 | . 2 ⊢ (5 + 4) = ((5 + 3) + 1) |
8 | df-9 11695 | . . 3 ⊢ 9 = (8 + 1) | |
9 | 5p3e8 11782 | . . . 4 ⊢ (5 + 3) = 8 | |
10 | 9 | oveq1i 7145 | . . 3 ⊢ ((5 + 3) + 1) = (8 + 1) |
11 | 8, 10 | eqtr4i 2824 | . 2 ⊢ 9 = ((5 + 3) + 1) |
12 | 7, 11 | eqtr4i 2824 | 1 ⊢ (5 + 4) = 9 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1538 (class class class)co 7135 1c1 10527 + caddc 10529 3c3 11681 4c4 11682 5c5 11683 8c8 11686 9c9 11687 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 ax-1cn 10584 ax-addcl 10586 ax-addass 10591 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-v 3443 df-un 3886 df-in 3888 df-ss 3898 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-iota 6283 df-fv 6332 df-ov 7138 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 |
This theorem is referenced by: 5p5e10 12157 139prm 16449 1259lem3 16458 1259lem4 16459 2503lem2 16463 4001lem1 16466 4001lem2 16467 hgt750lem2 32033 problem1 33021 problem2 33022 resqrtvalex 40345 imsqrtvalex 40346 inductionexd 40858 139prmALT 44113 |
Copyright terms: Public domain | W3C validator |