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 11696 | . . . 4 ⊢ 4 = (3 + 1) | |
2 | 1 | oveq2i 7161 | . . 3 ⊢ (5 + 4) = (5 + (3 + 1)) |
3 | 5cn 11719 | . . . 4 ⊢ 5 ∈ ℂ | |
4 | 3cn 11712 | . . . 4 ⊢ 3 ∈ ℂ | |
5 | ax-1cn 10589 | . . . 4 ⊢ 1 ∈ ℂ | |
6 | 3, 4, 5 | addassi 10645 | . . 3 ⊢ ((5 + 3) + 1) = (5 + (3 + 1)) |
7 | 2, 6 | eqtr4i 2847 | . 2 ⊢ (5 + 4) = ((5 + 3) + 1) |
8 | df-9 11701 | . . 3 ⊢ 9 = (8 + 1) | |
9 | 5p3e8 11788 | . . . 4 ⊢ (5 + 3) = 8 | |
10 | 9 | oveq1i 7160 | . . 3 ⊢ ((5 + 3) + 1) = (8 + 1) |
11 | 8, 10 | eqtr4i 2847 | . 2 ⊢ 9 = ((5 + 3) + 1) |
12 | 7, 11 | eqtr4i 2847 | 1 ⊢ (5 + 4) = 9 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 (class class class)co 7150 1c1 10532 + caddc 10534 3c3 11687 4c4 11688 5c5 11689 8c8 11692 9c9 11693 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-1cn 10589 ax-addcl 10591 ax-addass 10596 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rex 3144 df-rab 3147 df-v 3497 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-br 5060 df-iota 6309 df-fv 6358 df-ov 7153 df-2 11694 df-3 11695 df-4 11696 df-5 11697 df-6 11698 df-7 11699 df-8 11700 df-9 11701 |
This theorem is referenced by: 5p5e10 12163 139prm 16451 1259lem3 16460 1259lem4 16461 2503lem2 16465 4001lem1 16468 4001lem2 16469 hgt750lem2 31918 problem1 32903 problem2 32904 inductionexd 40498 139prmALT 43752 |
Copyright terms: Public domain | W3C validator |