Theorem rnmptbdd 45689

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.

Step	Hyp	Ref	Expression
1		rnmptbdd.x	. . 3 ⊢ Ⅎ𝑥𝜑
2		rnmptbdd.b	. . . 4 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦)
3		breq2 5076	. . . . . 6 ⊢ (𝑦 = 𝑣 → (𝐵 ≤ 𝑦 ↔ 𝐵 ≤ 𝑣))
4	3	ralbidv 3162	. . . . 5 ⊢ (𝑦 = 𝑣 → (∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ↔ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑣))
5	4	cbvrexvw 3218	. . . 4 ⊢ (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ↔ ∃𝑣 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑣)
6	2, 5	sylib 219	. . 3 ⊢ (𝜑 → ∃𝑣 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑣)
7	1, 6	rnmptbddlem 45688	. 2 ⊢ (𝜑 → ∃𝑣 ∈ ℝ ∀𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑣)
8		breq2 5076	. . . . 5 ⊢ (𝑣 = 𝑦 → (𝑤 ≤ 𝑣 ↔ 𝑤 ≤ 𝑦))
9	8	ralbidv 3162	. . . 4 ⊢ (𝑣 = 𝑦 → (∀𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑣 ↔ ∀𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑦))
10		breq1 5075	. . . . 5 ⊢ (𝑤 = 𝑧 → (𝑤 ≤ 𝑦 ↔ 𝑧 ≤ 𝑦))
11	10	cbvralvw 3217	. . . 4 ⊢ (∀𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑦 ↔ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)
12	9, 11	bitrdi 288	. . 3 ⊢ (𝑣 = 𝑦 → (∀𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑣 ↔ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦))
13	12	cbvrexvw 3218	. 2 ⊢ (∃𝑣 ∈ ℝ ∀𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑣 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)
14	7, 13	sylib 219	1 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)

Syntax hints:   → wi 4  Ⅎwnf 1790  ∀wral 3053  ∃wrex 3063   class class class wbr 5072   ↦ cmpt 5153  ran crn 5619  ℝcr 11028   ≤ cle 11171

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 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-pr 5362

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-br 5073  df-opab 5135  df-mpt 5154  df-cnv 5626  df-dm 5628  df-rn 5629

This theorem is referenced by:  suprclrnmpt  45695  suprubrnmpt2  45696  suprubrnmpt  45697  rnmptbdlem  45699  supxrrernmpt  45864  suprleubrnmpt  45865  supminfrnmpt  45888