| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cnegex2 | GIF version | ||
| Description: Existence of a left inverse for addition. (Contributed by Scott Fenton, 3-Jan-2013.) |
| Ref | Expression |
|---|---|
| cnegex2 | ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ (𝑥 + 𝐴) = 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnegex 8450 | . 2 ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) | |
| 2 | addcom 8409 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝐴 + 𝑥) = (𝑥 + 𝐴)) | |
| 3 | 2 | eqeq1d 2241 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → ((𝐴 + 𝑥) = 0 ↔ (𝑥 + 𝐴) = 0)) |
| 4 | 3 | rexbidva 2539 | . 2 ⊢ (𝐴 ∈ ℂ → (∃𝑥 ∈ ℂ (𝐴 + 𝑥) = 0 ↔ ∃𝑥 ∈ ℂ (𝑥 + 𝐴) = 0)) |
| 5 | 1, 4 | mpbid 147 | 1 ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ (𝑥 + 𝐴) = 0) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2203 ∃wrex 2521 (class class class)co 6049 ℂcc 8124 0cc0 8126 + caddc 8129 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2214 ax-resscn 8218 ax-1cn 8219 ax-icn 8221 ax-addcl 8222 ax-addrcl 8223 ax-mulcl 8224 ax-addcom 8226 ax-addass 8228 ax-distr 8230 ax-i2m1 8231 ax-0id 8234 ax-rnegex 8235 ax-cnre 8237 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ral 2525 df-rex 2526 df-v 2814 df-un 3214 df-in 3216 df-ss 3223 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-br 4109 df-iota 5311 df-fv 5359 df-ov 6052 |
| This theorem is referenced by: addcan 8452 |
| Copyright terms: Public domain | W3C validator |