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

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

Proof of Theorem rnmptbd
Dummy variables 𝑢 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq2 5112 . . . . 5 (𝑦 = 𝑤 → (𝐵 ≤ 𝑦 ↔ 𝐵 ≤ 𝑤))
21ralbidv 3189 . . . 4 (𝑦 = 𝑤 → (∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ↔ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑤))
32cbvrexvw 3245 . . 3 (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ↔ ∃𝑤 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑤)
43a1i 11 . 2 (𝜑 → (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ↔ ∃𝑤 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑤))
5 rnmptbd.x . . 3 Ⅎ𝑥𝜑
6 nfv 1949 . . 3 Ⅎ𝑤𝜑
7 rnmptbd.b . . 3 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
85, 6, 7rnmptbdlem 46601 . 2 (𝜑 → (∃𝑤 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑤 ↔ ∃𝑤 ∈ ℝ ∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑢 ≤ 𝑤))
9 breq2 5112 . . . . . 6 (𝑤 = 𝑦 → (𝑢 ≤ 𝑤 ↔ 𝑢 ≤ 𝑦))
109ralbidv 3189 . . . . 5 (𝑤 = 𝑦 → (∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑢 ≤ 𝑤 ↔ ∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑢 ≤ 𝑦))
11 breq1 5111 . . . . . 6 (𝑢 = 𝑧 → (𝑢 ≤ 𝑦 ↔ 𝑧 ≤ 𝑦))
1211cbvralvw 3244 . . . . 5 (∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑢 ≤ 𝑦 ↔ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)
1310, 12bitrdi 290 . . . 4 (𝑤 = 𝑦 → (∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑢 ≤ 𝑤 ↔ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦))
1413cbvrexvw 3245 . . 3 (∃𝑤 ∈ ℝ ∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑢 ≤ 𝑤 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)
1514a1i 11 . 2 (𝜑 → (∃𝑤 ∈ ℝ ∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑢 ≤ 𝑤 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦))
164, 8, 153bitrd 308 1 (𝜑 → (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  Ⅎwnf 1816   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   class class class wbr 5108   ↦ cmpt 5192  ran crn 5659  ℝcr 11238   ≤ cle 11383
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398
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-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-mpt 5193  df-cnv 5666  df-dm 5668  df-rn 5669
This theorem is used by:  supxrre3rnmpt  46773
  Copyright terms: Public domain W3C validator