| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > axaddass | Structured version Visualization version GIF version | ||
| 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 9 of 22 for real and complex numbers, derived from ZF set theory. This construction-dependent theorem should not be referenced directly, nor should the proven axiom ax-addass 11094 be used later. Instead, use addass 11116. (Contributed by NM, 2-Sep-1995.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| axaddass | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = (𝐴 + (𝐵 + 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfcnqs 11056 | . 2 ⊢ ℂ = ((R × R) / ◡ E ) | |
| 2 | addcnsrec 11057 | . 2 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)) → ([〈𝑥, 𝑦〉]◡ E + [〈𝑧, 𝑤〉]◡ E ) = [〈(𝑥 +R 𝑧), (𝑦 +R 𝑤)〉]◡ E ) | |
| 3 | addcnsrec 11057 | . 2 ⊢ (((𝑧 ∈ R ∧ 𝑤 ∈ R) ∧ (𝑣 ∈ R ∧ 𝑢 ∈ R)) → ([〈𝑧, 𝑤〉]◡ E + [〈𝑣, 𝑢〉]◡ E ) = [〈(𝑧 +R 𝑣), (𝑤 +R 𝑢)〉]◡ E ) | |
| 4 | addcnsrec 11057 | . 2 ⊢ ((((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R) ∧ (𝑣 ∈ R ∧ 𝑢 ∈ R)) → ([〈(𝑥 +R 𝑧), (𝑦 +R 𝑤)〉]◡ E + [〈𝑣, 𝑢〉]◡ E ) = [〈((𝑥 +R 𝑧) +R 𝑣), ((𝑦 +R 𝑤) +R 𝑢)〉]◡ E ) | |
| 5 | addcnsrec 11057 | . 2 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R)) → ([〈𝑥, 𝑦〉]◡ E + [〈(𝑧 +R 𝑣), (𝑤 +R 𝑢)〉]◡ E ) = [〈(𝑥 +R (𝑧 +R 𝑣)), (𝑦 +R (𝑤 +R 𝑢))〉]◡ E ) | |
| 6 | addclsr 10997 | . . . 4 ⊢ ((𝑥 ∈ R ∧ 𝑧 ∈ R) → (𝑥 +R 𝑧) ∈ R) | |
| 7 | addclsr 10997 | . . . 4 ⊢ ((𝑦 ∈ R ∧ 𝑤 ∈ R) → (𝑦 +R 𝑤) ∈ R) | |
| 8 | 6, 7 | anim12i 619 | . . 3 ⊢ (((𝑥 ∈ R ∧ 𝑧 ∈ R) ∧ (𝑦 ∈ R ∧ 𝑤 ∈ R)) → ((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R)) |
| 9 | 8 | an4s 666 | . 2 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)) → ((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R)) |
| 10 | addclsr 10997 | . . . 4 ⊢ ((𝑧 ∈ R ∧ 𝑣 ∈ R) → (𝑧 +R 𝑣) ∈ R) | |
| 11 | addclsr 10997 | . . . 4 ⊢ ((𝑤 ∈ R ∧ 𝑢 ∈ R) → (𝑤 +R 𝑢) ∈ R) | |
| 12 | 10, 11 | anim12i 619 | . . 3 ⊢ (((𝑧 ∈ R ∧ 𝑣 ∈ R) ∧ (𝑤 ∈ R ∧ 𝑢 ∈ R)) → ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R)) |
| 13 | 12 | an4s 666 | . 2 ⊢ (((𝑧 ∈ R ∧ 𝑤 ∈ R) ∧ (𝑣 ∈ R ∧ 𝑢 ∈ R)) → ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R)) |
| 14 | addasssr 11002 | . 2 ⊢ ((𝑥 +R 𝑧) +R 𝑣) = (𝑥 +R (𝑧 +R 𝑣)) | |
| 15 | addasssr 11002 | . 2 ⊢ ((𝑦 +R 𝑤) +R 𝑢) = (𝑦 +R (𝑤 +R 𝑢)) | |
| 16 | 1, 2, 3, 4, 5, 9, 13, 14, 15 | ecovass 8761 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = (𝐴 + (𝐵 + 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 E cep 5517 ◡ccnv 5617 (class class class)co 7356 Rcnr 10779 +R cplr 10783 ℂcc 11027 + caddc 11032 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-inf2 9553 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-int 4878 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-oadd 8399 df-omul 8400 df-er 8633 df-ec 8635 df-qs 8639 df-ni 10786 df-pli 10787 df-mi 10788 df-lti 10789 df-plpq 10822 df-mpq 10823 df-ltpq 10824 df-enq 10825 df-nq 10826 df-erq 10827 df-plq 10828 df-mq 10829 df-1nq 10830 df-rq 10831 df-ltnq 10832 df-np 10895 df-plp 10897 df-ltp 10899 df-enr 10969 df-nr 10970 df-plr 10971 df-c 11035 df-add 11040 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |