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 10469 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ 𝐴) → ∃𝑦 ∈ 𝐴 𝐵 <Q 𝑦) | |
2 | ltrelnq 10400 | . . . . . . 7 ⊢ <Q ⊆ (Q × Q) | |
3 | 2 | brel 5592 | . . . . . 6 ⊢ (𝐵 <Q 𝑦 → (𝐵 ∈ Q ∧ 𝑦 ∈ Q)) |
4 | 3 | simprd 499 | . . . . 5 ⊢ (𝐵 <Q 𝑦 → 𝑦 ∈ Q) |
5 | ltexnq 10449 | . . . . . 6 ⊢ (𝑦 ∈ Q → (𝐵 <Q 𝑦 ↔ ∃𝑥(𝐵 +Q 𝑥) = 𝑦)) | |
6 | 5 | biimpcd 252 | . . . . 5 ⊢ (𝐵 <Q 𝑦 → (𝑦 ∈ Q → ∃𝑥(𝐵 +Q 𝑥) = 𝑦)) |
7 | 4, 6 | mpd 15 | . . . 4 ⊢ (𝐵 <Q 𝑦 → ∃𝑥(𝐵 +Q 𝑥) = 𝑦) |
8 | eleq1a 2848 | . . . . 5 ⊢ (𝑦 ∈ 𝐴 → ((𝐵 +Q 𝑥) = 𝑦 → (𝐵 +Q 𝑥) ∈ 𝐴)) | |
9 | 8 | eximdv 1919 | . . . 4 ⊢ (𝑦 ∈ 𝐴 → (∃𝑥(𝐵 +Q 𝑥) = 𝑦 → ∃𝑥(𝐵 +Q 𝑥) ∈ 𝐴)) |
10 | 7, 9 | syl5 34 | . . 3 ⊢ (𝑦 ∈ 𝐴 → (𝐵 <Q 𝑦 → ∃𝑥(𝐵 +Q 𝑥) ∈ 𝐴)) |
11 | 10 | rexlimiv 3205 | . 2 ⊢ (∃𝑦 ∈ 𝐴 𝐵 <Q 𝑦 → ∃𝑥(𝐵 +Q 𝑥) ∈ 𝐴) |
12 | 1, 11 | syl 17 | 1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ 𝐴) → ∃𝑥(𝐵 +Q 𝑥) ∈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1539 ∃wex 1782 ∈ wcel 2112 ∃wrex 3072 class class class wbr 5037 (class class class)co 7157 Qcnq 10326 +Q cplq 10329 <Q cltq 10332 Pcnp 10333 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1912 ax-6 1971 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2159 ax-12 2176 ax-ext 2730 ax-sep 5174 ax-nul 5181 ax-pr 5303 ax-un 7466 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2071 df-mo 2558 df-eu 2589 df-clab 2737 df-cleq 2751 df-clel 2831 df-nfc 2902 df-ne 2953 df-ral 3076 df-rex 3077 df-reu 3078 df-rmo 3079 df-rab 3080 df-v 3412 df-sbc 3700 df-csb 3809 df-dif 3864 df-un 3866 df-in 3868 df-ss 3878 df-pss 3880 df-nul 4229 df-if 4425 df-pw 4500 df-sn 4527 df-pr 4529 df-tp 4531 df-op 4533 df-uni 4803 df-int 4843 df-iun 4889 df-br 5038 df-opab 5100 df-mpt 5118 df-tr 5144 df-id 5435 df-eprel 5440 df-po 5448 df-so 5449 df-fr 5488 df-we 5490 df-xp 5535 df-rel 5536 df-cnv 5537 df-co 5538 df-dm 5539 df-rn 5540 df-res 5541 df-ima 5542 df-pred 6132 df-ord 6178 df-on 6179 df-lim 6180 df-suc 6181 df-iota 6300 df-fun 6343 df-fn 6344 df-f 6345 df-f1 6346 df-fo 6347 df-f1o 6348 df-fv 6349 df-ov 7160 df-oprab 7161 df-mpo 7162 df-om 7587 df-1st 7700 df-2nd 7701 df-wrecs 7964 df-recs 8025 df-rdg 8063 df-1o 8119 df-oadd 8123 df-omul 8124 df-er 8306 df-ni 10346 df-pli 10347 df-mi 10348 df-lti 10349 df-plpq 10382 df-mpq 10383 df-ltpq 10384 df-enq 10385 df-nq 10386 df-erq 10387 df-plq 10388 df-mq 10389 df-1nq 10390 df-ltnq 10392 df-np 10455 |
This theorem is referenced by: ltexprlem1 10510 ltexprlem7 10516 |
Copyright terms: Public domain | W3C validator |