| 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 10851 | . . . 4 ⊢ [Q]:(N × N)⟶Q | |
| 2 | addpqf 10865 | . . . 4 ⊢ +pQ :((N × N) × (N × N))⟶(N × N) | |
| 3 | fco 6686 | . . . 4 ⊢ (([Q]:(N × N)⟶Q ∧ +pQ :((N × N) × (N × N))⟶(N × N)) → ([Q] ∘ +pQ ):((N × N) × (N × N))⟶Q) | |
| 4 | 1, 2, 3 | mp2an 698 | . . 3 ⊢ ([Q] ∘ +pQ ):((N × N) × (N × N))⟶Q |
| 5 | elpqn 10846 | . . . . 5 ⊢ (𝑥 ∈ Q → 𝑥 ∈ (N × N)) | |
| 6 | 5 | ssriv 3926 | . . . 4 ⊢ Q ⊆ (N × N) |
| 7 | xpss12 5640 | . . . 4 ⊢ ((Q ⊆ (N × N) ∧ Q ⊆ (N × N)) → (Q × Q) ⊆ ((N × N) × (N × N))) | |
| 8 | 6, 6, 7 | mp2an 698 | . . 3 ⊢ (Q × Q) ⊆ ((N × N) × (N × N)) |
| 9 | fssres 6700 | . . 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 698 | . 2 ⊢ (([Q] ∘ +pQ ) ↾ (Q × Q)):(Q × Q)⟶Q |
| 11 | df-plq 10835 | . . 3 ⊢ +Q = (([Q] ∘ +pQ ) ↾ (Q × Q)) | |
| 12 | 11 | feq1i 6653 | . 2 ⊢ ( +Q :(Q × Q)⟶Q ↔ (([Q] ∘ +pQ ) ↾ (Q × Q)):(Q × Q)⟶Q) |
| 13 | 10, 12 | mpbir 232 | 1 ⊢ +Q :(Q × Q)⟶Q |
| Colors of variables: wff setvar class |
| Syntax hints: ⊆ wss 3890 × cxp 5623 ↾ cres 5627 ∘ ccom 5629 ⟶wf 6488 Ncnpi 10765 +pQ cplpq 10769 Qcnq 10773 [Q]cerq 10775 +Q cplq 10776 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pr 5369 ax-un 7685 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-1st 7938 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-1o 8402 df-oadd 8406 df-omul 8407 df-er 8640 df-ni 10793 df-pli 10794 df-mi 10795 df-lti 10796 df-plpq 10829 df-enq 10832 df-nq 10833 df-erq 10834 df-plq 10835 df-1nq 10837 |
| This theorem is referenced by: addcomnq 10872 adderpq 10877 addassnq 10879 distrnq 10882 ltanq 10892 ltexnq 10896 nsmallnq 10898 ltbtwnnq 10899 prlem934 10954 ltaddpr 10955 ltexprlem2 10958 ltexprlem3 10959 ltexprlem4 10960 ltexprlem6 10962 ltexprlem7 10963 prlem936 10968 |
| Copyright terms: Public domain | W3C validator |