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 11859 | . . . 4 ⊢ 3 = (2 + 1) | |
2 | 1 | oveq2i 7202 | . . 3 ⊢ (3 + 3) = (3 + (2 + 1)) |
3 | 3cn 11876 | . . . 4 ⊢ 3 ∈ ℂ | |
4 | 2cn 11870 | . . . 4 ⊢ 2 ∈ ℂ | |
5 | ax-1cn 10752 | . . . 4 ⊢ 1 ∈ ℂ | |
6 | 3, 4, 5 | addassi 10808 | . . 3 ⊢ ((3 + 2) + 1) = (3 + (2 + 1)) |
7 | 2, 6 | eqtr4i 2762 | . 2 ⊢ (3 + 3) = ((3 + 2) + 1) |
8 | df-6 11862 | . . 3 ⊢ 6 = (5 + 1) | |
9 | 3p2e5 11946 | . . . 4 ⊢ (3 + 2) = 5 | |
10 | 9 | oveq1i 7201 | . . 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 1543 (class class class)co 7191 1c1 10695 + caddc 10697 2c2 11850 3c3 11851 5c5 11853 6c6 11854 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-ext 2708 ax-1cn 10752 ax-addcl 10754 ax-addass 10759 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-sb 2073 df-clab 2715 df-cleq 2728 df-clel 2809 df-rab 3060 df-v 3400 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4224 df-if 4426 df-sn 4528 df-pr 4530 df-op 4534 df-uni 4806 df-br 5040 df-iota 6316 df-fv 6366 df-ov 7194 df-2 11858 df-3 11859 df-4 11860 df-5 11861 df-6 11862 |
This theorem is referenced by: 3t2e6 11961 163prm 16641 631prm 16643 2503prm 16656 binom4 25687 ex-dvds 28493 ex-gcd 28494 kur14lem8 32842 ex-decpmul 39968 3cubeslem3l 40152 gbegt5 44829 gboge9 44832 gbpart6 44834 gbpart9 44837 gbpart11 44838 zlmodzxzequa 45453 ackval3012 45654 ackval41a 45656 |
Copyright terms: Public domain | W3C validator |