Theorem axmulcl 7867

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 7911 be used later. Instead, in most cases use mulcl 7940. (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 4644	. . . . 5 ⊢ (𝐴 ∈ (R × R) → ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)))
2		df-c 7819	. . . . 5 ⊢ ℂ = (R × R)
3	1, 2	eleq2s 2272	. . . 4 ⊢ (𝐴 ∈ ℂ → ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)))
4		elxpi 4644	. . . . 5 ⊢ (𝐵 ∈ (R × R) → ∃𝑧∃𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)))
5	4, 2	eleq2s 2272	. . . 4 ⊢ (𝐵 ∈ ℂ → ∃𝑧∃𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R)))
6	3, 5	anim12i 338	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ ∃𝑧∃𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))))
7		ee4anv 1934	. . 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 5895	. . . . . 6 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝐴 · 𝐵) = (⟨𝑥, 𝑦⟩ · ⟨𝑧, 𝑤⟩))
12		mulcnsr 7836	. . . . . . 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 2210	. . . . 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 7755	. . . . . . . . 9 ⊢ ((𝑥 ∈ R ∧ 𝑧 ∈ R) → (𝑥 ·R 𝑧) ∈ R)
18	15, 16, 17	syl2anc 411	. . . . . . . 8 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝑥 ·R 𝑧) ∈ R)
19		m1r 7753	. . . . . . . . . 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 7755	. . . . . . . . . 10 ⊢ ((𝑦 ∈ R ∧ 𝑤 ∈ R) → (𝑦 ·R 𝑤) ∈ R)
24	21, 22, 23	syl2anc 411	. . . . . . . . 9 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝑦 ·R 𝑤) ∈ R)
25		mulclsr 7755	. . . . . . . . 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 7754	. . . . . . . 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 7755	. . . . . . . . 9 ⊢ ((𝑦 ∈ R ∧ 𝑧 ∈ R) → (𝑦 ·R 𝑧) ∈ R)
30	21, 16, 29	syl2anc 411	. . . . . . . 8 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝑦 ·R 𝑧) ∈ R)
31		mulclsr 7755	. . . . . . . . 9 ⊢ ((𝑥 ∈ R ∧ 𝑤 ∈ R) → (𝑥 ·R 𝑤) ∈ R)
32	15, 22, 31	syl2anc 411	. . . . . . . 8 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝑥 ·R 𝑤) ∈ R)
33		addclsr 7754	. . . . . . . 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 4660	. . . . . . 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 2271	. . . . 5 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → ⟨((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))), ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤))⟩ ∈ ℂ)
38	14, 37	eqeltrd 2254	. . . 4 ⊢ (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝐴 · 𝐵) ∈ ℂ)
39	38	exlimivv 1896	. . 3 ⊢ (∃𝑧∃𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝐴 · 𝐵) ∈ ℂ)
40	39	exlimivv 1896	. 2 ⊢ (∃𝑥∃𝑦∃𝑧∃𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ R ∧ 𝑤 ∈ R))) → (𝐴 · 𝐵) ∈ ℂ)
41	8, 40	syl 14	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) ∈ ℂ)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1353  ∃wex 1492   ∈ wcel 2148  ⟨cop 3597   × cxp 4626  (class class class)co 5877  Rcnr 7298  -1_Rcm1r 7301   +_R cplr 7302   ·_R cmr 7303  ℂcc 7811   · cmul 7818

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-iinf 4589

This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-tr 4104  df-eprel 4291  df-id 4295  df-po 4298  df-iso 4299  df-iord 4368  df-on 4370  df-suc 4373  df-iom 4592  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-ov 5880  df-oprab 5881  df-mpo 5882  df-1st 6143  df-2nd 6144  df-recs 6308  df-irdg 6373  df-1o 6419  df-2o 6420  df-oadd 6423  df-omul 6424  df-er 6537  df-ec 6539  df-qs 6543  df-ni 7305  df-pli 7306  df-mi 7307  df-lti 7308  df-plpq 7345  df-mpq 7346  df-enq 7348  df-nqqs 7349  df-plqqs 7350  df-mqqs 7351  df-1nqqs 7352  df-rq 7353  df-ltnqqs 7354  df-enq0 7425  df-nq0 7426  df-0nq0 7427  df-plq0 7428  df-mq0 7429  df-inp 7467  df-i1p 7468  df-iplp 7469  df-imp 7470  df-enr 7727  df-nr 7728  df-plr 7729  df-mr 7730  df-m1r 7734  df-c 7819  df-mul 7825

This theorem is referenced by:  axmulf  7870