Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mulnqf | Structured version Visualization version GIF version |
Description: Domain of multiplication on positive fractions. (Contributed by NM, 24-Aug-1995.) (Revised by Mario Carneiro, 10-Jul-2014.) (New usage is discouraged.) |
Ref | Expression |
---|---|
mulnqf | ⊢ ·Q :(Q × Q)⟶Q |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nqerf 10686 | . . . 4 ⊢ [Q]:(N × N)⟶Q | |
2 | mulpqf 10702 | . . . 4 ⊢ ·pQ :((N × N) × (N × N))⟶(N × N) | |
3 | fco 6624 | . . . 4 ⊢ (([Q]:(N × N)⟶Q ∧ ·pQ :((N × N) × (N × N))⟶(N × N)) → ([Q] ∘ ·pQ ):((N × N) × (N × N))⟶Q) | |
4 | 1, 2, 3 | mp2an 689 | . . 3 ⊢ ([Q] ∘ ·pQ ):((N × N) × (N × N))⟶Q |
5 | elpqn 10681 | . . . . 5 ⊢ (𝑥 ∈ Q → 𝑥 ∈ (N × N)) | |
6 | 5 | ssriv 3925 | . . . 4 ⊢ Q ⊆ (N × N) |
7 | xpss12 5604 | . . . 4 ⊢ ((Q ⊆ (N × N) ∧ Q ⊆ (N × N)) → (Q × Q) ⊆ ((N × N) × (N × N))) | |
8 | 6, 6, 7 | mp2an 689 | . . 3 ⊢ (Q × Q) ⊆ ((N × N) × (N × N)) |
9 | fssres 6640 | . . 3 ⊢ ((([Q] ∘ ·pQ ):((N × N) × (N × N))⟶Q ∧ (Q × Q) ⊆ ((N × N) × (N × N))) → (([Q] ∘ ·pQ ) ↾ (Q × Q)):(Q × Q)⟶Q) | |
10 | 4, 8, 9 | mp2an 689 | . 2 ⊢ (([Q] ∘ ·pQ ) ↾ (Q × Q)):(Q × Q)⟶Q |
11 | df-mq 10671 | . . 3 ⊢ ·Q = (([Q] ∘ ·pQ ) ↾ (Q × Q)) | |
12 | 11 | feq1i 6591 | . 2 ⊢ ( ·Q :(Q × Q)⟶Q ↔ (([Q] ∘ ·pQ ) ↾ (Q × Q)):(Q × Q)⟶Q) |
13 | 10, 12 | mpbir 230 | 1 ⊢ ·Q :(Q × Q)⟶Q |
Colors of variables: wff setvar class |
Syntax hints: ⊆ wss 3887 × cxp 5587 ↾ cres 5591 ∘ ccom 5593 ⟶wf 6429 Ncnpi 10600 ·pQ cmpq 10605 Qcnq 10608 [Q]cerq 10610 ·Q cmq 10612 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-oadd 8301 df-omul 8302 df-er 8498 df-ni 10628 df-mi 10630 df-lti 10631 df-mpq 10665 df-enq 10667 df-nq 10668 df-erq 10669 df-mq 10671 df-1nq 10672 |
This theorem is referenced by: mulcomnq 10709 mulerpq 10713 mulassnq 10715 distrnq 10717 recmulnq 10720 recclnq 10722 dmrecnq 10724 ltmnq 10728 prlem936 10803 |
Copyright terms: Public domain | W3C validator |