![]() |
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 12226 | . . . 4 ⊢ 3 = (2 + 1) | |
2 | 1 | oveq2i 7373 | . . 3 ⊢ (3 + 3) = (3 + (2 + 1)) |
3 | 3cn 12243 | . . . 4 ⊢ 3 ∈ ℂ | |
4 | 2cn 12237 | . . . 4 ⊢ 2 ∈ ℂ | |
5 | ax-1cn 11118 | . . . 4 ⊢ 1 ∈ ℂ | |
6 | 3, 4, 5 | addassi 11174 | . . 3 ⊢ ((3 + 2) + 1) = (3 + (2 + 1)) |
7 | 2, 6 | eqtr4i 2762 | . 2 ⊢ (3 + 3) = ((3 + 2) + 1) |
8 | df-6 12229 | . . 3 ⊢ 6 = (5 + 1) | |
9 | 3p2e5 12313 | . . . 4 ⊢ (3 + 2) = 5 | |
10 | 9 | oveq1i 7372 | . . 3 ⊢ ((3 + 2) + 1) = (5 + 1) |
11 | 8, 10 | eqtr4i 2762 | . 2 ⊢ 6 = ((3 + 2) + 1) |
12 | 7, 11 | eqtr4i 2762 | 1 ⊢ (3 + 3) = 6 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1541 (class class class)co 7362 1c1 11061 + caddc 11063 2c2 12217 3c3 12218 5c5 12220 6c6 12221 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2702 ax-1cn 11118 ax-addcl 11120 ax-addass 11125 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2709 df-cleq 2723 df-clel 2809 df-rab 3406 df-v 3448 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4288 df-if 4492 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4871 df-br 5111 df-iota 6453 df-fv 6509 df-ov 7365 df-2 12225 df-3 12226 df-4 12227 df-5 12228 df-6 12229 |
This theorem is referenced by: 3t2e6 12328 163prm 17008 631prm 17010 2503prm 17023 binom4 26237 ex-dvds 29463 ex-gcd 29464 kur14lem8 33894 ex-decpmul 40864 3cubeslem3l 41067 gbegt5 46073 gboge9 46076 gbpart6 46078 gbpart9 46081 gbpart11 46082 zlmodzxzequa 46697 ackval3012 46898 ackval41a 46900 |
Copyright terms: Public domain | W3C validator |