Theorem axmulcl 8021

Description: Closure law for multiplication 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-mulcl 8065 be used later. Instead, in most cases use mulcl 8094. (Contributed by NM, 10-Aug-1995.) (New usage is discouraged.)

Assertion

Ref	Expression
axmulcl	⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) ∈ ℂ)

Proof of Theorem axmulcl

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

Step	Hyp	Ref	Expression
1		elxpi 4712	. . . . 5 ⊢ (𝐴 ∈ (R × R) → ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)))
2		df-c 7973	. . . . 5 ⊢ ℂ = (R × R)
3	1, 2	eleq2s 2304	. . . 4 ⊢ (𝐴 ∈ ℂ → ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)))
4		elxpi 4712	. . . . 5 ⊢ (𝐵 ∈ (R × R) → ∃𝑧∃𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)))
5	4, 2	eleq2s 2304	. . . 4 ⊢ (𝐵 ∈ ℂ → ∃𝑧∃𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)))
6	3, 5	anim12i 338	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ ∃𝑧∃𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))))
7		ee4anv 1965	. . 3 ⊢ (∃𝑥∃𝑦∃𝑧∃𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) ↔ (∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ ∃𝑧∃𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))))
8	6, 7	sylibr 134	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ∃𝑥∃𝑦∃𝑧∃𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))))
9		simpll 527	. . . . . . 7 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → 𝐴 = ⟨𝑥, 𝑦⟩)
10		simprl 529	. . . . . . 7 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → 𝐵 = ⟨𝑧, 𝑤⟩)
11	9, 10	oveq12d 5992	. . . . . 6 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝐴 · 𝐵) = (⟨𝑥, 𝑦⟩ · ⟨𝑧, 𝑤⟩))
12		mulcnsr 7990	. . . . . . 7 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)) → (⟨𝑥, 𝑦⟩ · ⟨𝑧, 𝑤⟩) = ⟨((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))), ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤))⟩)
13	12	ad2ant2l 508	. . . . . 6 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (⟨𝑥, 𝑦⟩ · ⟨𝑧, 𝑤⟩) = ⟨((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))), ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤))⟩)
14	11, 13	eqtrd 2242	. . . . 5 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝐴 · 𝐵) = ⟨((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))), ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤))⟩)
15		simplrl 535	. . . . . . . . 9 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → 𝑥 ∈ R)
16		simprrl 539	. . . . . . . . 9 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → 𝑧 ∈ R)
17		mulclsr 7909	. . . . . . . . 9 ⊢ ((𝑥 ∈ R ∧ 𝑧 ∈ R) → (𝑥 ·R 𝑧) ∈ R)
18	15, 16, 17	syl2anc 411	. . . . . . . 8 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝑥 ·R 𝑧) ∈ R)
19		m1r 7907	. . . . . . . . . 10 ⊢ -1R ∈ R
20	19	a1i 9	. . . . . . . . 9 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → -1R ∈ R)
21		simplrr 536	. . . . . . . . . 10 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → 𝑦 ∈ R)
22		simprrr 540	. . . . . . . . . 10 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → 𝑤 ∈ R)
23		mulclsr 7909	. . . . . . . . . 10 ⊢ ((𝑦 ∈ R ∧ 𝑤 ∈ R) → (𝑦 ·R 𝑤) ∈ R)
24	21, 22, 23	syl2anc 411	. . . . . . . . 9 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝑦 ·R 𝑤) ∈ R)
25		mulclsr 7909	. . . . . . . . 9 ⊢ ((-1R ∈ R ∧ (𝑦 ·R 𝑤) ∈ R) → (-1R ·R (𝑦 ·R 𝑤)) ∈ R)
26	20, 24, 25	syl2anc 411	. . . . . . . 8 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (-1R ·R (𝑦 ·R 𝑤)) ∈ R)
27		addclsr 7908	. . . . . . . 8 ⊢ (((𝑥 ·R 𝑧) ∈ R ∧ (-1R ·R (𝑦 ·R 𝑤)) ∈ R) → ((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))) ∈ R)
28	18, 26, 27	syl2anc 411	. . . . . . 7 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → ((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))) ∈ R)
29		mulclsr 7909	. . . . . . . . 9 ⊢ ((𝑦 ∈ R ∧ 𝑧 ∈ R) → (𝑦 ·R 𝑧) ∈ R)
30	21, 16, 29	syl2anc 411	. . . . . . . 8 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝑦 ·R 𝑧) ∈ R)
31		mulclsr 7909	. . . . . . . . 9 ⊢ ((𝑥 ∈ R ∧ 𝑤 ∈ R) → (𝑥 ·R 𝑤) ∈ R)
32	15, 22, 31	syl2anc 411	. . . . . . . 8 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝑥 ·R 𝑤) ∈ R)
33		addclsr 7908	. . . . . . . 8 ⊢ (((𝑦 ·R 𝑧) ∈ R ∧ (𝑥 ·R 𝑤) ∈ R) → ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤)) ∈ R)
34	30, 32, 33	syl2anc 411	. . . . . . 7 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤)) ∈ R)
35		opelxpi 4728	. . . . . . 7 ⊢ ((((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))) ∈ R ∧ ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤)) ∈ R) → ⟨((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))), ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤))⟩ ∈ (R × R))
36	28, 34, 35	syl2anc 411	. . . . . 6 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → ⟨((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))), ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤))⟩ ∈ (R × R))
37	36, 2	eleqtrrdi 2303	. . . . 5 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → ⟨((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))), ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤))⟩ ∈ ℂ)
38	14, 37	eqeltrd 2286	. . . 4 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝐴 · 𝐵) ∈ ℂ)
39	38	exlimivv 1923	. . 3 ⊢ (∃𝑧∃𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝐴 · 𝐵) ∈ ℂ)
40	39	exlimivv 1923	. 2 ⊢ (∃𝑥∃𝑦∃𝑧∃𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝐴 · 𝐵) ∈ ℂ)
41	8, 40	syl 14	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) ∈ ℂ)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1375  ∃wex 1518   ∈ wcel 2180  ⟨cop 3649   × cxp 4694  (class class class)co 5974  Rcnr 7452  -1_Rcm1r 7455   +_R cplr 7456   ·_R cmr 7457  ℂcc 7965   · cmul 7972

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 713  ax-5 1473  ax-7 1474  ax-gen 1475  ax-ie1 1519  ax-ie2 1520  ax-8 1530  ax-10 1531  ax-11 1532  ax-i12 1533  ax-bndl 1535  ax-4 1536  ax-17 1552  ax-i9 1556  ax-ial 1560  ax-i5r 1561  ax-13 2182  ax-14 2183  ax-ext 2191  ax-coll 4178  ax-sep 4181  ax-nul 4189  ax-pow 4237  ax-pr 4272  ax-un 4501  ax-setind 4606  ax-iinf 4657

