![]() |
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 7978 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) = (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴)) | |
2 | 1 | eqeq1d 2149 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) = 𝐶 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
3 | 2 | 3adant3 1002 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐵) = 𝐶 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
4 | negeu 7977 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → ∃!𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) | |
5 | oveq2 5790 | . . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝐵 + 𝑥) = (𝐵 + 𝐶)) | |
6 | 5 | eqeq1d 2149 | . . . . . 6 ⊢ (𝑥 = 𝐶 → ((𝐵 + 𝑥) = 𝐴 ↔ (𝐵 + 𝐶) = 𝐴)) |
7 | 6 | riota2 5760 | . . . . 5 ⊢ ((𝐶 ∈ ℂ ∧ ∃!𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) → ((𝐵 + 𝐶) = 𝐴 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
8 | 4, 7 | sylan2 284 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ)) → ((𝐵 + 𝐶) = 𝐴 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
9 | 8 | 3impb 1178 | . . 3 ⊢ ((𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → ((𝐵 + 𝐶) = 𝐴 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
10 | 9 | 3com13 1187 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 + 𝐶) = 𝐴 ↔ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) = 𝐶)) |
11 | 3, 10 | bitr4d 190 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐵) = 𝐶 ↔ (𝐵 + 𝐶) = 𝐴)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∧ w3a 963 = wceq 1332 ∈ wcel 1481 ∃!wreu 2419 ℩crio 5737 (class class class)co 5782 ℂcc 7642 + caddc 7647 − cmin 7957 |
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-in1 604 ax-in2 605 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-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-pow 4106 ax-pr 4139 ax-setind 4460 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-fal 1338 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ne 2310 df-ral 2422 df-rex 2423 df-reu 2424 df-rab 2426 df-v 2691 df-sbc 2914 df-dif 3078 df-un 3080 df-in 3082 df-ss 3089 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-br 3938 df-opab 3998 df-id 4223 df-xp 4553 df-rel 4554 df-cnv 4555 df-co 4556 df-dm 4557 df-iota 5096 df-fun 5133 df-fv 5139 df-riota 5738 df-ov 5785 df-oprab 5786 df-mpo 5787 df-sub 7959 |
This theorem is referenced by: subadd2 7990 subsub23 7991 pncan 7992 pncan3 7994 addsubeq4 8001 subsub2 8014 renegcl 8047 subaddi 8073 subaddd 8115 fzen 9854 nn0ennn 10237 cos2t 11493 cos2tsin 11494 odd2np1 11606 divalgb 11658 sincosq1eq 12968 coskpi 12977 |
Copyright terms: Public domain | W3C validator |