| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > axmulrcl | Structured version Visualization version GIF version | ||
| Description: Closure law for multiplication in the real subfield of complex numbers. Axiom 7 of 22 for real and complex numbers, derived from ZF set theory. This construction-dependent theorem should not be referenced directly, nor should the proven axiom ax-mulrcl 11191 be used later. Instead, in most cases use remulcl 11213. (New usage is discouraged.) (Contributed by NM, 31-Mar-1996.) |
| Ref | Expression |
|---|---|
| axmulrcl | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 · 𝐵) ∈ ℝ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elreal 11144 | . 2 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴) | |
| 2 | elreal 11144 | . 2 ⊢ (𝐵 ∈ ℝ ↔ ∃𝑦 ∈ R 〈𝑦, 0R〉 = 𝐵) | |
| 3 | oveq1 7424 | . . 3 ⊢ (〈𝑥, 0R〉 = 𝐴 → (〈𝑥, 0R〉 · 〈𝑦, 0R〉) = (𝐴 · 〈𝑦, 0R〉)) | |
| 4 | 3 | eleq1d 2847 | . 2 ⊢ (〈𝑥, 0R〉 = 𝐴 → ((〈𝑥, 0R〉 · 〈𝑦, 0R〉) ∈ ℝ ↔ (𝐴 · 〈𝑦, 0R〉) ∈ ℝ)) |
| 5 | oveq2 7425 | . . 3 ⊢ (〈𝑦, 0R〉 = 𝐵 → (𝐴 · 〈𝑦, 0R〉) = (𝐴 · 𝐵)) | |
| 6 | 5 | eleq1d 2847 | . 2 ⊢ (〈𝑦, 0R〉 = 𝐵 → ((𝐴 · 〈𝑦, 0R〉) ∈ ℝ ↔ (𝐴 · 𝐵) ∈ ℝ)) |
| 7 | mulresr 11152 | . . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (〈𝑥, 0R〉 · 〈𝑦, 0R〉) = 〈(𝑥 ·R 𝑦), 0R〉) | |
| 8 | mulclsr 11097 | . . . 4 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (𝑥 ·R 𝑦) ∈ R) | |
| 9 | opelreal 11143 | . . . 4 ⊢ (〈(𝑥 ·R 𝑦), 0R〉 ∈ ℝ ↔ (𝑥 ·R 𝑦) ∈ R) | |
| 10 | 8, 9 | sylibr 237 | . . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → 〈(𝑥 ·R 𝑦), 0R〉 ∈ ℝ) |
| 11 | 7, 10 | eqeltrd 2862 | . 2 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (〈𝑥, 0R〉 · 〈𝑦, 0R〉) ∈ ℝ) |
| 12 | 1, 2, 4, 6, 11 | 2gencl 3495 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 · 𝐵) ∈ ℝ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 〈cop 4593 (class class class)co 7417 Rcnr 10878 0Rc0r 10879 ·R cmr 10883 ℝcr 11127 · cmul 11133 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-inf2 9624 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-oadd 8463 df-omul 8464 df-er 8700 df-ec 8702 df-qs 8706 df-ni 10885 df-pli 10886 df-mi 10887 df-lti 10888 df-plpq 10921 df-mpq 10922 df-ltpq 10923 df-enq 10924 df-nq 10925 df-erq 10926 df-plq 10927 df-mq 10928 df-1nq 10929 df-rq 10930 df-ltnq 10931 df-np 10994 df-1p 10995 df-plp 10996 df-mp 10997 df-ltp 10998 df-enr 11068 df-nr 11069 df-plr 11070 df-mr 11071 df-0r 11073 df-m1r 11075 df-c 11134 df-r 11138 df-mul 11140 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |