![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > prnmadd | Structured version Visualization version GIF version |
Description: A positive real has no largest member. Addition version. (Contributed by NM, 7-Apr-1996.) (Revised by Mario Carneiro, 11-May-2013.) (New usage is discouraged.) |
Ref | Expression |
---|---|
prnmadd | ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ 𝐴) → ∃𝑥(𝐵 +Q 𝑥) ∈ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prnmax 10406 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ 𝐴) → ∃𝑦 ∈ 𝐴 𝐵 <Q 𝑦) | |
2 | ltrelnq 10337 | . . . . . . 7 ⊢ <Q ⊆ (Q × Q) | |
3 | 2 | brel 5581 | . . . . . 6 ⊢ (𝐵 <Q 𝑦 → (𝐵 ∈ Q ∧ 𝑦 ∈ Q)) |
4 | 3 | simprd 499 | . . . . 5 ⊢ (𝐵 <Q 𝑦 → 𝑦 ∈ Q) |
5 | ltexnq 10386 | . . . . . 6 ⊢ (𝑦 ∈ Q → (𝐵 <Q 𝑦 ↔ ∃𝑥(𝐵 +Q 𝑥) = 𝑦)) | |
6 | 5 | biimpcd 252 | . . . . 5 ⊢ (𝐵 <Q 𝑦 → (𝑦 ∈ Q → ∃𝑥(𝐵 +Q 𝑥) = 𝑦)) |
7 | 4, 6 | mpd 15 | . . . 4 ⊢ (𝐵 <Q 𝑦 → ∃𝑥(𝐵 +Q 𝑥) = 𝑦) |
8 | eleq1a 2885 | . . . . 5 ⊢ (𝑦 ∈ 𝐴 → ((𝐵 +Q 𝑥) = 𝑦 → (𝐵 +Q 𝑥) ∈ 𝐴)) | |
9 | 8 | eximdv 1918 | . . . 4 ⊢ (𝑦 ∈ 𝐴 → (∃𝑥(𝐵 +Q 𝑥) = 𝑦 → ∃𝑥(𝐵 +Q 𝑥) ∈ 𝐴)) |
10 | 7, 9 | syl5 34 | . . 3 ⊢ (𝑦 ∈ 𝐴 → (𝐵 <Q 𝑦 → ∃𝑥(𝐵 +Q 𝑥) ∈ 𝐴)) |
11 | 10 | rexlimiv 3239 | . 2 ⊢ (∃𝑦 ∈ 𝐴 𝐵 <Q 𝑦 → ∃𝑥(𝐵 +Q 𝑥) ∈ 𝐴) |
12 | 1, 11 | syl 17 | 1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ 𝐴) → ∃𝑥(𝐵 +Q 𝑥) ∈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∃wex 1781 ∈ wcel 2111 ∃wrex 3107 class class class wbr 5030 (class class class)co 7135 Qcnq 10263 +Q cplq 10266 <Q cltq 10269 Pcnp 10270 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-omul 8090 df-er 8272 df-ni 10283 df-pli 10284 df-mi 10285 df-lti 10286 df-plpq 10319 df-mpq 10320 df-ltpq 10321 df-enq 10322 df-nq 10323 df-erq 10324 df-plq 10325 df-mq 10326 df-1nq 10327 df-ltnq 10329 df-np 10392 |
This theorem is referenced by: ltexprlem1 10447 ltexprlem7 10453 |
Copyright terms: Public domain | W3C validator |