Theorem rnmptbdlem 42754

Description: Boundness above of the range of a function in maps-to notation. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
rnmptbdlem.x	⊢ Ⅎ𝑥𝜑
rnmptbdlem.y	⊢ Ⅎ𝑦𝜑
rnmptbdlem.b	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)

Assertion

Ref	Expression
rnmptbdlem	⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦))

Distinct variable groups:   𝑦,𝐴,𝑧   𝑦,𝐵,𝑧   𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝐴(𝑥)   𝐵(𝑥)   𝑉(𝑥,𝑦,𝑧)

Proof of Theorem rnmptbdlem

Step	Hyp	Ref	Expression
1		rnmptbdlem.x	. . . . 5 ⊢ Ⅎ𝑥𝜑
2		nfcv 2908	. . . . . 6 ⊢ Ⅎ𝑥ℝ
3		nfra1 3144	. . . . . 6 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦
4	2, 3	nfrex 3239	. . . . 5 ⊢ Ⅎ𝑥∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦
5	1, 4	nfan 1905	. . . 4 ⊢ Ⅎ𝑥(𝜑 ∧ ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦)
6		simpr 484	. . . 4 ⊢ ((𝜑 ∧ ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦) → ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦)
7	5, 6	rnmptbdd 42743	. . 3 ⊢ ((𝜑 ∧ ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦) → ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)
8	7	ex 412	. 2 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 → ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦))
9		rnmptbdlem.y	. . 3 ⊢ Ⅎ𝑦𝜑
10		nfmpt1 5186	. . . . . . . . 9 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵)
11	10	nfrn 5858	. . . . . . . 8 ⊢ Ⅎ𝑥ran (𝑥 ∈ 𝐴 ↦ 𝐵)
12		nfv 1920	. . . . . . . 8 ⊢ Ⅎ𝑥 𝑧 ≤ 𝑦
13	11, 12	nfralw 3151	. . . . . . 7 ⊢ Ⅎ𝑥∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦
14	1, 13	nfan 1905	. . . . . 6 ⊢ Ⅎ𝑥(𝜑 ∧ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)
15		breq1 5081	. . . . . . 7 ⊢ (𝑧 = 𝐵 → (𝑧 ≤ 𝑦 ↔ 𝐵 ≤ 𝑦))
16		simplr 765	. . . . . . 7 ⊢ (((𝜑 ∧ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦) ∧ 𝑥 ∈ 𝐴) → ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)
17		eqid 2739	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
18		simpr 484	. . . . . . . 8 ⊢ (((𝜑 ∧ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
19		rnmptbdlem.b	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
20	19	adantlr 711	. . . . . . . 8 ⊢ (((𝜑 ∧ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
21	17, 18, 20	elrnmpt1d 42726	. . . . . . 7 ⊢ (((𝜑 ∧ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
22	15, 16, 21	rspcdva 3562	. . . . . 6 ⊢ (((𝜑 ∧ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦) ∧ 𝑥 ∈ 𝐴) → 𝐵 ≤ 𝑦)
23	14, 22	ralrimia 3428	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦) → ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦)
24	23	ex 412	. . . 4 ⊢ (𝜑 → (∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦 → ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦))
25	24	a1d 25	. . 3 ⊢ (𝜑 → (𝑦 ∈ ℝ → (∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦 → ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦)))
26	9, 25	reximdai 3241	. 2 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦))
27	8, 26	impbid 211	1 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395  Ⅎwnf 1789   ∈ wcel 2109  ∀wral 3065  ∃wrex 3066   class class class wbr 5078   ↦ cmpt 5161  ran crn 5589  ℝcr 10854   ≤ cle 10994

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-sep 5226  ax-nul 5233  ax-pr 5355

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ral 3070  df-rex 3071  df-rab 3074  df-v 3432  df-sbc 3720  df-csb 3837  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-nul 4262  df-if 4465  df-sn 4567  df-pr 4569  df-op 4573  df-br 5079  df-opab 5141  df-mpt 5162  df-cnv 5596  df-dm 5598  df-rn 5599

This theorem is referenced by:  rnmptbd  42755