| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prnmax | Structured version Visualization version GIF version | ||
| Description: A positive real has no largest member. Definition 9-3.1(iii) of [Gleason] p. 121. (Contributed by NM, 9-Mar-1996.) (Revised by Mario Carneiro, 11-May-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| prnmax | ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 𝐵 <Q 𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1 2853 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝑦 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴)) | |
| 2 | 1 | anbi2d 641 | . . . 4 ⊢ (𝑦 = 𝐵 → ((𝐴 ∈ P ∧ 𝑦 ∈ 𝐴) ↔ (𝐴 ∈ P ∧ 𝐵 ∈ 𝐴))) |
| 3 | breq1 5108 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝑦 <Q 𝑥 ↔ 𝐵 <Q 𝑥)) | |
| 4 | 3 | rexbidv 3189 | . . . 4 ⊢ (𝑦 = 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 <Q 𝑥 ↔ ∃𝑥 ∈ 𝐴 𝐵 <Q 𝑥)) |
| 5 | 2, 4 | imbi12d 347 | . . 3 ⊢ (𝑦 = 𝐵 → (((𝐴 ∈ P ∧ 𝑦 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 𝑦 <Q 𝑥) ↔ ((𝐴 ∈ P ∧ 𝐵 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 𝐵 <Q 𝑥))) |
| 6 | elnpi 10961 | . . . . . 6 ⊢ (𝐴 ∈ P ↔ ((𝐴 ∈ V ∧ ∅ ⊊ 𝐴 ∧ 𝐴 ⊊ Q) ∧ ∀𝑦 ∈ 𝐴 (∀𝑥(𝑥 <Q 𝑦 → 𝑥 ∈ 𝐴) ∧ ∃𝑥 ∈ 𝐴 𝑦 <Q 𝑥))) | |
| 7 | 6 | simprbi 502 | . . . . 5 ⊢ (𝐴 ∈ P → ∀𝑦 ∈ 𝐴 (∀𝑥(𝑥 <Q 𝑦 → 𝑥 ∈ 𝐴) ∧ ∃𝑥 ∈ 𝐴 𝑦 <Q 𝑥)) |
| 8 | 7 | r19.21bi 3257 | . . . 4 ⊢ ((𝐴 ∈ P ∧ 𝑦 ∈ 𝐴) → (∀𝑥(𝑥 <Q 𝑦 → 𝑥 ∈ 𝐴) ∧ ∃𝑥 ∈ 𝐴 𝑦 <Q 𝑥)) |
| 9 | 8 | simprd 500 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝑦 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 𝑦 <Q 𝑥) |
| 10 | 5, 9 | vtoclg 3525 | . 2 ⊢ (𝐵 ∈ 𝐴 → ((𝐴 ∈ P ∧ 𝐵 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 𝐵 <Q 𝑥)) |
| 11 | 10 | anabsi7 683 | 1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 𝐵 <Q 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 ∀wal 1561 = wceq 1563 ∈ wcel 2145 ∀wral 3079 ∃wrex 3089 Vcvv 3457 ⊊ wpss 3908 ∅c0 4288 class class class wbr 5105 Qcnq 10825 <Q cltq 10831 Pcnp 10832 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-12 2215 ax-ext 2737 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-br 5106 df-np 10954 |
| This theorem is referenced by: npomex 10969 prnmadd 10970 genpnmax 10980 1idpr 11002 ltexprlem4 11012 reclem3pr 11022 suplem1pr 11025 |
| Copyright terms: Public domain | W3C validator |