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 10682 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ 𝐴) → ∃𝑦 ∈ 𝐴 𝐵 <Q 𝑦) | |
2 | ltrelnq 10613 | . . . . . . 7 ⊢ <Q ⊆ (Q × Q) | |
3 | 2 | brel 5643 | . . . . . 6 ⊢ (𝐵 <Q 𝑦 → (𝐵 ∈ Q ∧ 𝑦 ∈ Q)) |
4 | 3 | simprd 495 | . . . . 5 ⊢ (𝐵 <Q 𝑦 → 𝑦 ∈ Q) |
5 | ltexnq 10662 | . . . . . 6 ⊢ (𝑦 ∈ Q → (𝐵 <Q 𝑦 ↔ ∃𝑥(𝐵 +Q 𝑥) = 𝑦)) | |
6 | 5 | biimpcd 248 | . . . . 5 ⊢ (𝐵 <Q 𝑦 → (𝑦 ∈ Q → ∃𝑥(𝐵 +Q 𝑥) = 𝑦)) |
7 | 4, 6 | mpd 15 | . . . 4 ⊢ (𝐵 <Q 𝑦 → ∃𝑥(𝐵 +Q 𝑥) = 𝑦) |
8 | eleq1a 2834 | . . . . 5 ⊢ (𝑦 ∈ 𝐴 → ((𝐵 +Q 𝑥) = 𝑦 → (𝐵 +Q 𝑥) ∈ 𝐴)) | |
9 | 8 | eximdv 1921 | . . . 4 ⊢ (𝑦 ∈ 𝐴 → (∃𝑥(𝐵 +Q 𝑥) = 𝑦 → ∃𝑥(𝐵 +Q 𝑥) ∈ 𝐴)) |
10 | 7, 9 | syl5 34 | . . 3 ⊢ (𝑦 ∈ 𝐴 → (𝐵 <Q 𝑦 → ∃𝑥(𝐵 +Q 𝑥) ∈ 𝐴)) |
11 | 10 | rexlimiv 3208 | . 2 ⊢ (∃𝑦 ∈ 𝐴 𝐵 <Q 𝑦 → ∃𝑥(𝐵 +Q 𝑥) ∈ 𝐴) |
12 | 1, 11 | syl 17 | 1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ 𝐴) → ∃𝑥(𝐵 +Q 𝑥) ∈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∃wex 1783 ∈ wcel 2108 ∃wrex 3064 class class class wbr 5070 (class class class)co 7255 Qcnq 10539 +Q cplq 10542 <Q cltq 10545 Pcnp 10546 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-oadd 8271 df-omul 8272 df-er 8456 df-ni 10559 df-pli 10560 df-mi 10561 df-lti 10562 df-plpq 10595 df-mpq 10596 df-ltpq 10597 df-enq 10598 df-nq 10599 df-erq 10600 df-plq 10601 df-mq 10602 df-1nq 10603 df-ltnq 10605 df-np 10668 |
This theorem is referenced by: ltexprlem1 10723 ltexprlem7 10729 |
Copyright terms: Public domain | W3C validator |