Theorem rnmptbdlem 43030

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 2905	. . . . . 6 ⊢ Ⅎ𝑥ℝ
3		nfra1 3264	. . . . . 6 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦
4	2, 3	nfrexw 3293	. . . . 5 ⊢ Ⅎ𝑥∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦
5	1, 4	nfan 1901	. . . 4 ⊢ Ⅎ𝑥(𝜑 ∧ ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦)
6		simpr 485	. . . 4 ⊢ ((𝜑 ∧ ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦) → ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦)
7	5, 6	rnmptbdd 43019	. . 3 ⊢ ((𝜑 ∧ ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦) → ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)
8	7	ex 413	. 2 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 → ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦))
9		rnmptbdlem.y	. . 3 ⊢ Ⅎ𝑦𝜑
10		nfmpt1 5195	. . . . . . . . 9 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵)
11	10	nfrn 5880	. . . . . . . 8 ⊢ Ⅎ𝑥ran (𝑥 ∈ 𝐴 ↦ 𝐵)
12		nfv 1916	. . . . . . . 8 ⊢ Ⅎ𝑥 𝑧 ≤ 𝑦
13	11, 12	nfralw 3291	. . . . . . 7 ⊢ Ⅎ𝑥∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦
14	1, 13	nfan 1901	. . . . . 6 ⊢ Ⅎ𝑥(𝜑 ∧ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)
15		breq1 5090	. . . . . . 7 ⊢ (𝑧 = 𝐵 → (𝑧 ≤ 𝑦 ↔ 𝐵 ≤ 𝑦))
16		simplr 766	. . . . . . 7 ⊢ (((𝜑 ∧ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦) ∧ 𝑥 ∈ 𝐴) → ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)
17		eqid 2737	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
18		simpr 485	. . . . . . . 8 ⊢ (((𝜑 ∧ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
19		rnmptbdlem.b	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
20	19	adantlr 712	. . . . . . . 8 ⊢ (((𝜑 ∧ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
21	17, 18, 20	elrnmpt1d 43002	. . . . . . 7 ⊢ (((𝜑 ∧ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
22	15, 16, 21	rspcdva 3571	. . . . . 6 ⊢ (((𝜑 ∧ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦) ∧ 𝑥 ∈ 𝐴) → 𝐵 ≤ 𝑦)
23	14, 22	ralrimia 3238	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦) → ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦)
24	23	ex 413	. . . 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 396  Ⅎwnf 1784   ∈ wcel 2105  ∀wral 3062  ∃wrex 3071   class class class wbr 5087   ↦ cmpt 5170  ran crn 5608  ℝcr 10943   ≤ cle 11083

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2708  ax-sep 5238  ax-nul 5245  ax-pr 5367

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2887  df-ral 3063  df-rex 3072  df-rab 3405  df-v 3443  df-sbc 3727  df-csb 3843  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4268  df-if 4472  df-sn 4572  df-pr 4574  df-op 4578  df-br 5088  df-opab 5150  df-mpt 5171  df-cnv 5615  df-dm 5617  df-rn 5618

This theorem is referenced by:  rnmptbd  43031