| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > subcan | GIF version | ||
| Description: Cancellation law for subtraction. (Contributed by NM, 8-Feb-2005.) (Revised by Mario Carneiro, 27-May-2016.) |
| Ref | Expression |
|---|---|
| subcan | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐵) = (𝐴 − 𝐶) ↔ 𝐵 = 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp2 1000 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐵 ∈ ℂ) | |
| 2 | simp1 999 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐴 ∈ ℂ) | |
| 3 | 1, 2 | addcomd 8177 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 + 𝐴) = (𝐴 + 𝐵)) |
| 4 | 3 | eqeq1d 2205 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 + 𝐴) = (𝐴 + 𝐶) ↔ (𝐴 + 𝐵) = (𝐴 + 𝐶))) |
| 5 | simp3 1001 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐶 ∈ ℂ) | |
| 6 | addsubeq4 8241 | . . 3 ⊢ (((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) ∧ (𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ)) → ((𝐵 + 𝐴) = (𝐴 + 𝐶) ↔ (𝐴 − 𝐵) = (𝐴 − 𝐶))) | |
| 7 | 1, 2, 2, 5, 6 | syl22anc 1250 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 + 𝐴) = (𝐴 + 𝐶) ↔ (𝐴 − 𝐵) = (𝐴 − 𝐶))) |
| 8 | addcan 8206 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) = (𝐴 + 𝐶) ↔ 𝐵 = 𝐶)) | |
| 9 | 4, 7, 8 | 3bitr3d 218 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐵) = (𝐴 − 𝐶) ↔ 𝐵 = 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∧ w3a 980 = wceq 1364 ∈ wcel 2167 (class class class)co 5922 ℂcc 7877 + caddc 7882 − cmin 8197 |
| 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-in1 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-14 2170 ax-ext 2178 ax-sep 4151 ax-pow 4207 ax-pr 4242 ax-setind 4573 ax-resscn 7971 ax-1cn 7972 ax-icn 7974 ax-addcl 7975 ax-addrcl 7976 ax-mulcl 7977 ax-addcom 7979 ax-addass 7981 ax-distr 7983 ax-i2m1 7984 ax-0id 7987 ax-rnegex 7988 ax-cnre 7990 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-ral 2480 df-rex 2481 df-reu 2482 df-rab 2484 df-v 2765 df-sbc 2990 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-pw 3607 df-sn 3628 df-pr 3629 df-op 3631 df-uni 3840 df-br 4034 df-opab 4095 df-id 4328 df-xp 4669 df-rel 4670 df-cnv 4671 df-co 4672 df-dm 4673 df-iota 5219 df-fun 5260 df-fv 5266 df-riota 5877 df-ov 5925 df-oprab 5926 df-mpo 5927 df-sub 8199 |
| This theorem is referenced by: subcani 8319 subcand 8378 subcanad 8380 |
| Copyright terms: Public domain | W3C validator |