Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  infxrunb3rnmpt Structured version   Visualization version   GIF version

Theorem infxrunb3rnmpt 39968
Description: The infimum of an unbounded-below set of extended reals is minus infinity. (Contributed by Glauco Siliprandi, 23-Oct-2021.)
Hypotheses
Ref Expression
infxrunb3rnmpt.1 𝑥𝜑
infxrunb3rnmpt.2 𝑦𝜑
infxrunb3rnmpt.3 ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ*)
Assertion
Ref Expression
infxrunb3rnmpt (𝜑 → (∀𝑦 ∈ ℝ ∃𝑥𝐴 𝐵𝑦 ↔ inf(ran (𝑥𝐴𝐵), ℝ*, < ) = -∞))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑦,𝐵
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐵(𝑥)

Proof of Theorem infxrunb3rnmpt
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 infxrunb3rnmpt.2 . . 3 𝑦𝜑
2 infxrunb3rnmpt.1 . . . . 5 𝑥𝜑
3 nfmpt1 4780 . . . . . . 7 𝑥(𝑥𝐴𝐵)
43nfrn 5400 . . . . . 6 𝑥ran (𝑥𝐴𝐵)
5 nfv 1883 . . . . . 6 𝑥 𝑧𝑦
64, 5nfrex 3036 . . . . 5 𝑥𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦
7 simpr 476 . . . . . . . . 9 ((𝜑𝑥𝐴) → 𝑥𝐴)
8 infxrunb3rnmpt.3 . . . . . . . . 9 ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ*)
9 eqid 2651 . . . . . . . . . 10 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
109elrnmpt1 5406 . . . . . . . . 9 ((𝑥𝐴𝐵 ∈ ℝ*) → 𝐵 ∈ ran (𝑥𝐴𝐵))
117, 8, 10syl2anc 694 . . . . . . . 8 ((𝜑𝑥𝐴) → 𝐵 ∈ ran (𝑥𝐴𝐵))
12113adant3 1101 . . . . . . 7 ((𝜑𝑥𝐴𝐵𝑦) → 𝐵 ∈ ran (𝑥𝐴𝐵))
13 simp3 1083 . . . . . . 7 ((𝜑𝑥𝐴𝐵𝑦) → 𝐵𝑦)
14 breq1 4688 . . . . . . . 8 (𝑧 = 𝐵 → (𝑧𝑦𝐵𝑦))
1514rspcev 3340 . . . . . . 7 ((𝐵 ∈ ran (𝑥𝐴𝐵) ∧ 𝐵𝑦) → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦)
1612, 13, 15syl2anc 694 . . . . . 6 ((𝜑𝑥𝐴𝐵𝑦) → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦)
17163exp 1283 . . . . 5 (𝜑 → (𝑥𝐴 → (𝐵𝑦 → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦)))
182, 6, 17rexlimd 3055 . . . 4 (𝜑 → (∃𝑥𝐴 𝐵𝑦 → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦))
19 nfv 1883 . . . . . 6 𝑧𝑥𝐴 𝐵𝑦
20 vex 3234 . . . . . . . . 9 𝑧 ∈ V
219elrnmpt 5404 . . . . . . . . 9 (𝑧 ∈ V → (𝑧 ∈ ran (𝑥𝐴𝐵) ↔ ∃𝑥𝐴 𝑧 = 𝐵))
2220, 21ax-mp 5 . . . . . . . 8 (𝑧 ∈ ran (𝑥𝐴𝐵) ↔ ∃𝑥𝐴 𝑧 = 𝐵)
2322biimpi 206 . . . . . . 7 (𝑧 ∈ ran (𝑥𝐴𝐵) → ∃𝑥𝐴 𝑧 = 𝐵)
2414biimpcd 239 . . . . . . . . . 10 (𝑧𝑦 → (𝑧 = 𝐵𝐵𝑦))
2524a1d 25 . . . . . . . . 9 (𝑧𝑦 → (𝑥𝐴 → (𝑧 = 𝐵𝐵𝑦)))
265, 25reximdai 3041 . . . . . . . 8 (𝑧𝑦 → (∃𝑥𝐴 𝑧 = 𝐵 → ∃𝑥𝐴 𝐵𝑦))
2726com12 32 . . . . . . 7 (∃𝑥𝐴 𝑧 = 𝐵 → (𝑧𝑦 → ∃𝑥𝐴 𝐵𝑦))
2823, 27syl 17 . . . . . 6 (𝑧 ∈ ran (𝑥𝐴𝐵) → (𝑧𝑦 → ∃𝑥𝐴 𝐵𝑦))
2919, 28rexlimi 3053 . . . . 5 (∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦 → ∃𝑥𝐴 𝐵𝑦)
3029a1i 11 . . . 4 (𝜑 → (∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦 → ∃𝑥𝐴 𝐵𝑦))
3118, 30impbid 202 . . 3 (𝜑 → (∃𝑥𝐴 𝐵𝑦 ↔ ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦))
321, 31ralbid 3012 . 2 (𝜑 → (∀𝑦 ∈ ℝ ∃𝑥𝐴 𝐵𝑦 ↔ ∀𝑦 ∈ ℝ ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦))
332, 9, 8rnmptssd 39699 . . 3 (𝜑 → ran (𝑥𝐴𝐵) ⊆ ℝ*)
34 infxrunb3 39964 . . 3 (ran (𝑥𝐴𝐵) ⊆ ℝ* → (∀𝑦 ∈ ℝ ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦 ↔ inf(ran (𝑥𝐴𝐵), ℝ*, < ) = -∞))
3533, 34syl 17 . 2 (𝜑 → (∀𝑦 ∈ ℝ ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦 ↔ inf(ran (𝑥𝐴𝐵), ℝ*, < ) = -∞))
3632, 35bitrd 268 1 (𝜑 → (∀𝑦 ∈ ℝ ∃𝑥𝐴 𝐵𝑦 ↔ inf(ran (𝑥𝐴𝐵), ℝ*, < ) = -∞))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383  w3a 1054   = wceq 1523  wnf 1748  wcel 2030  wral 2941  wrex 2942  Vcvv 3231  wss 3607   class class class wbr 4685  cmpt 4762  ran crn 5144  infcinf 8388  cr 9973  -∞cmnf 10110  *cxr 10111   < clt 10112  cle 10113
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991  ax-cnex 10030  ax-resscn 10031  ax-1cn 10032  ax-icn 10033  ax-addcl 10034  ax-addrcl 10035  ax-mulcl 10036  ax-mulrcl 10037  ax-mulcom 10038  ax-addass 10039  ax-mulass 10040  ax-distr 10041  ax-i2m1 10042  ax-1ne0 10043  ax-1rid 10044  ax-rnegex 10045  ax-rrecex 10046  ax-cnre 10047  ax-pre-lttri 10048  ax-pre-lttrn 10049  ax-pre-ltadd 10050  ax-pre-mulgt0 10051  ax-pre-sup 10052
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-reu 2948  df-rmo 2949  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-mpt 4763  df-id 5053  df-po 5064  df-so 5065  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-riota 6651  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-er 7787  df-en 7998  df-dom 7999  df-sdom 8000  df-sup 8389  df-inf 8390  df-pnf 10114  df-mnf 10115  df-xr 10116  df-ltxr 10117  df-le 10118  df-sub 10306  df-neg 10307
This theorem is referenced by:  limsupmnflem  40270
  Copyright terms: Public domain W3C validator