Theorem axmulf 8230

Description: Multiplication is an operation on the complex numbers. This is the construction-dependent version of ax-mulf 8296 and it should not be referenced outside the construction. We generally prefer to develop our theory using the less specific mulcl 8300. (Contributed by NM, 8-Feb-2005.) (New usage is discouraged.)

Assertion

Ref	Expression
axmulf	⊢ · :(ℂ × ℂ)⟶ℂ

Proof of Theorem axmulf

Dummy variables 𝑎 𝑏 𝑥 𝑦 𝑧 𝑤 𝑣 𝑢 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		moeq 3001	. . . . . . . . 9 ⊢ ∃*𝑧 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩
2	1	mosubop 4839	. . . . . . . 8 ⊢ ∃*𝑧∃𝑢∃𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩)
3	2	mosubop 4839	. . . . . . 7 ⊢ ∃*𝑧∃𝑤∃𝑣(𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢∃𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩))
4		anass 405	. . . . . . . . . . 11 ⊢ (((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩) ↔ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ (𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩)))
5	4	2exbii 1659	. . . . . . . . . 10 ⊢ (∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩) ↔ ∃𝑢∃𝑓(𝑥 = ⟨𝑤, 𝑣⟩ ∧ (𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩)))
6		19.42vv 1967	. . . . . . . . . 10 ⊢ (∃𝑢∃𝑓(𝑥 = ⟨𝑤, 𝑣⟩ ∧ (𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩)) ↔ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢∃𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩)))
7	5, 6	bitri 184	. . . . . . . . 9 ⊢ (∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩) ↔ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢∃𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩)))
8	7	2exbii 1659	. . . . . . . 8 ⊢ (∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩) ↔ ∃𝑤∃𝑣(𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢∃𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩)))
9	8	mobii 2123	. . . . . . 7 ⊢ (∃*𝑧∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩) ↔ ∃*𝑧∃𝑤∃𝑣(𝑥 = ⟨𝑤, 𝑣⟩ ∧ ∃𝑢∃𝑓(𝑦 = ⟨𝑢, 𝑓⟩ ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩)))
10	3, 9	mpbir 146	. . . . . 6 ⊢ ∃*𝑧∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩)
11	10	moani 2157	. . . . 5 ⊢ ∃*𝑧((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩))
12	11	funoprab 6182	. . . 4 ⊢ Fun {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩))}
13		df-mul 8185	. . . . 5 ⊢ · = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩))}
14	13	funeqi 5396	. . . 4 ⊢ (Fun · ↔ Fun {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩))})
15	12, 14	mpbir 146	. . 3 ⊢ Fun ·
16	13	dmeqi 4980	. . . . 5 ⊢ dom · = dom {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩))}
17		dmoprabss 6164	. . . . 5 ⊢ dom {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·R 𝑢) +R (-1R ·R (𝑣 ·R 𝑓))), ((𝑣 ·R 𝑢) +R (𝑤 ·R 𝑓))⟩))} ⊆ (ℂ × ℂ)
18	16, 17	eqsstri 3280	. . . 4 ⊢ dom · ⊆ (ℂ × ℂ)
19		cnm 8193	. . . . . . 7 ⊢ (𝑎 ∈ ℂ → ∃𝑏 𝑏 ∈ 𝑎)
20	19	adantl 277	. . . . . 6 ⊢ ((⊤ ∧ 𝑎 ∈ ℂ) → ∃𝑏 𝑏 ∈ 𝑎)
21		axmulcl 8227	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) ∈ ℂ)
22	21	adantl 277	. . . . . 6 ⊢ ((⊤ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → (𝑥 · 𝑦) ∈ ℂ)
23		funrel 5392	. . . . . . 7 ⊢ (Fun · → Rel · )
24	15, 23	mp1i 10	. . . . . 6 ⊢ (⊤ → Rel · )
25	20, 22, 24	oprssdmm 6399	. . . . 5 ⊢ (⊤ → (ℂ × ℂ) ⊆ dom · )
26	25	mptru 1411	. . . 4 ⊢ (ℂ × ℂ) ⊆ dom ·
27	18, 26	eqssi 3264	. . 3 ⊢ dom · = (ℂ × ℂ)
28		df-fn 5378	. . 3 ⊢ ( · Fn (ℂ × ℂ) ↔ (Fun · ∧ dom · = (ℂ × ℂ)))
29	15, 27, 28	mpbir2an 955	. 2 ⊢ · Fn (ℂ × ℂ)
30	21	rgen2a 2604	. 2 ⊢ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℂ (𝑥 · 𝑦) ∈ ℂ
31		ffnov 6186	. 2 ⊢ ( · :(ℂ × ℂ)⟶ℂ ↔ ( · Fn (ℂ × ℂ) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℂ (𝑥 · 𝑦) ∈ ℂ))
32	29, 30, 31	mpbir2an 955	1 ⊢ · :(ℂ × ℂ)⟶ℂ

Syntax hints:   ∧ wa 104   = wceq 1402  ⊤wtru 1403  ∃wex 1545  ∃*wmo 2087   ∈ wcel 2209  ∀wral 2528   ⊆ wss 3220  ⟨cop 3711   × cxp 4770  dom cdm 4772  Rel wrel 4777  Fun wfun 5369   Fn wfn 5370  ⟶wf 5371  (class class class)co 6079  {coprab 6080  -1_Rcm1r 7661   +_R cplr 7662   ·_R cmr 7663  ℂcc 8171   · cmul 8178

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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4244  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-iinf 4733

This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-tr 4228  df-eprel 4432  df-id 4436  df-po 4439  df-iso 4440  df-iord 4509  df-on 4511  df-suc 4514  df-iom 4736  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-recs 6570  df-irdg 6635  df-1o 6681  df-2o 6682  df-oadd 6685  df-omul 6686  df-er 6801  df-ec 6803  df-qs 6807  df-ni 7665  df-pli 7666  df-mi 7667  df-lti 7668  df-plpq 7705  df-mpq 7706  df-enq 7708  df-nqqs 7709  df-plqqs 7710  df-mqqs 7711  df-1nqqs 7712  df-rq 7713  df-ltnqqs 7714  df-enq0 7785  df-nq0 7786  df-0nq0 7787  df-plq0 7788  df-mq0 7789  df-inp 7827  df-i1p 7828  df-iplp 7829  df-imp 7830  df-enr 8087  df-nr 8088  df-plr 8089  df-mr 8090  df-m1r 8094  df-c 8179  df-mul 8185

This theorem is referenced by: (None)