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

Theorem axaddass 8070
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 8112 be used later. Instead, use addass 8140. (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 8039 . 2 ℂ = ((R × R) / E )
2 addcnsrec 8040 . 2 (((𝑥R𝑦R) ∧ (𝑧R𝑤R)) → ([⟨𝑥, 𝑦⟩] E + [⟨𝑧, 𝑤⟩] E ) = [⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩] E )
3 addcnsrec 8040 . 2 (((𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ([⟨𝑧, 𝑤⟩] E + [⟨𝑣, 𝑢⟩] E ) = [⟨(𝑧 +R 𝑣), (𝑤 +R 𝑢)⟩] E )
4 addcnsrec 8040 . 2 ((((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R) ∧ (𝑣R𝑢R)) → ([⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩] E + [⟨𝑣, 𝑢⟩] E ) = [⟨((𝑥 +R 𝑧) +R 𝑣), ((𝑦 +R 𝑤) +R 𝑢)⟩] E )
5 addcnsrec 8040 . 2 (((𝑥R𝑦R) ∧ ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R)) → ([⟨𝑥, 𝑦⟩] E + [⟨(𝑧 +R 𝑣), (𝑤 +R 𝑢)⟩] E ) = [⟨(𝑥 +R (𝑧 +R 𝑣)), (𝑦 +R (𝑤 +R 𝑢))⟩] E )
6 addclsr 7951 . . . 4 ((𝑥R𝑧R) → (𝑥 +R 𝑧) ∈ R)
7 addclsr 7951 . . . 4 ((𝑦R𝑤R) → (𝑦 +R 𝑤) ∈ R)
86, 7anim12i 338 . . 3 (((𝑥R𝑧R) ∧ (𝑦R𝑤R)) → ((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R))
98an4s 590 . 2 (((𝑥R𝑦R) ∧ (𝑧R𝑤R)) → ((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R))
10 addclsr 7951 . . . 4 ((𝑧R𝑣R) → (𝑧 +R 𝑣) ∈ R)
11 addclsr 7951 . . . 4 ((𝑤R𝑢R) → (𝑤 +R 𝑢) ∈ R)
1210, 11anim12i 338 . . 3 (((𝑧R𝑣R) ∧ (𝑤R𝑢R)) → ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R))
1312an4s 590 . 2 (((𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R))
14 addasssrg 7954 . . . . 5 ((𝑥R𝑧R𝑣R) → ((𝑥 +R 𝑧) +R 𝑣) = (𝑥 +R (𝑧 +R 𝑣)))
15143adant3r 1259 . . . 4 ((𝑥R𝑧R ∧ (𝑣R𝑢R)) → ((𝑥 +R 𝑧) +R 𝑣) = (𝑥 +R (𝑧 +R 𝑣)))
16153adant2r 1257 . . 3 ((𝑥R ∧ (𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ((𝑥 +R 𝑧) +R 𝑣) = (𝑥 +R (𝑧 +R 𝑣)))
17163adant1r 1255 . 2 (((𝑥R𝑦R) ∧ (𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ((𝑥 +R 𝑧) +R 𝑣) = (𝑥 +R (𝑧 +R 𝑣)))
18 addasssrg 7954 . . . . 5 ((𝑦R𝑤R𝑢R) → ((𝑦 +R 𝑤) +R 𝑢) = (𝑦 +R (𝑤 +R 𝑢)))
19183adant3l 1258 . . . 4 ((𝑦R𝑤R ∧ (𝑣R𝑢R)) → ((𝑦 +R 𝑤) +R 𝑢) = (𝑦 +R (𝑤 +R 𝑢)))
20193adant2l 1256 . . 3 ((𝑦R ∧ (𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ((𝑦 +R 𝑤) +R 𝑢) = (𝑦 +R (𝑤 +R 𝑢)))
21203adant1l 1254 . 2 (((𝑥R𝑦R) ∧ (𝑧R𝑤R) ∧ (𝑣R𝑢R)) → ((𝑦 +R 𝑤) +R 𝑢) = (𝑦 +R (𝑤 +R 𝑢)))
221, 2, 3, 4, 5, 9, 13, 17, 21ecoviass 6800 1 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = (𝐴 + (𝐵 + 𝐶)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1002   = wceq 1395  wcel 2200   E cep 4378  ccnv 4718  (class class class)co 6007  Rcnr 7495   +R cplr 7499  cc 8008   + caddc 8013
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-eprel 4380  df-id 4384  df-po 4387  df-iso 4388  df-iord 4457  df-on 4459  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1st 6292  df-2nd 6293  df-recs 6457  df-irdg 6522  df-1o 6568  df-2o 6569  df-oadd 6572  df-omul 6573  df-er 6688  df-ec 6690  df-qs 6694  df-ni 7502  df-pli 7503  df-mi 7504  df-lti 7505  df-plpq 7542  df-mpq 7543  df-enq 7545  df-nqqs 7546  df-plqqs 7547  df-mqqs 7548  df-1nqqs 7549  df-rq 7550  df-ltnqqs 7551  df-enq0 7622  df-nq0 7623  df-0nq0 7624  df-plq0 7625  df-mq0 7626  df-inp 7664  df-iplp 7666  df-enr 7924  df-nr 7925  df-plr 7926  df-c 8016  df-add 8021
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator