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

Theorem prcdnq 10988
Description: A positive real is closed downwards under the positive fractions. Definition 9-3.1 (ii) of [Gleason] p. 121. (Contributed by NM, 25-Feb-1996.) (Revised by Mario Carneiro, 11-May-2013.) (New usage is discouraged.)
Assertion
Ref Expression
prcdnq ((𝐴P𝐵𝐴) → (𝐶 <Q 𝐵𝐶𝐴))

Proof of Theorem prcdnq
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ltrelnq 10921 . . . . . . 7 <Q ⊆ (Q × Q)
2 relxp 5695 . . . . . . 7 Rel (Q × Q)
3 relss 5782 . . . . . . 7 ( <Q ⊆ (Q × Q) → (Rel (Q × Q) → Rel <Q ))
41, 2, 3mp2 9 . . . . . 6 Rel <Q
54brrelex1i 5733 . . . . 5 (𝐶 <Q 𝐵𝐶 ∈ V)
6 eleq1 2822 . . . . . . . . 9 (𝑥 = 𝐵 → (𝑥𝐴𝐵𝐴))
76anbi2d 630 . . . . . . . 8 (𝑥 = 𝐵 → ((𝐴P𝑥𝐴) ↔ (𝐴P𝐵𝐴)))
8 breq2 5153 . . . . . . . 8 (𝑥 = 𝐵 → (𝑦 <Q 𝑥𝑦 <Q 𝐵))
97, 8anbi12d 632 . . . . . . 7 (𝑥 = 𝐵 → (((𝐴P𝑥𝐴) ∧ 𝑦 <Q 𝑥) ↔ ((𝐴P𝐵𝐴) ∧ 𝑦 <Q 𝐵)))
109imbi1d 342 . . . . . 6 (𝑥 = 𝐵 → ((((𝐴P𝑥𝐴) ∧ 𝑦 <Q 𝑥) → 𝑦𝐴) ↔ (((𝐴P𝐵𝐴) ∧ 𝑦 <Q 𝐵) → 𝑦𝐴)))
11 breq1 5152 . . . . . . . 8 (𝑦 = 𝐶 → (𝑦 <Q 𝐵𝐶 <Q 𝐵))
1211anbi2d 630 . . . . . . 7 (𝑦 = 𝐶 → (((𝐴P𝐵𝐴) ∧ 𝑦 <Q 𝐵) ↔ ((𝐴P𝐵𝐴) ∧ 𝐶 <Q 𝐵)))
13 eleq1 2822 . . . . . . 7 (𝑦 = 𝐶 → (𝑦𝐴𝐶𝐴))
1412, 13imbi12d 345 . . . . . 6 (𝑦 = 𝐶 → ((((𝐴P𝐵𝐴) ∧ 𝑦 <Q 𝐵) → 𝑦𝐴) ↔ (((𝐴P𝐵𝐴) ∧ 𝐶 <Q 𝐵) → 𝐶𝐴)))
15 elnpi 10983 . . . . . . . . . . 11 (𝐴P ↔ ((𝐴 ∈ V ∧ ∅ ⊊ 𝐴𝐴Q) ∧ ∀𝑥𝐴 (∀𝑦(𝑦 <Q 𝑥𝑦𝐴) ∧ ∃𝑦𝐴 𝑥 <Q 𝑦)))
1615simprbi 498 . . . . . . . . . 10 (𝐴P → ∀𝑥𝐴 (∀𝑦(𝑦 <Q 𝑥𝑦𝐴) ∧ ∃𝑦𝐴 𝑥 <Q 𝑦))
1716r19.21bi 3249 . . . . . . . . 9 ((𝐴P𝑥𝐴) → (∀𝑦(𝑦 <Q 𝑥𝑦𝐴) ∧ ∃𝑦𝐴 𝑥 <Q 𝑦))
1817simpld 496 . . . . . . . 8 ((𝐴P𝑥𝐴) → ∀𝑦(𝑦 <Q 𝑥𝑦𝐴))
191819.21bi 2183 . . . . . . 7 ((𝐴P𝑥𝐴) → (𝑦 <Q 𝑥𝑦𝐴))
2019imp 408 . . . . . 6 (((𝐴P𝑥𝐴) ∧ 𝑦 <Q 𝑥) → 𝑦𝐴)
2110, 14, 20vtocl2g 3563 . . . . 5 ((𝐵𝐴𝐶 ∈ V) → (((𝐴P𝐵𝐴) ∧ 𝐶 <Q 𝐵) → 𝐶𝐴))
225, 21sylan2 594 . . . 4 ((𝐵𝐴𝐶 <Q 𝐵) → (((𝐴P𝐵𝐴) ∧ 𝐶 <Q 𝐵) → 𝐶𝐴))
2322adantll 713 . . 3 (((𝐴P𝐵𝐴) ∧ 𝐶 <Q 𝐵) → (((𝐴P𝐵𝐴) ∧ 𝐶 <Q 𝐵) → 𝐶𝐴))
2423pm2.43i 52 . 2 (((𝐴P𝐵𝐴) ∧ 𝐶 <Q 𝐵) → 𝐶𝐴)
2524ex 414 1 ((𝐴P𝐵𝐴) → (𝐶 <Q 𝐵𝐶𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397  w3a 1088  wal 1540   = wceq 1542  wcel 2107  wral 3062  wrex 3071  Vcvv 3475  wss 3949  wpss 3950  c0 4323   class class class wbr 5149   × cxp 5675  Rel wrel 5682  Qcnq 10847   <Q cltq 10853  Pcnp 10854
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 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-pss 3968  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-br 5150  df-opab 5212  df-xp 5683  df-rel 5684  df-ltnq 10913  df-np 10976
This theorem is referenced by:  prub  10989  addclprlem1  11011  mulclprlem  11014  distrlem4pr  11021  1idpr  11024  psslinpr  11026  prlem934  11028  ltaddpr  11029  ltexprlem2  11032  ltexprlem3  11033  ltexprlem6  11036  prlem936  11042  reclem2pr  11043  suplem1pr  11047
  Copyright terms: Public domain W3C validator