![]() |
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 7964 | . 2 ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ (𝐴 + 𝑥) = 0) | |
2 | addcom 7923 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝐴 + 𝑥) = (𝑥 + 𝐴)) | |
3 | 2 | eqeq1d 2149 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → ((𝐴 + 𝑥) = 0 ↔ (𝑥 + 𝐴) = 0)) |
4 | 3 | rexbidva 2435 | . 2 ⊢ (𝐴 ∈ ℂ → (∃𝑥 ∈ ℂ (𝐴 + 𝑥) = 0 ↔ ∃𝑥 ∈ ℂ (𝑥 + 𝐴) = 0)) |
5 | 1, 4 | mpbid 146 | 1 ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ (𝑥 + 𝐴) = 0) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1332 ∈ wcel 1481 ∃wrex 2418 (class class class)co 5782 ℂcc 7642 0cc0 7644 + caddc 7647 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-resscn 7736 ax-1cn 7737 ax-icn 7739 ax-addcl 7740 ax-addrcl 7741 ax-mulcl 7742 ax-addcom 7744 ax-addass 7746 ax-distr 7748 ax-i2m1 7749 ax-0id 7752 ax-rnegex 7753 ax-cnre 7755 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ral 2422 df-rex 2423 df-v 2691 df-un 3080 df-in 3082 df-ss 3089 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-br 3938 df-iota 5096 df-fv 5139 df-ov 5785 |
This theorem is referenced by: addcan 7966 |
Copyright terms: Public domain | W3C validator |