| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > subadd | GIF version | ||
| Description: Relationship between subtraction and addition. (Contributed by NM, 20-Jan-1997.) (Revised by Mario Carneiro, 21-Dec-2013.) |
| Ref | Expression |
|---|---|
| subadd | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐵) = 𝐶 ↔ (𝐵 + 𝐶) = 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subval 8526 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) = (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴)) | |
| 2 | 1 | eqeq1d 2247 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) = 𝐶 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
| 3 | 2 | 3adant3 1048 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐵) = 𝐶 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
| 4 | negeu 8525 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → ∃!𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) | |
| 5 | oveq2 6096 | . . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝐵 + 𝑥) = (𝐵 + 𝐶)) | |
| 6 | 5 | eqeq1d 2247 | . . . . . 6 ⊢ (𝑥 = 𝐶 → ((𝐵 + 𝑥) = 𝐴 ↔ (𝐵 + 𝐶) = 𝐴)) |
| 7 | 6 | riota2 6065 | . . . . 5 ⊢ ((𝐶 ∈ ℂ ∧ ∃!𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) → ((𝐵 + 𝐶) = 𝐴 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
| 8 | 4, 7 | sylan2 286 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ)) → ((𝐵 + 𝐶) = 𝐴 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
| 9 | 8 | 3impb 1230 | . . 3 ⊢ ((𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → ((𝐵 + 𝐶) = 𝐴 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
| 10 | 9 | 3com13 1239 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 + 𝐶) = 𝐴 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
| 11 | 3, 10 | bitr4d 191 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐵) = 𝐶 ↔ (𝐵 + 𝐶) = 𝐴)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ∃!wreu 2530 ℩crio 6040 (class class class)co 6088 ℂcc 8184 + caddc 8189 − cmin 8505 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-setind 4686 ax-resscn 8278 ax-1cn 8279 ax-icn 8281 ax-addcl 8282 ax-addrcl 8283 ax-mulcl 8284 ax-addcom 8286 ax-addass 8288 ax-distr 8290 ax-i2m1 8291 ax-0id 8294 ax-rnegex 8295 ax-cnre 8297 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4132 df-opab 4194 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-iota 5340 df-fun 5382 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-sub 8507 |
| This theorem is used by: subadd2 8538 subsub23 8539 pncan 8540 pncan3 8542 addsubeq4 8549 subsub2 8562 renegcl 8595 subaddi 8621 subaddd 8663 fzen 10465 nn0ennn 10892 cos2t 12543 cos2tsin 12544 odd2np1 12666 divalgb 12718 sincosq1eq 16078 coskpi 16087 |
| Copyright terms: Public domain | W3C validator |