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

Theorem axaddass 7932
Description: Addition of complex numbers is associative. This theorem transfers the associative laws for the real and imaginary signed real components of complex number pairs, to complex number addition itself. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly, nor should the proven axiom ax-addass 7974 be used later. Instead, use addass 8002. (Contributed by NM, 2-Sep-1995.) (New usage is discouraged.)
Assertion
Ref Expression
axaddass ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = (𝐴 + (𝐵 + 𝐶)))

Proof of Theorem axaddass
Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfcnqs 7901 . 2 ℂ = ((R × R) / E )
2 addcnsrec 7902 . 2 (((𝑥R𝑦R) ∧ (𝑧R𝑤R)) → ([⟨𝑥, 𝑦⟩] E + [⟨𝑧, 𝑤⟩] E ) = [⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩] E )
3 addcnsrec 7902 . 2 (((𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ([⟨𝑧, 𝑤⟩] E + [⟨𝑣, 𝑢⟩] E ) = [⟨(𝑧 +R 𝑣), (𝑤 +R 𝑢)⟩] E )
4 addcnsrec 7902 . 2 ((((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R) ∧ (𝑣R𝑢R)) → ([⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩] E + [⟨𝑣, 𝑢⟩] E ) = [⟨((𝑥 +R 𝑧) +R 𝑣), ((𝑦 +R 𝑤) +R 𝑢)⟩] E )
5 addcnsrec 7902 . 2 (((𝑥R𝑦R) ∧ ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R)) → ([⟨𝑥, 𝑦⟩] E + [⟨(𝑧 +R 𝑣), (𝑤 +R 𝑢)⟩] E ) = [⟨(𝑥 +R (𝑧 +R 𝑣)), (𝑦 +R (𝑤 +R 𝑢))⟩] E )
6 addclsr 7813 . . . 4 ((𝑥R𝑧R) → (𝑥 +R 𝑧) ∈ R)
7 addclsr 7813 . . . 4 ((𝑦R𝑤R) → (𝑦 +R 𝑤) ∈ R)
86, 7anim12i 338 . . 3 (((𝑥R𝑧R) ∧ (𝑦R𝑤R)) → ((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R))
98an4s 588 . 2 (((𝑥R𝑦R) ∧ (𝑧R𝑤R)) → ((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R))
10 addclsr 7813 . . . 4 ((𝑧R𝑣R) → (𝑧 +R 𝑣) ∈ R)
11 addclsr 7813 . . . 4 ((𝑤R𝑢R) → (𝑤 +R 𝑢) ∈ R)
1210, 11anim12i 338 . . 3 (((𝑧R𝑣R) ∧ (𝑤R𝑢R)) → ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R))
1312an4s 588 . 2 (((𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R))
14 addasssrg 7816 . . . . 5 ((𝑥R𝑧R𝑣R) → ((𝑥 +R 𝑧) +R 𝑣) = (𝑥 +R (𝑧 +R 𝑣)))
15143adant3r 1237 . . . 4 ((𝑥R𝑧R ∧ (𝑣R𝑢R)) → ((𝑥 +R 𝑧) +R 𝑣) = (𝑥 +R (𝑧 +R 𝑣)))
16153adant2r 1235 . . 3 ((𝑥R ∧ (𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ((𝑥 +R 𝑧) +R 𝑣) = (𝑥 +R (𝑧 +R 𝑣)))
17163adant1r 1233 . 2 (((𝑥R𝑦R) ∧ (𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ((𝑥 +R 𝑧) +R 𝑣) = (𝑥 +R (𝑧 +R 𝑣)))
18 addasssrg 7816 . . . . 5 ((𝑦R𝑤R𝑢R) → ((𝑦 +R 𝑤) +R 𝑢) = (𝑦 +R (𝑤 +R 𝑢)))
19183adant3l 1236 . . . 4 ((𝑦R𝑤R ∧ (𝑣R𝑢R)) → ((𝑦 +R 𝑤) +R 𝑢) = (𝑦 +R (𝑤 +R 𝑢)))
20193adant2l 1234 . . 3 ((𝑦R ∧ (𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ((𝑦 +R 𝑤) +R 𝑢) = (𝑦 +R (𝑤 +R 𝑢)))
21203adant1l 1232 . 2 (((𝑥R𝑦R) ∧ (𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ((𝑦 +R 𝑤) +R 𝑢) = (𝑦 +R (𝑤 +R 𝑢)))
221, 2, 3, 4, 5, 9, 13, 17, 21ecoviass 6699 1 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = (𝐴 + (𝐵 + 𝐶)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 980   = wceq 1364  wcel 2164   E cep 4318  ccnv 4658  (class class class)co 5918  Rcnr 7357   +R cplr 7361  cc 7870   + caddc 7875
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-iinf 4620
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-tr 4128  df-eprel 4320  df-id 4324  df-po 4327  df-iso 4328  df-iord 4397  df-on 4399  df-suc 4402  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-recs 6358  df-irdg 6423  df-1o 6469  df-2o 6470  df-oadd 6473  df-omul 6474  df-er 6587  df-ec 6589  df-qs 6593  df-ni 7364  df-pli 7365  df-mi 7366  df-lti 7367  df-plpq 7404  df-mpq 7405  df-enq 7407  df-nqqs 7408  df-plqqs 7409  df-mqqs 7410  df-1nqqs 7411  df-rq 7412  df-ltnqqs 7413  df-enq0 7484  df-nq0 7485  df-0nq0 7486  df-plq0 7487  df-mq0 7488  df-inp 7526  df-iplp 7528  df-enr 7786  df-nr 7787  df-plr 7788  df-c 7878  df-add 7883
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator