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

Theorem rnmptbd2 42332
Description: Boundness below of the range of a function in maps-to notation. (Contributed by Glauco Siliprandi, 23-Oct-2021.)
Hypotheses
Ref Expression
rnmptbd2.x 𝑥𝜑
rnmptbd2.b ((𝜑𝑥𝐴) → 𝐵𝑉)
Assertion
Ref Expression
rnmptbd2 (𝜑 → (∃𝑦 ∈ ℝ ∀𝑥𝐴 𝑦𝐵 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥𝐴𝐵)𝑦𝑧))
Distinct variable groups:   𝑦,𝐴,𝑧   𝑦,𝐵,𝑧   𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝐴(𝑥)   𝐵(𝑥)   𝑉(𝑥,𝑦,𝑧)

Proof of Theorem rnmptbd2
Dummy variables 𝑢 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq1 5033 . . . . 5 (𝑦 = 𝑤 → (𝑦𝐵𝑤𝐵))
21ralbidv 3109 . . . 4 (𝑦 = 𝑤 → (∀𝑥𝐴 𝑦𝐵 ↔ ∀𝑥𝐴 𝑤𝐵))
32cbvrexvw 3350 . . 3 (∃𝑦 ∈ ℝ ∀𝑥𝐴 𝑦𝐵 ↔ ∃𝑤 ∈ ℝ ∀𝑥𝐴 𝑤𝐵)
43a1i 11 . 2 (𝜑 → (∃𝑦 ∈ ℝ ∀𝑥𝐴 𝑦𝐵 ↔ ∃𝑤 ∈ ℝ ∀𝑥𝐴 𝑤𝐵))
5 rnmptbd2.x . . 3 𝑥𝜑
6 rnmptbd2.b . . 3 ((𝜑𝑥𝐴) → 𝐵𝑉)
75, 6rnmptbd2lem 42331 . 2 (𝜑 → (∃𝑤 ∈ ℝ ∀𝑥𝐴 𝑤𝐵 ↔ ∃𝑤 ∈ ℝ ∀𝑢 ∈ ran (𝑥𝐴𝐵)𝑤𝑢))
8 breq1 5033 . . . . . 6 (𝑤 = 𝑦 → (𝑤𝑢𝑦𝑢))
98ralbidv 3109 . . . . 5 (𝑤 = 𝑦 → (∀𝑢 ∈ ran (𝑥𝐴𝐵)𝑤𝑢 ↔ ∀𝑢 ∈ ran (𝑥𝐴𝐵)𝑦𝑢))
10 breq2 5034 . . . . . 6 (𝑢 = 𝑧 → (𝑦𝑢𝑦𝑧))
1110cbvralvw 3349 . . . . 5 (∀𝑢 ∈ ran (𝑥𝐴𝐵)𝑦𝑢 ↔ ∀𝑧 ∈ ran (𝑥𝐴𝐵)𝑦𝑧)
129, 11bitrdi 290 . . . 4 (𝑤 = 𝑦 → (∀𝑢 ∈ ran (𝑥𝐴𝐵)𝑤𝑢 ↔ ∀𝑧 ∈ ran (𝑥𝐴𝐵)𝑦𝑧))
1312cbvrexvw 3350 . . 3 (∃𝑤 ∈ ℝ ∀𝑢 ∈ ran (𝑥𝐴𝐵)𝑤𝑢 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥𝐴𝐵)𝑦𝑧)
1413a1i 11 . 2 (𝜑 → (∃𝑤 ∈ ℝ ∀𝑢 ∈ ran (𝑥𝐴𝐵)𝑤𝑢 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥𝐴𝐵)𝑦𝑧))
154, 7, 143bitrd 308 1 (𝜑 → (∃𝑦 ∈ ℝ ∀𝑥𝐴 𝑦𝐵 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥𝐴𝐵)𝑦𝑧))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399  wnf 1790  wcel 2114  wral 3053  wrex 3054   class class class wbr 5030  cmpt 5110  ran crn 5526  cr 10614  cle 10754
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2020  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2162  ax-12 2179  ax-ext 2710  ax-sep 5167  ax-nul 5174  ax-pr 5296
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2075  df-mo 2540  df-eu 2570  df-clab 2717  df-cleq 2730  df-clel 2811  df-nfc 2881  df-ral 3058  df-rex 3059  df-v 3400  df-sbc 3681  df-csb 3791  df-dif 3846  df-un 3848  df-in 3850  df-ss 3860  df-nul 4212  df-if 4415  df-sn 4517  df-pr 4519  df-op 4523  df-br 5031  df-opab 5093  df-mpt 5111  df-cnv 5533  df-dm 5535  df-rn 5536
This theorem is referenced by:  limsupvaluz2  42821
  Copyright terms: Public domain W3C validator