Theorem rnmptbd 46410

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.

Step	Hyp	Ref	Expression
1		breq2 5110	. . . . 5 ⊢ (𝑦 = 𝑤 → (𝐵 ≤ 𝑦 ↔ 𝐵 ≤ 𝑤))
2	1	ralbidv 3189	. . . 4 ⊢ (𝑦 = 𝑤 → (∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ↔ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑤))
3	2	cbvrexvw 3245	. . 3 ⊢ (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ↔ ∃𝑤 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑤)
4	3	a1i 11	. 2 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ↔ ∃𝑤 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑤))
5		rnmptbd.x	. . 3 ⊢ Ⅎ𝑥𝜑
6		nfv 1948	. . 3 ⊢ Ⅎ𝑤𝜑
7		rnmptbd.b	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
8	5, 6, 7	rnmptbdlem 46409	. 2 ⊢ (𝜑 → (∃𝑤 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑤 ↔ ∃𝑤 ∈ ℝ ∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑢 ≤ 𝑤))
9		breq2 5110	. . . . . 6 ⊢ (𝑤 = 𝑦 → (𝑢 ≤ 𝑤 ↔ 𝑢 ≤ 𝑦))
10	9	ralbidv 3189	. . . . 5 ⊢ (𝑤 = 𝑦 → (∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑢 ≤ 𝑤 ↔ ∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑢 ≤ 𝑦))
11		breq1 5109	. . . . . 6 ⊢ (𝑢 = 𝑧 → (𝑢 ≤ 𝑦 ↔ 𝑧 ≤ 𝑦))
12	11	cbvralvw 3244	. . . . 5 ⊢ (∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑢 ≤ 𝑦 ↔ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)
13	10, 12	bitrdi 290	. . . 4 ⊢ (𝑤 = 𝑦 → (∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑢 ≤ 𝑤 ↔ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦))
14	13	cbvrexvw 3245	. . 3 ⊢ (∃𝑤 ∈ ℝ ∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑢 ≤ 𝑤 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)
15	14	a1i 11	. 2 ⊢ (𝜑 → (∃𝑤 ∈ ℝ ∀𝑢 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑢 ≤ 𝑤 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦))
16	4, 8, 15	3bitrd 308	1 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  Ⅎwnf 1815   ∈ wcel 2146  ∀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-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 4839  df-br 5107  df-opab 5171  df-mpt 5190  df-cnv 5663  df-dm 5665  df-rn 5666

This theorem is used by:  supxrre3rnmpt  46581