| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mulpqf | 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 |
|---|---|
| mulpqf | ⊢ ·pQ :((N × N) × (N × N))⟶(N × N) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xp1st 8066 | . . . . 5 ⊢ (𝑥 ∈ (N × N) → (1st ‘𝑥) ∈ N) | |
| 2 | xp1st 8066 | . . . . 5 ⊢ (𝑦 ∈ (N × N) → (1st ‘𝑦) ∈ N) | |
| 3 | mulclpi 11016 | . . . . 5 ⊢ (((1st ‘𝑥) ∈ N ∧ (1st ‘𝑦) ∈ N) → ((1st ‘𝑥) ·N (1st ‘𝑦)) ∈ N) | |
| 4 | 1, 2, 3 | syl2an 608 | . . . 4 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → ((1st ‘𝑥) ·N (1st ‘𝑦)) ∈ N) |
| 5 | xp2nd 8067 | . . . . 5 ⊢ (𝑥 ∈ (N × N) → (2nd ‘𝑥) ∈ N) | |
| 6 | xp2nd 8067 | . . . . 5 ⊢ (𝑦 ∈ (N × N) → (2nd ‘𝑦) ∈ N) | |
| 7 | mulclpi 11016 | . . . . 5 ⊢ (((2nd ‘𝑥) ∈ N ∧ (2nd ‘𝑦) ∈ N) → ((2nd ‘𝑥) ·N (2nd ‘𝑦)) ∈ N) | |
| 8 | 5, 6, 7 | syl2an 608 | . . . 4 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → ((2nd ‘𝑥) ·N (2nd ‘𝑦)) ∈ N) |
| 9 | 4, 8 | opelxpd 5696 | . . 3 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → 〈((1st ‘𝑥) ·N (1st ‘𝑦)), ((2nd ‘𝑥) ·N (2nd ‘𝑦))〉 ∈ (N × N)) |
| 10 | 9 | rgen2 3209 | . 2 ⊢ ∀𝑥 ∈ (N × N)∀𝑦 ∈ (N × N)〈((1st ‘𝑥) ·N (1st ‘𝑦)), ((2nd ‘𝑥) ·N (2nd ‘𝑦))〉 ∈ (N × N) |
| 11 | df-mpq 11032 | . . 3 ⊢ ·pQ = (𝑥 ∈ (N × N), 𝑦 ∈ (N × N) ↦ 〈((1st ‘𝑥) ·N (1st ‘𝑦)), ((2nd ‘𝑥) ·N (2nd ‘𝑦))〉) | |
| 12 | 11 | fmpo 8113 | . 2 ⊢ (∀𝑥 ∈ (N × N)∀𝑦 ∈ (N × N)〈((1st ‘𝑥) ·N (1st ‘𝑦)), ((2nd ‘𝑥) ·N (2nd ‘𝑦))〉 ∈ (N × N) ↔ ·pQ :((N × N) × (N × N))⟶(N × N)) |
| 13 | 10, 12 | mpbi 233 | 1 ⊢ ·pQ :((N × N) × (N × N))⟶(N × N) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 ∈ wcel 2150 ∀wral 3083 〈cop 4839 × cxp 5655 ⟶wf 6561 ‘cfv 6565 (class class class)co 7450 1st c1st 8032 2nd c2nd 8033 Ncnpi 10967 ·N cmi 10969 ·pQ cmpq 10972 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pr 5397 ax-un 7782 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-oadd 8517 df-omul 8518 df-ni 10995 df-mi 10997 df-mpq 11032 |
| This theorem is used by: mulclnq 11070 mulnqf 11072 mulcompq 11075 mulerpq 11080 distrnq 11084 |
| Copyright terms: Public domain | W3C validator |