| 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 11103 be used later. Instead, use addass 11125. (Contributed by NM, 2-Sep-1995.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| axaddass | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = (𝐴 + (𝐵 + 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfcnqs 11065 | . 2 ⊢ ℂ = ((R × R) / ◡ E ) | |
| 2 | addcnsrec 11066 | . 2 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)) → ([〈𝑥, 𝑦〉]◡ E + [〈𝑧, 𝑤〉]◡ E ) = [〈(𝑥 +R 𝑧), (𝑦 +R 𝑤)〉]◡ E ) | |
| 3 | addcnsrec 11066 | . 2 ⊢ (((𝑧 ∈ R ∧ 𝑤 ∈ R) ∧ (𝑣 ∈ R ∧ 𝑢 ∈ R)) → ([〈𝑧, 𝑤〉]◡ E + [〈𝑣, 𝑢〉]◡ E ) = [〈(𝑧 +R 𝑣), (𝑤 +R 𝑢)〉]◡ E ) | |
| 4 | addcnsrec 11066 | . 2 ⊢ ((((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R) ∧ (𝑣 ∈ R ∧ 𝑢 ∈ R)) → ([〈(𝑥 +R 𝑧), (𝑦 +R 𝑤)〉]◡ E + [〈𝑣, 𝑢〉]◡ E ) = [〈((𝑥 +R 𝑧) +R 𝑣), ((𝑦 +R 𝑤) +R 𝑢)〉]◡ E ) | |
| 5 | addcnsrec 11066 | . 2 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R)) → ([〈𝑥, 𝑦〉]◡ E + [〈(𝑧 +R 𝑣), (𝑤 +R 𝑢)〉]◡ E ) = [〈(𝑥 +R (𝑧 +R 𝑣)), (𝑦 +R (𝑤 +R 𝑢))〉]◡ E ) | |
| 6 | addclsr 11006 | . . . 4 ⊢ ((𝑥 ∈ R ∧ 𝑧 ∈ R) → (𝑥 +R 𝑧) ∈ R) | |
| 7 | addclsr 11006 | . . . 4 ⊢ ((𝑦 ∈ R ∧ 𝑤 ∈ R) → (𝑦 +R 𝑤) ∈ R) | |
| 8 | 6, 7 | anim12i 614 | . . 3 ⊢ (((𝑥 ∈ R ∧ 𝑧 ∈ R) ∧ (𝑦 ∈ R ∧ 𝑤 ∈ R)) → ((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R)) |
| 9 | 8 | an4s 661 | . 2 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)) → ((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R)) |
| 10 | addclsr 11006 | . . . 4 ⊢ ((𝑧 ∈ R ∧ 𝑣 ∈ R) → (𝑧 +R 𝑣) ∈ R) | |
| 11 | addclsr 11006 | . . . 4 ⊢ ((𝑤 ∈ R ∧ 𝑢 ∈ R) → (𝑤 +R 𝑢) ∈ R) | |
| 12 | 10, 11 | anim12i 614 | . . 3 ⊢ (((𝑧 ∈ R ∧ 𝑣 ∈ R) ∧ (𝑤 ∈ R ∧ 𝑢 ∈ R)) → ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R)) |
| 13 | 12 | an4s 661 | . 2 ⊢ (((𝑧 ∈ R ∧ 𝑤 ∈ R) ∧ (𝑣 ∈ R ∧ 𝑢 ∈ R)) → ((𝑧 +R 𝑣) ∈ R ∧ (𝑤 +R 𝑢) ∈ R)) |
| 14 | addasssr 11011 | . 2 ⊢ ((𝑥 +R 𝑧) +R 𝑣) = (𝑥 +R (𝑧 +R 𝑣)) | |
| 15 | addasssr 11011 | . 2 ⊢ ((𝑦 +R 𝑤) +R 𝑢) = (𝑦 +R (𝑤 +R 𝑢)) | |
| 16 | 1, 2, 3, 4, 5, 9, 13, 14, 15 | ecovass 8773 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = (𝐴 + (𝐵 + 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 E cep 5531 ◡ccnv 5631 (class class class)co 7368 Rcnr 10788 +R cplr 10792 ℂcc 11036 + caddc 11041 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-inf2 9562 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-oadd 8411 df-omul 8412 df-er 8645 df-ec 8647 df-qs 8651 df-ni 10795 df-pli 10796 df-mi 10797 df-lti 10798 df-plpq 10831 df-mpq 10832 df-ltpq 10833 df-enq 10834 df-nq 10835 df-erq 10836 df-plq 10837 df-mq 10838 df-1nq 10839 df-rq 10840 df-ltnq 10841 df-np 10904 df-plp 10906 df-ltp 10908 df-enr 10978 df-nr 10979 df-plr 10980 df-c 11044 df-add 11049 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |