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

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

Proof of Theorem rnmptbdd
Dummy variables 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rnmptbdd.x . . 3 Ⅎ𝑥𝜑
2 rnmptbdd.b . . . 4 (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦)
3 breq2 5110 . . . . . 6 (𝑦 = 𝑣 → (𝐵 ≤ 𝑦 ↔ 𝐵 ≤ 𝑣))
43ralbidv 3189 . . . . 5 (𝑦 = 𝑣 → (∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ↔ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑣))
54cbvrexvw 3245 . . . 4 (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ↔ ∃𝑣 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑣)
62, 5sylib 221 . . 3 (𝜑 → ∃𝑣 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑣)
71, 6rnmptbddlem 46401 . 2 (𝜑 → ∃𝑣 ∈ ℝ ∀𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑣)
8 breq2 5110 . . . . 5 (𝑣 = 𝑦 → (𝑤 ≤ 𝑣 ↔ 𝑤 ≤ 𝑦))
98ralbidv 3189 . . . 4 (𝑣 = 𝑦 → (∀𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑣 ↔ ∀𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑦))
10 breq1 5109 . . . . 5 (𝑤 = 𝑧 → (𝑤 ≤ 𝑦 ↔ 𝑧 ≤ 𝑦))
1110cbvralvw 3244 . . . 4 (∀𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑦 ↔ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)
129, 11bitrdi 290 . . 3 (𝑣 = 𝑦 → (∀𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑣 ↔ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦))
1312cbvrexvw 3245 . 2 (∃𝑣 ∈ ℝ ∀𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑣 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)
147, 13sylib 221 1 (𝜑 → ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4  Ⅎwnf 1815  ∀wral 3080  ∃wrex 3090   class class class wbr 5106   ↦ cmpt 5189  ran crn 5656  ℝcr 11212   ≤ cle 11357
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5252  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  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-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 4839  df-br 5107  df-opab 5171  df-mpt 5190  df-cnv 5663  df-dm 5665  df-rn 5666
This theorem is used by:  suprclrnmpt  46408  suprubrnmpt2  46409  suprubrnmpt  46410  rnmptbdlem  46412  supxrrernmpt  46576  suprleubrnmpt  46577  supminfrnmpt  46600
  Copyright terms: Public domain W3C validator