Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 3p3e6 | Structured version Visualization version GIF version |
Description: 3 + 3 = 6. (Contributed by NM, 11-May-2004.) |
Ref | Expression |
---|---|
3p3e6 | ⊢ (3 + 3) = 6 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-3 11704 | . . . 4 ⊢ 3 = (2 + 1) | |
2 | 1 | oveq2i 7169 | . . 3 ⊢ (3 + 3) = (3 + (2 + 1)) |
3 | 3cn 11721 | . . . 4 ⊢ 3 ∈ ℂ | |
4 | 2cn 11715 | . . . 4 ⊢ 2 ∈ ℂ | |
5 | ax-1cn 10597 | . . . 4 ⊢ 1 ∈ ℂ | |
6 | 3, 4, 5 | addassi 10653 | . . 3 ⊢ ((3 + 2) + 1) = (3 + (2 + 1)) |
7 | 2, 6 | eqtr4i 2849 | . 2 ⊢ (3 + 3) = ((3 + 2) + 1) |
8 | df-6 11707 | . . 3 ⊢ 6 = (5 + 1) | |
9 | 3p2e5 11791 | . . . 4 ⊢ (3 + 2) = 5 | |
10 | 9 | oveq1i 7168 | . . 3 ⊢ ((3 + 2) + 1) = (5 + 1) |
11 | 8, 10 | eqtr4i 2849 | . 2 ⊢ 6 = ((3 + 2) + 1) |
12 | 7, 11 | eqtr4i 2849 | 1 ⊢ (3 + 3) = 6 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 (class class class)co 7158 1c1 10540 + caddc 10542 2c2 11695 3c3 11696 5c5 11698 6c6 11699 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-1cn 10597 ax-addcl 10599 ax-addass 10604 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-rab 3149 df-v 3498 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-iota 6316 df-fv 6365 df-ov 7161 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-6 11707 |
This theorem is referenced by: 3t2e6 11806 163prm 16460 631prm 16462 2503prm 16475 binom4 25430 ex-dvds 28237 ex-gcd 28238 kur14lem8 32462 ex-decpmul 39185 3cubeslem3l 39290 gbegt5 43933 gboge9 43936 gbpart6 43938 gbpart9 43941 gbpart11 43942 zlmodzxzequa 44558 |
Copyright terms: Public domain | W3C validator |