![]() |
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 10067 | . . . 4 ⊢ [Q]:(N × N)⟶Q | |
2 | addpqf 10081 | . . . 4 ⊢ +pQ :((N × N) × (N × N))⟶(N × N) | |
3 | fco 6295 | . . . 4 ⊢ (([Q]:(N × N)⟶Q ∧ +pQ :((N × N) × (N × N))⟶(N × N)) → ([Q] ∘ +pQ ):((N × N) × (N × N))⟶Q) | |
4 | 1, 2, 3 | mp2an 683 | . . 3 ⊢ ([Q] ∘ +pQ ):((N × N) × (N × N))⟶Q |
5 | elpqn 10062 | . . . . 5 ⊢ (𝑥 ∈ Q → 𝑥 ∈ (N × N)) | |
6 | 5 | ssriv 3831 | . . . 4 ⊢ Q ⊆ (N × N) |
7 | xpss12 5357 | . . . 4 ⊢ ((Q ⊆ (N × N) ∧ Q ⊆ (N × N)) → (Q × Q) ⊆ ((N × N) × (N × N))) | |
8 | 6, 6, 7 | mp2an 683 | . . 3 ⊢ (Q × Q) ⊆ ((N × N) × (N × N)) |
9 | fssres 6307 | . . 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 683 | . 2 ⊢ (([Q] ∘ +pQ ) ↾ (Q × Q)):(Q × Q)⟶Q |
11 | df-plq 10051 | . . 3 ⊢ +Q = (([Q] ∘ +pQ ) ↾ (Q × Q)) | |
12 | 11 | feq1i 6269 | . 2 ⊢ ( +Q :(Q × Q)⟶Q ↔ (([Q] ∘ +pQ ) ↾ (Q × Q)):(Q × Q)⟶Q) |
13 | 10, 12 | mpbir 223 | 1 ⊢ +Q :(Q × Q)⟶Q |
Colors of variables: wff setvar class |
Syntax hints: ⊆ wss 3798 × cxp 5340 ↾ cres 5344 ∘ ccom 5346 ⟶wf 6119 Ncnpi 9981 +pQ cplpq 9985 Qcnq 9989 [Q]cerq 9991 +Q cplq 9992 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1894 ax-4 1908 ax-5 2009 ax-6 2075 ax-7 2112 ax-8 2166 ax-9 2173 ax-10 2192 ax-11 2207 ax-12 2220 ax-13 2389 ax-ext 2803 ax-sep 5005 ax-nul 5013 ax-pow 5065 ax-pr 5127 ax-un 7209 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 879 df-3or 1112 df-3an 1113 df-tru 1660 df-ex 1879 df-nf 1883 df-sb 2068 df-mo 2605 df-eu 2640 df-clab 2812 df-cleq 2818 df-clel 2821 df-nfc 2958 df-ne 3000 df-ral 3122 df-rex 3123 df-reu 3124 df-rmo 3125 df-rab 3126 df-v 3416 df-sbc 3663 df-csb 3758 df-dif 3801 df-un 3803 df-in 3805 df-ss 3812 df-pss 3814 df-nul 4145 df-if 4307 df-pw 4380 df-sn 4398 df-pr 4400 df-tp 4402 df-op 4404 df-uni 4659 df-iun 4742 df-br 4874 df-opab 4936 df-mpt 4953 df-tr 4976 df-id 5250 df-eprel 5255 df-po 5263 df-so 5264 df-fr 5301 df-we 5303 df-xp 5348 df-rel 5349 df-cnv 5350 df-co 5351 df-dm 5352 df-rn 5353 df-res 5354 df-ima 5355 df-pred 5920 df-ord 5966 df-on 5967 df-lim 5968 df-suc 5969 df-iota 6086 df-fun 6125 df-fn 6126 df-f 6127 df-f1 6128 df-fo 6129 df-f1o 6130 df-fv 6131 df-ov 6908 df-oprab 6909 df-mpt2 6910 df-om 7327 df-1st 7428 df-2nd 7429 df-wrecs 7672 df-recs 7734 df-rdg 7772 df-1o 7826 df-oadd 7830 df-omul 7831 df-er 8009 df-ni 10009 df-pli 10010 df-mi 10011 df-lti 10012 df-plpq 10045 df-enq 10048 df-nq 10049 df-erq 10050 df-plq 10051 df-1nq 10053 |
This theorem is referenced by: addcomnq 10088 adderpq 10093 addassnq 10095 distrnq 10098 ltanq 10108 ltexnq 10112 nsmallnq 10114 ltbtwnnq 10115 prlem934 10170 ltaddpr 10171 ltexprlem2 10174 ltexprlem3 10175 ltexprlem4 10176 ltexprlem6 10178 ltexprlem7 10179 prlem936 10184 |
Copyright terms: Public domain | W3C validator |