Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  addcan GIF version

 Description: Cancellation law for addition. Theorem I.1 of [Apostol] p. 18. (Contributed by NM, 22-Nov-1994.) (Proof shortened by Mario Carneiro, 27-May-2016.)
Assertion
Ref Expression
addcan ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) = (𝐴 + 𝐶) ↔ 𝐵 = 𝐶))

Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 cnegex2 7961 . . 3 (𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ (𝑥 + 𝐴) = 0)
213ad2ant1 1003 . 2 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ∃𝑥 ∈ ℂ (𝑥 + 𝐴) = 0)
3 oveq2 5786 . . . 4 ((𝐴 + 𝐵) = (𝐴 + 𝐶) → (𝑥 + (𝐴 + 𝐵)) = (𝑥 + (𝐴 + 𝐶)))
4 simprr 522 . . . . . . 7 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝑥 + 𝐴) = 0)) → (𝑥 + 𝐴) = 0)
54oveq1d 5793 . . . . . 6 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝑥 + 𝐴) = 0)) → ((𝑥 + 𝐴) + 𝐵) = (0 + 𝐵))
6 simprl 521 . . . . . . 7 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝑥 + 𝐴) = 0)) → 𝑥 ∈ ℂ)
7 simpl1 985 . . . . . . 7 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝑥 + 𝐴) = 0)) → 𝐴 ∈ ℂ)
8 simpl2 986 . . . . . . 7 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝑥 + 𝐴) = 0)) → 𝐵 ∈ ℂ)
96, 7, 8addassd 7808 . . . . . 6 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝑥 + 𝐴) = 0)) → ((𝑥 + 𝐴) + 𝐵) = (𝑥 + (𝐴 + 𝐵)))
10 addid2 7921 . . . . . . 7 (𝐵 ∈ ℂ → (0 + 𝐵) = 𝐵)
118, 10syl 14 . . . . . 6 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝑥 + 𝐴) = 0)) → (0 + 𝐵) = 𝐵)
125, 9, 113eqtr3d 2181 . . . . 5 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝑥 + 𝐴) = 0)) → (𝑥 + (𝐴 + 𝐵)) = 𝐵)
134oveq1d 5793 . . . . . 6 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝑥 + 𝐴) = 0)) → ((𝑥 + 𝐴) + 𝐶) = (0 + 𝐶))
14 simpl3 987 . . . . . . 7 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝑥 + 𝐴) = 0)) → 𝐶 ∈ ℂ)
156, 7, 14addassd 7808 . . . . . 6 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝑥 + 𝐴) = 0)) → ((𝑥 + 𝐴) + 𝐶) = (𝑥 + (𝐴 + 𝐶)))
16 addid2 7921 . . . . . . 7 (𝐶 ∈ ℂ → (0 + 𝐶) = 𝐶)
1714, 16syl 14 . . . . . 6 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝑥 + 𝐴) = 0)) → (0 + 𝐶) = 𝐶)
1813, 15, 173eqtr3d 2181 . . . . 5 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝑥 + 𝐴) = 0)) → (𝑥 + (𝐴 + 𝐶)) = 𝐶)
1912, 18eqeq12d 2155 . . . 4 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝑥 + 𝐴) = 0)) → ((𝑥 + (𝐴 + 𝐵)) = (𝑥 + (𝐴 + 𝐶)) ↔ 𝐵 = 𝐶))
203, 19syl5ib 153 . . 3 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝑥 + 𝐴) = 0)) → ((𝐴 + 𝐵) = (𝐴 + 𝐶) → 𝐵 = 𝐶))
21 oveq2 5786 . . 3 (𝐵 = 𝐶 → (𝐴 + 𝐵) = (𝐴 + 𝐶))
2220, 21impbid1 141 . 2 (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ (𝑥 + 𝐴) = 0)) → ((𝐴 + 𝐵) = (𝐴 + 𝐶) ↔ 𝐵 = 𝐶))
232, 22rexlimddv 2555 1 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) = (𝐴 + 𝐶) ↔ 𝐵 = 𝐶))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   ∧ w3a 963   = wceq 1332   ∈ wcel 1481  ∃wrex 2418  (class class class)co 5778  ℂcc 7638  0cc0 7640   + caddc 7643 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 7732  ax-1cn 7733  ax-icn 7735  ax-addcl 7736  ax-addrcl 7737  ax-mulcl 7738  ax-addcom 7740  ax-addass 7742  ax-distr 7744  ax-i2m1 7745  ax-0id 7748  ax-rnegex 7749  ax-cnre 7751 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 2689  df-un 3076  df-in 3078  df-ss 3085  df-sn 3534  df-pr 3535  df-op 3537  df-uni 3741  df-br 3934  df-iota 5092  df-fv 5135  df-ov 5781 This theorem is referenced by:  addcani  7964  addcand  7966  subcan  8037
 Copyright terms: Public domain W3C validator