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

Theorem axaddass 8091
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 8133 be used later. Instead, use addass 8161. (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 8060 . 2 ℂ = ((R × R) / E )
2 addcnsrec 8061 . 2 (((𝑥R𝑦R) ∧ (𝑧R𝑤R)) → ([⟨𝑥, 𝑦⟩] E + [⟨𝑧, 𝑤⟩] E ) = [⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩] E )
3 addcnsrec 8061 . 2 (((𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ([⟨𝑧, 𝑤⟩] E + [⟨𝑣, 𝑢⟩] E ) = [⟨(𝑧 +R 𝑣), (𝑤 +R 𝑢)⟩] E )
4 addcnsrec 8061 . 2 ((((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R) ∧ (𝑣R𝑢R)) → ([⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩] E + [⟨𝑣, 𝑢⟩] E ) = [⟨((𝑥 +R 𝑧) +R 𝑣), ((𝑦 +R 𝑤) +R 𝑢)⟩] E )
5 addcnsrec 8061 . 2 (((𝑥R𝑦R) ∧ ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R)) → ([⟨𝑥, 𝑦⟩] E + [⟨(𝑧 +R 𝑣), (𝑤 +R 𝑢)⟩] E ) = [⟨(𝑥 +R (𝑧 +R 𝑣)), (𝑦 +R (𝑤 +R 𝑢))⟩] E )
6 addclsr 7972 . . . 4 ((𝑥R𝑧R) → (𝑥 +R 𝑧) ∈ R)
7 addclsr 7972 . . . 4 ((𝑦R𝑤R) → (𝑦 +R 𝑤) ∈ R)
86, 7anim12i 338 . . 3 (((𝑥R𝑧R) ∧ (𝑦R𝑤R)) → ((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R))
98an4s 592 . 2 (((𝑥R𝑦R) ∧ (𝑧R𝑤R)) → ((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R))
10 addclsr 7972 . . . 4 ((𝑧R𝑣R) → (𝑧 +R 𝑣) ∈ R)
11 addclsr 7972 . . . 4 ((𝑤R𝑢R) → (𝑤 +R 𝑢) ∈ R)
1210, 11anim12i 338 . . 3 (((𝑧R𝑣R) ∧ (𝑤R𝑢R)) → ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R))
1312an4s 592 . 2 (((𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R))
14 addasssrg 7975 . . . . 5 ((𝑥R𝑧R𝑣R) → ((𝑥 +R 𝑧) +R 𝑣) = (𝑥 +R (𝑧 +R 𝑣)))
15143adant3r 1261 . . . 4 ((𝑥R𝑧R ∧ (𝑣R𝑢R)) → ((𝑥 +R 𝑧) +R 𝑣) = (𝑥 +R (𝑧 +R 𝑣)))
16153adant2r 1259 . . 3 ((𝑥R ∧ (𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ((𝑥 +R 𝑧) +R 𝑣) = (𝑥 +R (𝑧 +R 𝑣)))
17163adant1r 1257 . 2 (((𝑥R𝑦R) ∧ (𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ((𝑥 +R 𝑧) +R 𝑣) = (𝑥 +R (𝑧 +R 𝑣)))
18 addasssrg 7975 . . . . 5 ((𝑦R𝑤R𝑢R) → ((𝑦 +R 𝑤) +R 𝑢) = (𝑦 +R (𝑤 +R 𝑢)))
19183adant3l 1260 . . . 4 ((𝑦R𝑤R ∧ (𝑣R𝑢R)) → ((𝑦 +R 𝑤) +R 𝑢) = (𝑦 +R (𝑤 +R 𝑢)))
20193adant2l 1258 . . 3 ((𝑦R ∧ (𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ((𝑦 +R 𝑤) +R 𝑢) = (𝑦 +R (𝑤 +R 𝑢)))
21203adant1l 1256 . 2 (((𝑥R𝑦R) ∧ (𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ((𝑦 +R 𝑤) +R 𝑢) = (𝑦 +R (𝑤 +R 𝑢)))
221, 2, 3, 4, 5, 9, 13, 17, 21ecoviass 6813 1 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = (𝐴 + (𝐵 + 𝐶)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1004   = wceq 1397  wcel 2202   E cep 4384  ccnv 4724  (class class class)co 6017  Rcnr 7516   +R cplr 7520  cc 8029   + caddc 8034
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-eprel 4386  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-irdg 6535  df-1o 6581  df-2o 6582  df-oadd 6585  df-omul 6586  df-er 6701  df-ec 6703  df-qs 6707  df-ni 7523  df-pli 7524  df-mi 7525  df-lti 7526  df-plpq 7563  df-mpq 7564  df-enq 7566  df-nqqs 7567  df-plqqs 7568  df-mqqs 7569  df-1nqqs 7570  df-rq 7571  df-ltnqqs 7572  df-enq0 7643  df-nq0 7644  df-0nq0 7645  df-plq0 7646  df-mq0 7647  df-inp 7685  df-iplp 7687  df-enr 7945  df-nr 7946  df-plr 7947  df-c 8037  df-add 8042
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator