| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > addlid | GIF version | ||
| Description: 0 is a left identity for addition. (Contributed by Scott Fenton, 3-Jan-2013.) |
| Ref | Expression |
|---|---|
| addlid | ⊢ (𝐴 ∈ ℂ → (0 + 𝐴) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0cn 8324 | . . 3 ⊢ 0 ∈ ℂ | |
| 2 | addcom 8470 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 0 ∈ ℂ) → (𝐴 + 0) = (0 + 𝐴)) | |
| 3 | 1, 2 | mpan2 429 | . 2 ⊢ (𝐴 ∈ ℂ → (𝐴 + 0) = (0 + 𝐴)) |
| 4 | addrid 8471 | . 2 ⊢ (𝐴 ∈ ℂ → (𝐴 + 0) = 𝐴) | |
| 5 | 3, 4 | eqtr3d 2273 | 1 ⊢ (𝐴 ∈ ℂ → (0 + 𝐴) = 𝐴) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ∈ wcel 2209 (class class class)co 6088 ℂcc 8183 0cc0 8185 + caddc 8188 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1500 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-4 1563 ax-17 1579 ax-ial 1587 ax-ext 2220 ax-1cn 8278 ax-icn 8280 ax-addcl 8281 ax-mulcl 8283 ax-addcom 8285 ax-i2m1 8290 ax-0id 8293 |
| This proof depends on definitions: df-bi 117 df-cleq 2231 df-clel 2234 |
| This theorem is used by: readdcan 8473 addlidi 8476 addlidd 8483 cnegexlem1 8508 cnegexlem2 8509 addcan 8513 negneg 8583 fz0to4untppr 10547 fzo0addel 10622 fzoaddel2 10624 divfl0 10751 modqid 10806 swrdspsleq 11460 swrds1 11461 sumrbdclem 12168 summodclem2a 12172 fisum0diag2 12238 eftlub 12481 gcdid 12787 cncrng 15014 ptolemy 16068 |
| Copyright terms: Public domain | W3C validator |