Theorem axaddcl 7599

Description: Closure law for addition of complex numbers. 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-addcl 7641 be used later. Instead, in most cases use addcl 7669. (Contributed by NM, 14-Jun-1995.) (New usage is discouraged.)

Assertion

Ref	Expression
axaddcl	⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ)

Proof of Theorem axaddcl

Dummy variables 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elxpi 4515	. . . . 5 ⊢ (𝐴 ∈ (R × R) → ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)))
2		df-c 7553	. . . . 5 ⊢ ℂ = (R × R)
3	1, 2	eleq2s 2209	. . . 4 ⊢ (𝐴 ∈ ℂ → ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)))
4		elxpi 4515	. . . . 5 ⊢ (𝐵 ∈ (R × R) → ∃𝑧∃𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)))
5	4, 2	eleq2s 2209	. . . 4 ⊢ (𝐵 ∈ ℂ → ∃𝑧∃𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)))
6	3, 5	anim12i 334	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ ∃𝑧∃𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))))
7		ee4anv 1884	. . 3 ⊢ (∃𝑥∃𝑦∃𝑧∃𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) ↔ (∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ ∃𝑧∃𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))))
8	6, 7	sylibr 133	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ∃𝑥∃𝑦∃𝑧∃𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))))
9		simpll 501	. . . . . . 7 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → 𝐴 = ⟨𝑥, 𝑦⟩)
10		simprl 503	. . . . . . 7 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → 𝐵 = ⟨𝑧, 𝑤⟩)
11	9, 10	oveq12d 5746	. . . . . 6 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝐴 + 𝐵) = (⟨𝑥, 𝑦⟩ + ⟨𝑧, 𝑤⟩))
12		addcnsr 7569	. . . . . . 7 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)) → (⟨𝑥, 𝑦⟩ + ⟨𝑧, 𝑤⟩) = ⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩)
13	12	ad2ant2l 497	. . . . . 6 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (⟨𝑥, 𝑦⟩ + ⟨𝑧, 𝑤⟩) = ⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩)
14	11, 13	eqtrd 2147	. . . . 5 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝐴 + 𝐵) = ⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩)
15		addclsr 7496	. . . . . . . . 9 ⊢ ((𝑥 ∈ R ∧ 𝑧 ∈ R) → (𝑥 +R 𝑧) ∈ R)
16	15	ad2ant2r 498	. . . . . . . 8 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)) → (𝑥 +R 𝑧) ∈ R)
17		addclsr 7496	. . . . . . . . 9 ⊢ ((𝑦 ∈ R ∧ 𝑤 ∈ R) → (𝑦 +R 𝑤) ∈ R)
18	17	ad2ant2l 497	. . . . . . . 8 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)) → (𝑦 +R 𝑤) ∈ R)
19		opelxpi 4531	. . . . . . . 8 ⊢ (((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R) → ⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩ ∈ (R × R))
20	16, 18, 19	syl2anc 406	. . . . . . 7 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)) → ⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩ ∈ (R × R))
21	20, 2	syl6eleqr 2208	. . . . . 6 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)) → ⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩ ∈ ℂ)
22	21	ad2ant2l 497	. . . . 5 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → ⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩ ∈ ℂ)
23	14, 22	eqeltrd 2191	. . . 4 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝐴 + 𝐵) ∈ ℂ)
24	23	exlimivv 1850	. . 3 ⊢ (∃𝑧∃𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝐴 + 𝐵) ∈ ℂ)
25	24	exlimivv 1850	. 2 ⊢ (∃𝑥∃𝑦∃𝑧∃𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝐴 + 𝐵) ∈ ℂ)
26	8, 25	syl 14	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ)

Syntax hints:   → wi 4   ∧ wa 103   = wceq 1314  ∃wex 1451   ∈ wcel 1463  ⟨cop 3496   × cxp 4497  (class class class)co 5728  Rcnr 7053   +_R cplr 7057  ℂcc 7545   + caddc 7550

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-13 1474  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-coll 4003  ax-sep 4006  ax-nul 4014  ax-pow 4058  ax-pr 4091  ax-un 4315  ax-setind 4412  ax-iinf 4462

This theorem depends on definitions:  df-bi 116  df-dc 803  df-3or 946  df-3an 947  df-tru 1317  df-fal 1320  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2244  df-ne 2283  df-ral 2395  df-rex 2396  df-reu 2397  df-rab 2399  df-v 2659  df-sbc 2879  df-csb 2972  df-dif 3039  df-un 3041  df-in 3043  df-ss 3050  df-nul 3330  df-pw 3478  df-sn 3499  df-pr 3500  df-op 3502  df-uni 3703  df-int 3738  df-iun 3781  df-br 3896  df-opab 3950  df-mpt 3951  df-tr 3987  df-eprel 4171  df-id 4175  df-po 4178  df-iso 4179  df-iord 4248  df-on 4250  df-suc 4253  df-iom 4465  df-xp 4505  df-rel 4506  df-cnv 4507  df-co 4508  df-dm 4509  df-rn 4510  df-res 4511  df-ima 4512  df-iota 5046  df-fun 5083  df-fn 5084  df-f 5085  df-f1 5086  df-fo 5087  df-f1o 5088  df-fv 5089  df-ov 5731  df-oprab 5732  df-mpo 5733  df-1st 5992  df-2nd 5993  df-recs 6156  df-irdg 6221  df-1o 6267  df-2o 6268  df-oadd 6271  df-omul 6272  df-er 6383  df-ec 6385  df-qs 6389  df-ni 7060  df-pli 7061  df-mi 7062  df-lti 7063  df-plpq 7100  df-mpq 7101  df-enq 7103  df-nqqs 7104  df-plqqs 7105  df-mqqs 7106  df-1nqqs 7107  df-rq 7108  df-ltnqqs 7109  df-enq0 7180  df-nq0 7181  df-0nq0 7182  df-plq0 7183  df-mq0 7184  df-inp 7222  df-iplp 7224  df-enr 7469  df-nr 7470  df-plr 7471  df-c 7553  df-add 7558

This theorem is referenced by:  axaddf  7603