This theorem depends on definitions:  df-bi 117  df-dc 839  df-3or 984  df-3an 985  df-tru 1378  df-fal 1381  df-nf 1487  df-sb 1789  df-eu 2060  df-mo 2061  df-clab 2196  df-cleq 2202  df-clel 2205  df-nfc 2341  df-ne 2381  df-ral 2493  df-rex 2494  df-reu 2495  df-rab 2497  df-v 2781  df-sbc 3009  df-csb 3105  df-dif 3179  df-un 3181  df-in 3183  df-ss 3190  df-nul 3472  df-pw 3631  df-sn 3652  df-pr 3653  df-op 3655  df-uni 3868  df-int 3903  df-iun 3946  df-br 4063  df-opab 4125  df-mpt 4126  df-tr 4162  df-eprel 4357  df-id 4361  df-po 4364  df-iso 4365  df-iord 4434  df-on 4436  df-suc 4439  df-iom 4660  df-xp 4702  df-rel 4703  df-cnv 4704  df-co 4705  df-dm 4706  df-rn 4707  df-res 4708  df-ima 4709  df-iota 5254  df-fun 5296  df-fn 5297  df-f 5298  df-f1 5299  df-fo 5300  df-f1o 5301  df-fv 5302  df-ov 5977  df-oprab 5978  df-mpo 5979  df-1st 6256  df-2nd 6257  df-recs 6421  df-irdg 6486  df-1o 6532  df-2o 6533  df-oadd 6536  df-omul 6537  df-er 6650  df-ec 6652  df-qs 6656  df-ni 7459  df-pli 7460  df-mi 7461  df-lti 7462  df-plpq 7499  df-mpq 7500  df-enq 7502  df-nqqs 7503  df-plqqs 7504  df-mqqs 7505  df-1nqqs 7506  df-rq 7507  df-ltnqqs 7508  df-enq0 7579  df-nq0 7580  df-0nq0 7581  df-plq0 7582  df-mq0 7583  df-inp 7621  df-i1p 7622  df-iplp 7623  df-imp 7624  df-enr 7881  df-nr 7882  df-plr 7883  df-mr 7884  df-m1r 7888  df-c 7973  df-mul 7979

This theorem is referenced by:  axmulf  8024