| 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 10891 | . 2 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 +Q 𝐵) = ([Q]‘(𝐴 +pQ 𝐵))) | |
| 2 | elpqn 10878 | . . . 4 ⊢ (𝐴 ∈ Q → 𝐴 ∈ (N × N)) | |
| 3 | elpqn 10878 | . . . 4 ⊢ (𝐵 ∈ Q → 𝐵 ∈ (N × N)) | |
| 4 | addpqf 10897 | . . . . 5 ⊢ +pQ :((N × N) × (N × N))⟶(N × N) | |
| 5 | 4 | fovcl 7518 | . . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 +pQ 𝐵) ∈ (N × N)) |
| 6 | 2, 3, 5 | syl2an 605 | . . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 +pQ 𝐵) ∈ (N × N)) |
| 7 | nqercl 10884 | . . 3 ⊢ ((𝐴 +pQ 𝐵) ∈ (N × N) → ([Q]‘(𝐴 +pQ 𝐵)) ∈ Q) | |
| 8 | 6, 7 | syl 17 | . 2 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → ([Q]‘(𝐴 +pQ 𝐵)) ∈ Q) |
| 9 | 1, 8 | eqeltrd 2861 | 1 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 +Q 𝐵) ∈ Q) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∈ wcel 2141 × cxp 5643 ‘cfv 6515 (class class class)co 7390 Ncnpi 10797 +pQ cplpq 10801 Qcnq 10805 [Q]cerq 10807 +Q cplq 10808 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pr 5389 ax-un 7712 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7841 df-1st 7964 df-2nd 7965 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-rdg 8374 df-1o 8430 df-oadd 8434 df-omul 8435 df-er 8671 df-ni 10825 df-pli 10826 df-mi 10827 df-lti 10828 df-plpq 10861 df-enq 10864 df-nq 10865 df-erq 10866 df-plq 10867 df-1nq 10869 |
| This theorem is referenced by: halfnq 10929 plpv 10963 dmplp 10965 addclprlem2 10970 addclpr 10971 addasspr 10975 distrlem1pr 10978 distrlem4pr 10979 distrlem5pr 10980 ltaddpr 10987 ltexprlem6 10994 ltexprlem7 10995 prlem936 11000 |
| Copyright terms: Public domain | W3C validator |