| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mulclnq | Structured version Visualization version GIF version | ||
| Description: Closure of multiplication on positive fractions. (Contributed by NM, 29-Aug-1995.) (Revised by Mario Carneiro, 8-May-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| mulclnq | ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 ·Q 𝐵) ∈ Q) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mulpqnq 10864 | . 2 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 ·Q 𝐵) = ([Q]‘(𝐴 ·pQ 𝐵))) | |
| 2 | elpqn 10848 | . . . 4 ⊢ (𝐴 ∈ Q → 𝐴 ∈ (N × N)) | |
| 3 | elpqn 10848 | . . . 4 ⊢ (𝐵 ∈ Q → 𝐵 ∈ (N × N)) | |
| 4 | mulpqf 10869 | . . . . 5 ⊢ ·pQ :((N × N) × (N × N))⟶(N × N) | |
| 5 | 4 | fovcl 7495 | . . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) ∈ (N × N)) |
| 6 | 2, 3, 5 | syl2an 597 | . . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 ·pQ 𝐵) ∈ (N × N)) |
| 7 | nqercl 10854 | . . 3 ⊢ ((𝐴 ·pQ 𝐵) ∈ (N × N) → ([Q]‘(𝐴 ·pQ 𝐵)) ∈ Q) | |
| 8 | 6, 7 | syl 17 | . 2 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → ([Q]‘(𝐴 ·pQ 𝐵)) ∈ Q) |
| 9 | 1, 8 | eqeltrd 2836 | 1 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 ·Q 𝐵) ∈ Q) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2114 × cxp 5629 ‘cfv 6498 (class class class)co 7367 Ncnpi 10767 ·pQ cmpq 10772 Qcnq 10775 [Q]cerq 10777 ·Q cmq 10779 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-oadd 8409 df-omul 8410 df-er 8643 df-ni 10795 df-mi 10797 df-lti 10798 df-mpq 10832 df-enq 10834 df-nq 10835 df-erq 10836 df-mq 10838 df-1nq 10839 |
| This theorem is referenced by: ltrnq 10902 mpv 10934 dmmp 10936 mulclprlem 10942 mulclpr 10943 mulasspr 10947 distrlem1pr 10948 distrlem4pr 10949 distrlem5pr 10950 1idpr 10952 prlem934 10956 prlem936 10970 reclem3pr 10972 reclem4pr 10973 |
| Copyright terms: Public domain | W3C validator |