Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > add1p1 | Structured version Visualization version GIF version |
Description: Adding two times 1 to a number. (Contributed by AV, 22-Sep-2018.) |
Ref | Expression |
---|---|
add1p1 | ⊢ (𝑁 ∈ ℂ → ((𝑁 + 1) + 1) = (𝑁 + 2)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | id 22 | . . 3 ⊢ (𝑁 ∈ ℂ → 𝑁 ∈ ℂ) | |
2 | 1cnd 10628 | . . 3 ⊢ (𝑁 ∈ ℂ → 1 ∈ ℂ) | |
3 | 1, 2, 2 | addassd 10655 | . 2 ⊢ (𝑁 ∈ ℂ → ((𝑁 + 1) + 1) = (𝑁 + (1 + 1))) |
4 | 1p1e2 11754 | . . . 4 ⊢ (1 + 1) = 2 | |
5 | 4 | a1i 11 | . . 3 ⊢ (𝑁 ∈ ℂ → (1 + 1) = 2) |
6 | 5 | oveq2d 7164 | . 2 ⊢ (𝑁 ∈ ℂ → (𝑁 + (1 + 1)) = (𝑁 + 2)) |
7 | 3, 6 | eqtrd 2854 | 1 ⊢ (𝑁 ∈ ℂ → ((𝑁 + 1) + 1) = (𝑁 + 2)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1531 ∈ wcel 2108 (class class class)co 7148 ℂcc 10527 1c1 10530 + caddc 10532 2c2 11684 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1905 ax-6 1964 ax-7 2009 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2154 ax-12 2170 ax-ext 2791 ax-1cn 10587 ax-addass 10594 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1084 df-tru 1534 df-ex 1775 df-nf 1779 df-sb 2064 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-rex 3142 df-rab 3145 df-v 3495 df-dif 3937 df-un 3939 df-in 3941 df-ss 3950 df-nul 4290 df-if 4466 df-sn 4560 df-pr 4562 df-op 4566 df-uni 4831 df-br 5058 df-iota 6307 df-fv 6356 df-ov 7151 df-2 11692 |
This theorem is referenced by: nneo 12058 ccatw2s1len 13972 chfacfscmul0 21458 chfacfscmulfsupp 21459 chfacfscmulgsum 21460 chfacfpmmul0 21462 chfacfpmmulfsupp 21463 chfacfpmmulgsum 21464 upgrwlkdvdelem 27509 poimirlem7 34891 fmtnoprmfac2 43720 fmtnofac1 43723 evenltle 43873 |
Copyright terms: Public domain | W3C validator |