ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  axmulcl GIF version

Theorem axmulcl 8197
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 8241 be used later. Instead, in most cases use mulcl 8270. (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.
StepHypRef Expression
1 elxpi 4770 . . . . 5 (𝐴 ∈ (R × R) → ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)))
2 df-c 8149 . . . . 5 ℂ = (R × R)
31, 2eleq2s 2329 . . . 4 (𝐴 ∈ ℂ → ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)))
4 elxpi 4770 . . . . 5 (𝐵 ∈ (R × R) → ∃𝑧𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R)))
54, 2eleq2s 2329 . . . 4 (𝐵 ∈ ℂ → ∃𝑧𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R)))
63, 5anim12i 338 . . 3 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ ∃𝑧𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))))
7 ee4anv 1990 . . 3 (∃𝑥𝑦𝑧𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) ↔ (∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ ∃𝑧𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))))
86, 7sylibr 134 . 2 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ∃𝑥𝑦𝑧𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))))
9 simpll 527 . . . . . . 7 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → 𝐴 = ⟨𝑥, 𝑦⟩)
10 simprl 531 . . . . . . 7 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → 𝐵 = ⟨𝑧, 𝑤⟩)
119, 10oveq12d 6076 . . . . . 6 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (𝐴 · 𝐵) = (⟨𝑥, 𝑦⟩ · ⟨𝑧, 𝑤⟩))
12 mulcnsr 8166 . . . . . . 7 (((𝑥R𝑦R) ∧ (𝑧R𝑤R)) → (⟨𝑥, 𝑦⟩ · ⟨𝑧, 𝑤⟩) = ⟨((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))), ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤))⟩)
1312ad2ant2l 508 . . . . . 6 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (⟨𝑥, 𝑦⟩ · ⟨𝑧, 𝑤⟩) = ⟨((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))), ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤))⟩)
1411, 13eqtrd 2267 . . . . 5 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (𝐴 · 𝐵) = ⟨((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))), ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤))⟩)
15 simplrl 537 . . . . . . . . 9 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → 𝑥R)
16 simprrl 541 . . . . . . . . 9 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → 𝑧R)
17 mulclsr 8085 . . . . . . . . 9 ((𝑥R𝑧R) → (𝑥 ·R 𝑧) ∈ R)
1815, 16, 17syl2anc 411 . . . . . . . 8 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (𝑥 ·R 𝑧) ∈ R)
19 m1r 8083 . . . . . . . . . 10 -1RR
2019a1i 9 . . . . . . . . 9 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → -1RR)
21 simplrr 538 . . . . . . . . . 10 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → 𝑦R)
22 simprrr 542 . . . . . . . . . 10 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → 𝑤R)
23 mulclsr 8085 . . . . . . . . . 10 ((𝑦R𝑤R) → (𝑦 ·R 𝑤) ∈ R)
2421, 22, 23syl2anc 411 . . . . . . . . 9 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (𝑦 ·R 𝑤) ∈ R)
25 mulclsr 8085 . . . . . . . . 9 ((-1RR ∧ (𝑦 ·R 𝑤) ∈ R) → (-1R ·R (𝑦 ·R 𝑤)) ∈ R)
2620, 24, 25syl2anc 411 . . . . . . . 8 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (-1R ·R (𝑦 ·R 𝑤)) ∈ R)
27 addclsr 8084 . . . . . . . 8 (((𝑥 ·R 𝑧) ∈ R ∧ (-1R ·R (𝑦 ·R 𝑤)) ∈ R) → ((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))) ∈ R)
2818, 26, 27syl2anc 411 . . . . . . 7 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → ((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))) ∈ R)
29 mulclsr 8085 . . . . . . . . 9 ((𝑦R𝑧R) → (𝑦 ·R 𝑧) ∈ R)
3021, 16, 29syl2anc 411 . . . . . . . 8 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (𝑦 ·R 𝑧) ∈ R)
31 mulclsr 8085 . . . . . . . . 9 ((𝑥R𝑤R) → (𝑥 ·R 𝑤) ∈ R)
3215, 22, 31syl2anc 411 . . . . . . . 8 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (𝑥 ·R 𝑤) ∈ R)
33 addclsr 8084 . . . . . . . 8 (((𝑦 ·R 𝑧) ∈ R ∧ (𝑥 ·R 𝑤) ∈ R) → ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤)) ∈ R)
3430, 32, 33syl2anc 411 . . . . . . 7 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤)) ∈ R)
35 opelxpi 4786 . . . . . . 7 ((((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))) ∈ R ∧ ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤)) ∈ R) → ⟨((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))), ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤))⟩ ∈ (R × R))
3628, 34, 35syl2anc 411 . . . . . 6 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → ⟨((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))), ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤))⟩ ∈ (R × R))
3736, 2eleqtrrdi 2328 . . . . 5 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → ⟨((𝑥 ·R 𝑧) +R (-1R ·R (𝑦 ·R 𝑤))), ((𝑦 ·R 𝑧) +R (𝑥 ·R 𝑤))⟩ ∈ ℂ)
3814, 37eqeltrd 2311 . . . 4 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (𝐴 · 𝐵) ∈ ℂ)
3938exlimivv 1948 . . 3 (∃𝑧𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (𝐴 · 𝐵) ∈ ℂ)
4039exlimivv 1948 . 2 (∃𝑥𝑦𝑧𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (𝐴 · 𝐵) ∈ ℂ)
418, 40syl 14 1 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) ∈ ℂ)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wex 1541  wcel 2205  cop 3697   × cxp 4752  (class class class)co 6058  Rcnr 7628  -1Rcm1r 7631   +R cplr 7632   ·R cmr 7633  cc 8141   · cmul 8148
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-eprel 4415  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-irdg 6614  df-1o 6660  df-2o 6661  df-oadd 6664  df-omul 6665  df-er 6780  df-ec 6782  df-qs 6786  df-ni 7635  df-pli 7636  df-mi 7637  df-lti 7638  df-plpq 7675  df-mpq 7676  df-enq 7678  df-nqqs 7679  df-plqqs 7680  df-mqqs 7681  df-1nqqs 7682  df-rq 7683  df-ltnqqs 7684  df-enq0 7755  df-nq0 7756  df-0nq0 7757  df-plq0 7758  df-mq0 7759  df-inp 7797  df-i1p 7798  df-iplp 7799  df-imp 7800  df-enr 8057  df-nr 8058  df-plr 8059  df-mr 8060  df-m1r 8064  df-c 8149  df-mul 8155
This theorem is referenced by:  axmulf  8200
  Copyright terms: Public domain W3C validator