| 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 10861 | . 2 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 +Q 𝐵) = ([Q]‘(𝐴 +pQ 𝐵))) | |
| 2 | elpqn 10848 | . . . 4 ⊢ (𝐴 ∈ Q → 𝐴 ∈ (N × N)) | |
| 3 | elpqn 10848 | . . . 4 ⊢ (𝐵 ∈ Q → 𝐵 ∈ (N × N)) | |
| 4 | addpqf 10867 | . . . . 5 ⊢ +pQ :((N × N) × (N × N))⟶(N × N) | |
| 5 | 4 | fovcl 7496 | . . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 +pQ 𝐵) ∈ (N × N)) |
| 6 | 2, 3, 5 | syl2an 597 | . . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 +pQ 𝐵) ∈ (N × N)) |
| 7 | nqercl 10854 | . . 3 ⊢ ((𝐴 +pQ 𝐵) ∈ (N × N) → ([Q]‘(𝐴 +pQ 𝐵)) ∈ Q) | |
| 8 | 6, 7 | syl 17 | . 2 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → ([Q]‘(𝐴 +pQ 𝐵)) ∈ Q) |
| 9 | 1, 8 | eqeltrd 2837 | 1 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 +Q 𝐵) ∈ Q) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2114 × cxp 5630 ‘cfv 6500 (class class class)co 7368 Ncnpi 10767 +pQ cplpq 10771 Qcnq 10775 [Q]cerq 10777 +Q cplq 10778 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-oadd 8411 df-omul 8412 df-er 8645 df-ni 10795 df-pli 10796 df-mi 10797 df-lti 10798 df-plpq 10831 df-enq 10834 df-nq 10835 df-erq 10836 df-plq 10837 df-1nq 10839 |
| This theorem is referenced by: halfnq 10899 plpv 10933 dmplp 10935 addclprlem2 10940 addclpr 10941 addasspr 10945 distrlem1pr 10948 distrlem4pr 10949 distrlem5pr 10950 ltaddpr 10957 ltexprlem6 10964 ltexprlem7 10965 prlem936 10970 |
| Copyright terms: Public domain | W3C validator |