| 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 11074 be used later. Instead, use addass 11096. (Contributed by NM, 2-Sep-1995.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| axaddass | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = (𝐴 + (𝐵 + 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfcnqs 11036 | . 2 ⊢ ℂ = ((R × R) / ◡ E ) | |
| 2 | addcnsrec 11037 | . 2 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)) → ([〈𝑥, 𝑦〉]◡ E + [〈𝑧, 𝑤〉]◡ E ) = [〈(𝑥 +R 𝑧), (𝑦 +R 𝑤)〉]◡ E ) | |
| 3 | addcnsrec 11037 | . 2 ⊢ (((𝑧 ∈ R ∧ 𝑤 ∈ R) ∧ (𝑣 ∈ R ∧ 𝑢 ∈ R)) → ([〈𝑧, 𝑤〉]◡ E + [〈𝑣, 𝑢〉]◡ E ) = [〈(𝑧 +R 𝑣), (𝑤 +R 𝑢)〉]◡ E ) | |
| 4 | addcnsrec 11037 | . 2 ⊢ ((((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R) ∧ (𝑣 ∈ R ∧ 𝑢 ∈ R)) → ([〈(𝑥 +R 𝑧), (𝑦 +R 𝑤)〉]◡ E + [〈𝑣, 𝑢〉]◡ E ) = [〈((𝑥 +R 𝑧) +R 𝑣), ((𝑦 +R 𝑤) +R 𝑢)〉]◡ E ) | |
| 5 | addcnsrec 11037 | . 2 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R)) → ([〈𝑥, 𝑦〉]◡ E + [〈(𝑧 +R 𝑣), (𝑤 +R 𝑢)〉]◡ E ) = [〈(𝑥 +R (𝑧 +R 𝑣)), (𝑦 +R (𝑤 +R 𝑢))〉]◡ E ) | |
| 6 | addclsr 10977 | . . . 4 ⊢ ((𝑥 ∈ R ∧ 𝑧 ∈ R) → (𝑥 +R 𝑧) ∈ R) | |
| 7 | addclsr 10977 | . . . 4 ⊢ ((𝑦 ∈ R ∧ 𝑤 ∈ R) → (𝑦 +R 𝑤) ∈ R) | |
| 8 | 6, 7 | anim12i 613 | . . 3 ⊢ (((𝑥 ∈ R ∧ 𝑧 ∈ R) ∧ (𝑦 ∈ R ∧ 𝑤 ∈ R)) → ((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R)) |
| 9 | 8 | an4s 660 | . 2 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)) → ((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R)) |
| 10 | addclsr 10977 | . . . 4 ⊢ ((𝑧 ∈ R ∧ 𝑣 ∈ R) → (𝑧 +R 𝑣) ∈ R) | |
| 11 | addclsr 10977 | . . . 4 ⊢ ((𝑤 ∈ R ∧ 𝑢 ∈ R) → (𝑤 +R 𝑢) ∈ R) | |
| 12 | 10, 11 | anim12i 613 | . . 3 ⊢ (((𝑧 ∈ R ∧ 𝑣 ∈ R) ∧ (𝑤 ∈ R ∧ 𝑢 ∈ R)) → ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R)) |
| 13 | 12 | an4s 660 | . 2 ⊢ (((𝑧 ∈ R ∧ 𝑤 ∈ R) ∧ (𝑣 ∈ R ∧ 𝑢 ∈ R)) → ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R)) |
| 14 | addasssr 10982 | . 2 ⊢ ((𝑥 +R 𝑧) +R 𝑣) = (𝑥 +R (𝑧 +R 𝑣)) | |
| 15 | addasssr 10982 | . 2 ⊢ ((𝑦 +R 𝑤) +R 𝑢) = (𝑦 +R (𝑤 +R 𝑢)) | |
| 16 | 1, 2, 3, 4, 5, 9, 13, 14, 15 | ecovass 8751 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = (𝐴 + (𝐵 + 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 E cep 5518 ◡ccnv 5618 (class class class)co 7349 Rcnr 10759 +R cplr 10763 ℂcc 11007 + caddc 11012 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-inf2 9537 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-int 4897 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7800 df-1st 7924 df-2nd 7925 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-1o 8388 df-oadd 8392 df-omul 8393 df-er 8625 df-ec 8627 df-qs 8631 df-ni 10766 df-pli 10767 df-mi 10768 df-lti 10769 df-plpq 10802 df-mpq 10803 df-ltpq 10804 df-enq 10805 df-nq 10806 df-erq 10807 df-plq 10808 df-mq 10809 df-1nq 10810 df-rq 10811 df-ltnq 10812 df-np 10875 df-plp 10877 df-ltp 10879 df-enr 10949 df-nr 10950 df-plr 10951 df-c 11015 df-add 11020 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |