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 10355 | . . . 4 ⊢ [Q]:(N × N)⟶Q | |
2 | addpqf 10369 | . . . 4 ⊢ +pQ :((N × N) × (N × N))⟶(N × N) | |
3 | fco 6534 | . . . 4 ⊢ (([Q]:(N × N)⟶Q ∧ +pQ :((N × N) × (N × N))⟶(N × N)) → ([Q] ∘ +pQ ):((N × N) × (N × N))⟶Q) | |
4 | 1, 2, 3 | mp2an 690 | . . 3 ⊢ ([Q] ∘ +pQ ):((N × N) × (N × N))⟶Q |
5 | elpqn 10350 | . . . . 5 ⊢ (𝑥 ∈ Q → 𝑥 ∈ (N × N)) | |
6 | 5 | ssriv 3974 | . . . 4 ⊢ Q ⊆ (N × N) |
7 | xpss12 5573 | . . . 4 ⊢ ((Q ⊆ (N × N) ∧ Q ⊆ (N × N)) → (Q × Q) ⊆ ((N × N) × (N × N))) | |
8 | 6, 6, 7 | mp2an 690 | . . 3 ⊢ (Q × Q) ⊆ ((N × N) × (N × N)) |
9 | fssres 6547 | . . 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 690 | . 2 ⊢ (([Q] ∘ +pQ ) ↾ (Q × Q)):(Q × Q)⟶Q |
11 | df-plq 10339 | . . 3 ⊢ +Q = (([Q] ∘ +pQ ) ↾ (Q × Q)) | |
12 | 11 | feq1i 6508 | . 2 ⊢ ( +Q :(Q × Q)⟶Q ↔ (([Q] ∘ +pQ ) ↾ (Q × Q)):(Q × Q)⟶Q) |
13 | 10, 12 | mpbir 233 | 1 ⊢ +Q :(Q × Q)⟶Q |
Colors of variables: wff setvar class |
Syntax hints: ⊆ wss 3939 × cxp 5556 ↾ cres 5560 ∘ ccom 5562 ⟶wf 6354 Ncnpi 10269 +pQ cplpq 10273 Qcnq 10277 [Q]cerq 10279 +Q cplq 10280 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-1st 7692 df-2nd 7693 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-1o 8105 df-oadd 8109 df-omul 8110 df-er 8292 df-ni 10297 df-pli 10298 df-mi 10299 df-lti 10300 df-plpq 10333 df-enq 10336 df-nq 10337 df-erq 10338 df-plq 10339 df-1nq 10341 |
This theorem is referenced by: addcomnq 10376 adderpq 10381 addassnq 10383 distrnq 10386 ltanq 10396 ltexnq 10400 nsmallnq 10402 ltbtwnnq 10403 prlem934 10458 ltaddpr 10459 ltexprlem2 10462 ltexprlem3 10463 ltexprlem4 10464 ltexprlem6 10466 ltexprlem7 10467 prlem936 10472 |
Copyright terms: Public domain | W3C validator |