MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  prnmax Structured version   Visualization version   GIF version

Theorem prnmax 11061
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.)
Assertion
Ref Expression
prnmax ((𝐴 ∈ P ∧ 𝐵 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 𝐵 <Q 𝑥)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem prnmax
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eleq1 2849 . . . . 5 (𝑦 = 𝐵 → (𝑦 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴))
21anbi2d 642 . . . 4 (𝑦 = 𝐵 → ((𝐴 ∈ P ∧ 𝑦 ∈ 𝐴) ↔ (𝐴 ∈ P ∧ 𝐵 ∈ 𝐴)))
3 breq1 5106 . . . . 5 (𝑦 = 𝐵 → (𝑦 <Q 𝑥 ↔ 𝐵 <Q 𝑥))
43rexbidv 3187 . . . 4 (𝑦 = 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 <Q 𝑥 ↔ ∃𝑥 ∈ 𝐴 𝐵 <Q 𝑥))
52, 4imbi12d 347 . . 3 (𝑦 = 𝐵 → (((𝐴 ∈ P ∧ 𝑦 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 𝑦 <Q 𝑥) ↔ ((𝐴 ∈ P ∧ 𝐵 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 𝐵 <Q 𝑥)))
6 elnpi 11054 . . . . . 6 (𝐴 ∈ P ↔ ((𝐴 ∈ V ∧ ∅ ⊊ 𝐴 ∧ 𝐴 ⊊ Q) ∧ ∀𝑦 ∈ 𝐴 (∀𝑥(𝑥 <Q 𝑦 → 𝑥 ∈ 𝐴) ∧ ∃𝑥 ∈ 𝐴 𝑦 <Q 𝑥)))
76simprbi 503 . . . . 5 (𝐴 ∈ P → ∀𝑦 ∈ 𝐴 (∀𝑥(𝑥 <Q 𝑦 → 𝑥 ∈ 𝐴) ∧ ∃𝑥 ∈ 𝐴 𝑦 <Q 𝑥))
87r19.21bi 3255 . . . 4 ((𝐴 ∈ P ∧ 𝑦 ∈ 𝐴) → (∀𝑥(𝑥 <Q 𝑦 → 𝑥 ∈ 𝐴) ∧ ∃𝑥 ∈ 𝐴 𝑦 <Q 𝑥))
98simprd 501 . . 3 ((𝐴 ∈ P ∧ 𝑦 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 𝑦 <Q 𝑥)
105, 9vtoclg 3518 . 2 (𝐵 ∈ 𝐴 → ((𝐴 ∈ P ∧ 𝐵 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 𝐵 <Q 𝑥))
1110anabsi7 684 1 ((𝐴 ∈ P ∧ 𝐵 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 𝐵 <Q 𝑥)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  Vcvv 3451   ⊊ wpss 3900  ∅c0 4279   class class class wbr 5103  Qcnq 10918   <Q cltq 10924  Pcnp 10925
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-12 2213  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-np 11047
This theorem is used by:  npomex  11062  prnmadd  11063  genpnmax  11073  1idpr  11095  ltexprlem4  11105  reclem3pr  11115  suplem1pr  11118
  Copyright terms: Public domain W3C validator