Theorem suprnmpt 45418

Description: An explicit bound for the range of a bounded function. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

Hypotheses

Ref	Expression
suprnmpt.a	⊢ (𝜑 → 𝐴 ≠ ∅)
suprnmpt.b	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ)
suprnmpt.bnd	⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦)
suprnmpt.f	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
suprnmpt.c	⊢ 𝐶 = sup(ran 𝐹, ℝ, < )

Assertion

Ref	Expression
suprnmpt	⊢ (𝜑 → (𝐶 ∈ ℝ ∧ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝐶))

Distinct variable groups:   𝑥,𝐴   𝑦,𝐹   𝜑,𝑥,𝑦

Allowed substitution hints:   𝐴(𝑦)   𝐵(𝑥,𝑦)   𝐶(𝑥,𝑦)   𝐹(𝑥)

Proof of Theorem suprnmpt

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		suprnmpt.c	. . 3 ⊢ 𝐶 = sup(ran 𝐹, ℝ, < )
2		suprnmpt.b	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ)
3	2	ralrimiva 3128	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ ℝ)
4		suprnmpt.f	. . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
5	4	rnmptss 7068	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ ℝ → ran 𝐹 ⊆ ℝ)
6	3, 5	syl 17	. . . 4 ⊢ (𝜑 → ran 𝐹 ⊆ ℝ)
7		nfv 1915	. . . . 5 ⊢ Ⅎ𝑥𝜑
8		suprnmpt.a	. . . . 5 ⊢ (𝜑 → 𝐴 ≠ ∅)
9	7, 2, 4, 8	rnmptn0 6202	. . . 4 ⊢ (𝜑 → ran 𝐹 ≠ ∅)
10		suprnmpt.bnd	. . . . 5 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦)
11		nfv 1915	. . . . . 6 ⊢ Ⅎ𝑦𝜑
12		nfre1 3261	. . . . . 6 ⊢ Ⅎ𝑦∃𝑦 ∈ ℝ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑦
13		simp2 1137	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ ∧ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦) → 𝑦 ∈ ℝ)
14		simpl1 1192	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ ∧ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦) ∧ 𝑧 ∈ ran 𝐹) → 𝜑)
15		simpl3 1194	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ ∧ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦) ∧ 𝑧 ∈ ran 𝐹) → ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦)
16		vex 3444	. . . . . . . . . . . . . 14 ⊢ 𝑧 ∈ V
17	4	elrnmpt 5907	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ V → (𝑧 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵))
18	16, 17	ax-mp 5	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵)
19	18	biimpi 216	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ ran 𝐹 → ∃𝑥 ∈ 𝐴 𝑧 = 𝐵)
20	19	adantl 481	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ ∧ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦) ∧ 𝑧 ∈ ran 𝐹) → ∃𝑥 ∈ 𝐴 𝑧 = 𝐵)
21		simp3 1138	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ∧ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵) → ∃𝑥 ∈ 𝐴 𝑧 = 𝐵)
22		nfra1 3260	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦
23		nfre1 3261	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥∃𝑥 ∈ 𝐴 𝑧 = 𝐵
24	7, 22, 23	nf3an 1902	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥(𝜑 ∧ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ∧ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵)
25		nfv 1915	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥 𝑧 ≤ 𝑦
26		simp3 1138	. . . . . . . . . . . . . . . 16 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ∧ 𝑥 ∈ 𝐴 ∧ 𝑧 = 𝐵) → 𝑧 = 𝐵)
27		rspa 3225	. . . . . . . . . . . . . . . . 17 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ∧ 𝑥 ∈ 𝐴) → 𝐵 ≤ 𝑦)
28	27	3adant3 1132	. . . . . . . . . . . . . . . 16 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ∧ 𝑥 ∈ 𝐴 ∧ 𝑧 = 𝐵) → 𝐵 ≤ 𝑦)
29	26, 28	eqbrtrd 5120	. . . . . . . . . . . . . . 15 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ∧ 𝑥 ∈ 𝐴 ∧ 𝑧 = 𝐵) → 𝑧 ≤ 𝑦)
30	29	3exp 1119	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 → (𝑥 ∈ 𝐴 → (𝑧 = 𝐵 → 𝑧 ≤ 𝑦)))
31	30	3ad2ant2 1134	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ∧ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵) → (𝑥 ∈ 𝐴 → (𝑧 = 𝐵 → 𝑧 ≤ 𝑦)))
32	24, 25, 31	rexlimd 3243	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ∧ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵) → (∃𝑥 ∈ 𝐴 𝑧 = 𝐵 → 𝑧 ≤ 𝑦))
33	21, 32	mpd 15	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 ∧ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵) → 𝑧 ≤ 𝑦)
34	14, 15, 20, 33	syl3anc 1373	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ ∧ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦) ∧ 𝑧 ∈ ran 𝐹) → 𝑧 ≤ 𝑦)
35	34	ralrimiva 3128	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ ∧ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦) → ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑦)
36		19.8a 2188	. . . . . . . . 9 ⊢ ((𝑦 ∈ ℝ ∧ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑦) → ∃𝑦(𝑦 ∈ ℝ ∧ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑦))
37	13, 35, 36	syl2anc 584	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ ∧ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦) → ∃𝑦(𝑦 ∈ ℝ ∧ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑦))
38		df-rex 3061	. . . . . . . 8 ⊢ (∃𝑦 ∈ ℝ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑦 ↔ ∃𝑦(𝑦 ∈ ℝ ∧ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑦))
39	37, 38	sylibr 234	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ ∧ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦) → ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑦)
40	39	3exp 1119	. . . . . 6 ⊢ (𝜑 → (𝑦 ∈ ℝ → (∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 → ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑦)))
41	11, 12, 40	rexlimd 3243	. . . . 5 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦 → ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑦))
42	10, 41	mpd 15	. . . 4 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑦)
43		suprcl 12102	. . . 4 ⊢ ((ran 𝐹 ⊆ ℝ ∧ ran 𝐹 ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑦) → sup(ran 𝐹, ℝ, < ) ∈ ℝ)
44	6, 9, 42, 43	syl3anc 1373	. . 3 ⊢ (𝜑 → sup(ran 𝐹, ℝ, < ) ∈ ℝ)
45	1, 44	eqeltrid 2840	. 2 ⊢ (𝜑 → 𝐶 ∈ ℝ)
46	6	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ran 𝐹 ⊆ ℝ)
47		simpr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
48	4	elrnmpt1 5909	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ ℝ) → 𝐵 ∈ ran 𝐹)
49	47, 2, 48	syl2anc 584	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ran 𝐹)
50	49	ne0d 4294	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ran 𝐹 ≠ ∅)
51	42	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑦)
52		suprub 12103	. . . . 5 ⊢ (((ran 𝐹 ⊆ ℝ ∧ ran 𝐹 ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑦) ∧ 𝐵 ∈ ran 𝐹) → 𝐵 ≤ sup(ran 𝐹, ℝ, < ))
53	46, 50, 51, 49, 52	syl31anc 1375	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ≤ sup(ran 𝐹, ℝ, < ))
54	53, 1	breqtrrdi 5140	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ≤ 𝐶)
55	54	ralrimiva 3128	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝐶)
56	45, 55	jca 511	1 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝐶))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541  ∃wex 1780   ∈ wcel 2113   ≠ wne 2932  ∀wral 3051  ∃wrex 3060  Vcvv 3440   ⊆ wss 3901  ∅c0 4285   class class class wbr 5098   ↦ cmpt 5179  ran crn 5625  supcsup 9343  ℝcr 11025   < clt 11166   ≤ cle 11167

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 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-resscn 11083  ax-1cn 11084  ax-icn 11085  ax-addcl 11086  ax-addrcl 11087  ax-mulcl 11088  ax-mulrcl 11089  ax-mulcom 11090  ax-addass 11091  ax-mulass 11092  ax-distr 11093  ax-i2m1 11094  ax-1ne0 11095  ax-1rid 11096  ax-rnegex 11097  ax-rrecex 11098  ax-cnre 11099  ax-pre-lttri 11100  ax-pre-lttrn 11101  ax-pre-ltadd 11102  ax-pre-mulgt0 11103  ax-pre-sup 11104

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-po 5532  df-so 5533  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-er 8635  df-en 8884  df-dom 8885  df-sdom 8886  df-sup 9345  df-pnf 11168  df-mnf 11169  df-xr 11170  df-ltxr 11171  df-le 11172  df-sub 11366  df-neg 11367

This theorem is referenced by:  ioodvbdlimc1lem1  46175  ioodvbdlimc1lem2  46176  ioodvbdlimc2lem  46178