| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > addnqf | Structured version Visualization version GIF version | ||
| Description: Domain of addition on positive fractions. (Contributed by NM, 24-Aug-1995.) (Revised by Mario Carneiro, 10-Jul-2014.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| addnqf | ⊢ +Q :(Q × Q)⟶Q |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nqerf 10916 | . . . 4 ⊢ [Q]:(N × N)⟶Q | |
| 2 | addpqf 10930 | . . . 4 ⊢ +pQ :((N × N) × (N × N))⟶(N × N) | |
| 3 | fco 6732 | . . . 4 ⊢ (([Q]:(N × N)⟶Q ∧ +pQ :((N × N) × (N × N))⟶(N × N)) → ([Q] ∘ +pQ ):((N × N) × (N × N))⟶Q) | |
| 4 | 1, 2, 3 | mp2an 704 | . . 3 ⊢ ([Q] ∘ +pQ ):((N × N) × (N × N))⟶Q |
| 5 | elpqn 10911 | . . . . 5 ⊢ (𝑥 ∈ Q → 𝑥 ∈ (N × N)) | |
| 6 | 5 | ssriv 3942 | . . . 4 ⊢ Q ⊆ (N × N) |
| 7 | xpss12 5678 | . . . 4 ⊢ ((Q ⊆ (N × N) ∧ Q ⊆ (N × N)) → (Q × Q) ⊆ ((N × N) × (N × N))) | |
| 8 | 6, 6, 7 | mp2an 704 | . . 3 ⊢ (Q × Q) ⊆ ((N × N) × (N × N)) |
| 9 | fssres 6746 | . . 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 704 | . 2 ⊢ (([Q] ∘ +pQ ) ↾ (Q × Q)):(Q × Q)⟶Q |
| 11 | df-plq 10900 | . . 3 ⊢ +Q = (([Q] ∘ +pQ ) ↾ (Q × Q)) | |
| 12 | 11 | feq1i 6698 | . 2 ⊢ ( +Q :(Q × Q)⟶Q ↔ (([Q] ∘ +pQ ) ↾ (Q × Q)):(Q × Q)⟶Q) |
| 13 | 10, 12 | mpbir 234 | 1 ⊢ +Q :(Q × Q)⟶Q |
| Colors of variables: wff setvar class |
| Syntax hints: ⊆ wss 3906 × cxp 5661 ↾ cres 5665 ∘ ccom 5667 ⟶wf 6534 Ncnpi 10830 +pQ cplpq 10834 Qcnq 10838 [Q]cerq 10840 +Q cplq 10841 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-1o 8454 df-oadd 8458 df-omul 8459 df-er 8695 df-ni 10858 df-pli 10859 df-mi 10860 df-lti 10861 df-plpq 10894 df-enq 10897 df-nq 10898 df-erq 10899 df-plq 10900 df-1nq 10902 |
| This theorem is referenced by: addcomnq 10937 adderpq 10942 addassnq 10944 distrnq 10947 ltanq 10957 ltexnq 10961 nsmallnq 10963 ltbtwnnq 10964 prlem934 11019 ltaddpr 11020 ltexprlem2 11023 ltexprlem3 11024 ltexprlem4 11025 ltexprlem6 11027 ltexprlem7 11028 prlem936 11033 |
| Copyright terms: Public domain | W3C validator |