| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > addclnq | Structured version Visualization version GIF version | ||
| Description: Closure of addition on positive fractions. (Contributed by NM, 29-Aug-1995.) (Revised by Mario Carneiro, 8-May-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| addclnq | ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 +Q 𝐵) ∈ Q) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | addpqnq 10911 | . 2 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 +Q 𝐵) = ([Q]‘(𝐴 +pQ 𝐵))) | |
| 2 | elpqn 10898 | . . . 4 ⊢ (𝐴 ∈ Q → 𝐴 ∈ (N × N)) | |
| 3 | elpqn 10898 | . . . 4 ⊢ (𝐵 ∈ Q → 𝐵 ∈ (N × N)) | |
| 4 | addpqf 10917 | . . . . 5 ⊢ +pQ :((N × N) × (N × N))⟶(N × N) | |
| 5 | 4 | fovcl 7528 | . . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 +pQ 𝐵) ∈ (N × N)) |
| 6 | 2, 3, 5 | syl2an 607 | . . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 +pQ 𝐵) ∈ (N × N)) |
| 7 | nqercl 10904 | . . 3 ⊢ ((𝐴 +pQ 𝐵) ∈ (N × N) → ([Q]‘(𝐴 +pQ 𝐵)) ∈ Q) | |
| 8 | 6, 7 | syl 18 | . 2 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → ([Q]‘(𝐴 +pQ 𝐵)) ∈ Q) |
| 9 | 1, 8 | eqeltrd 2865 | 1 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 +Q 𝐵) ∈ Q) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∈ wcel 2145 × cxp 5650 ‘cfv 6525 (class class class)co 7400 Ncnpi 10817 +pQ cplpq 10821 Qcnq 10825 [Q]cerq 10827 +Q cplq 10828 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pr 5395 ax-un 7722 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-oadd 8445 df-omul 8446 df-er 8682 df-ni 10845 df-pli 10846 df-mi 10847 df-lti 10848 df-plpq 10881 df-enq 10884 df-nq 10885 df-erq 10886 df-plq 10887 df-1nq 10889 |
| This theorem is referenced by: halfnq 10949 plpv 10983 dmplp 10985 addclprlem2 10990 addclpr 10991 addasspr 10995 distrlem1pr 10998 distrlem4pr 10999 distrlem5pr 11000 ltaddpr 11007 ltexprlem6 11014 ltexprlem7 11015 prlem936 11020 |
| Copyright terms: Public domain | W3C validator |