Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 5p2e7 | Structured version Visualization version GIF version |
Description: 5 + 2 = 7. (Contributed by NM, 11-May-2004.) |
Ref | Expression |
---|---|
5p2e7 | ⊢ (5 + 2) = 7 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-2 11694 | . . . . 5 ⊢ 2 = (1 + 1) | |
2 | 1 | oveq2i 7161 | . . . 4 ⊢ (5 + 2) = (5 + (1 + 1)) |
3 | 5cn 11719 | . . . . 5 ⊢ 5 ∈ ℂ | |
4 | ax-1cn 10589 | . . . . 5 ⊢ 1 ∈ ℂ | |
5 | 3, 4, 4 | addassi 10645 | . . . 4 ⊢ ((5 + 1) + 1) = (5 + (1 + 1)) |
6 | 2, 5 | eqtr4i 2847 | . . 3 ⊢ (5 + 2) = ((5 + 1) + 1) |
7 | df-6 11698 | . . . 4 ⊢ 6 = (5 + 1) | |
8 | 7 | oveq1i 7160 | . . 3 ⊢ (6 + 1) = ((5 + 1) + 1) |
9 | 6, 8 | eqtr4i 2847 | . 2 ⊢ (5 + 2) = (6 + 1) |
10 | df-7 11699 | . 2 ⊢ 7 = (6 + 1) | |
11 | 9, 10 | eqtr4i 2847 | 1 ⊢ (5 + 2) = 7 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 (class class class)co 7150 1c1 10532 + caddc 10534 2c2 11686 5c5 11689 6c6 11690 7c7 11691 |
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 2157 ax-12 2173 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 3496 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5059 df-iota 6308 df-fv 6357 df-ov 7153 df-2 11694 df-3 11695 df-4 11696 df-5 11697 df-6 11698 df-7 11699 |
This theorem is referenced by: 5p3e8 11788 17prm 16444 prmlem2 16447 37prm 16448 317prm 16453 1259lem1 16458 1259lem2 16459 1259lem4 16461 2503lem2 16465 4001lem1 16468 4001lem4 16471 log2ub 25521 bposlem8 25861 ex-decpmul 39171 fmtno5lem2 43710 257prm 43717 127prm 43757 |
Copyright terms: Public domain | W3C validator |