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 11695 | . . . 4 ⊢ 3 = (2 + 1) | |
2 | 1 | oveq2i 7161 | . . 3 ⊢ (3 + 3) = (3 + (2 + 1)) |
3 | 3cn 11712 | . . . 4 ⊢ 3 ∈ ℂ | |
4 | 2cn 11706 | . . . 4 ⊢ 2 ∈ ℂ | |
5 | ax-1cn 10589 | . . . 4 ⊢ 1 ∈ ℂ | |
6 | 3, 4, 5 | addassi 10645 | . . 3 ⊢ ((3 + 2) + 1) = (3 + (2 + 1)) |
7 | 2, 6 | eqtr4i 2847 | . 2 ⊢ (3 + 3) = ((3 + 2) + 1) |
8 | df-6 11698 | . . 3 ⊢ 6 = (5 + 1) | |
9 | 3p2e5 11782 | . . . 4 ⊢ (3 + 2) = 5 | |
10 | 9 | oveq1i 7160 | . . 3 ⊢ ((3 + 2) + 1) = (5 + 1) |
11 | 8, 10 | eqtr4i 2847 | . 2 ⊢ 6 = ((3 + 2) + 1) |
12 | 7, 11 | eqtr4i 2847 | 1 ⊢ (3 + 3) = 6 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 (class class class)co 7150 1c1 10532 + caddc 10534 2c2 11686 3c3 11687 5c5 11689 6c6 11690 |
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 |
This theorem is referenced by: 3t2e6 11797 163prm 16452 631prm 16454 2503prm 16467 binom4 25422 ex-dvds 28229 ex-gcd 28230 kur14lem8 32455 ex-decpmul 39171 3cubeslem3l 39276 gbegt5 43920 gboge9 43923 gbpart6 43925 gbpart9 43928 gbpart11 43929 zlmodzxzequa 44545 |
Copyright terms: Public domain | W3C validator |