![]() |
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 950 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐵 ∈ ℂ) | |
2 | simp1 949 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐴 ∈ ℂ) | |
3 | 1, 2 | addcomd 7784 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 + 𝐴) = (𝐴 + 𝐵)) |
4 | 3 | eqeq1d 2108 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 + 𝐴) = (𝐴 + 𝐶) ↔ (𝐴 + 𝐵) = (𝐴 + 𝐶))) |
5 | simp3 951 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐶 ∈ ℂ) | |
6 | addsubeq4 7848 | . . 3 ⊢ (((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) ∧ (𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ)) → ((𝐵 + 𝐴) = (𝐴 + 𝐶) ↔ (𝐴 − 𝐵) = (𝐴 − 𝐶))) | |
7 | 1, 2, 2, 5, 6 | syl22anc 1185 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 + 𝐴) = (𝐴 + 𝐶) ↔ (𝐴 − 𝐵) = (𝐴 − 𝐶))) |
8 | addcan 7813 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) = (𝐴 + 𝐶) ↔ 𝐵 = 𝐶)) | |
9 | 4, 7, 8 | 3bitr3d 217 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐵) = (𝐴 − 𝐶) ↔ 𝐵 = 𝐶)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 ∧ w3a 930 = wceq 1299 ∈ wcel 1448 (class class class)co 5706 ℂcc 7498 + caddc 7503 − cmin 7804 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 584 ax-in2 585 ax-io 671 ax-5 1391 ax-7 1392 ax-gen 1393 ax-ie1 1437 ax-ie2 1438 ax-8 1450 ax-10 1451 ax-11 1452 ax-i12 1453 ax-bndl 1454 ax-4 1455 ax-14 1460 ax-17 1474 ax-i9 1478 ax-ial 1482 ax-i5r 1483 ax-ext 2082 ax-sep 3986 ax-pow 4038 ax-pr 4069 ax-setind 4390 ax-resscn 7587 ax-1cn 7588 ax-icn 7590 ax-addcl 7591 ax-addrcl 7592 ax-mulcl 7593 ax-addcom 7595 ax-addass 7597 ax-distr 7599 ax-i2m1 7600 ax-0id 7603 ax-rnegex 7604 ax-cnre 7606 |
This theorem depends on definitions: df-bi 116 df-3an 932 df-tru 1302 df-fal 1305 df-nf 1405 df-sb 1704 df-eu 1963 df-mo 1964 df-clab 2087 df-cleq 2093 df-clel 2096 df-nfc 2229 df-ne 2268 df-ral 2380 df-rex 2381 df-reu 2382 df-rab 2384 df-v 2643 df-sbc 2863 df-dif 3023 df-un 3025 df-in 3027 df-ss 3034 df-pw 3459 df-sn 3480 df-pr 3481 df-op 3483 df-uni 3684 df-br 3876 df-opab 3930 df-id 4153 df-xp 4483 df-rel 4484 df-cnv 4485 df-co 4486 df-dm 4487 df-iota 5024 df-fun 5061 df-fv 5067 df-riota 5662 df-ov 5709 df-oprab 5710 df-mpo 5711 df-sub 7806 |
This theorem is referenced by: subcani 7926 subcand 7985 subcanad 7987 |
Copyright terms: Public domain | W3C validator |