evth - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > evth		Structured version Visualization version GIF version

Theorem evth 25005

Description: The Extreme Value Theorem. A continuous function from a nonempty compact topological space to the reals attains its maximum at some point in the domain. (Contributed by Mario Carneiro, 12-Aug-2014.)

**Hypotheses**
Ref	Expression
bndth.1	⊢ 𝑋 = ∪ 𝐽
bndth.2	⊢ 𝐾 = (topGen‘ran (,))
bndth.3	⊢ (𝜑 → 𝐽 ∈ Comp)
bndth.4	⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
evth.5	⊢ (𝜑 → 𝑋 ≠ ∅)

**Assertion**
Ref	Expression
evth	⊢ (𝜑 → ∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ (𝐹‘𝑥))

Distinct variable groups: 𝑥,𝑦,𝐹 𝑦,𝐾 𝜑,𝑥,𝑦 𝑥,𝑋,𝑦 𝑥,𝐽,𝑦 Allowed substitution hint: 𝐾(𝑥)

Proof of Theorem evth Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		bndth.1	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
2		bndth.2	. . . . 5 ⊢ 𝐾 = (topGen‘ran (,))
3		bndth.3	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ Comp)
4	3	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → 𝐽 ∈ Comp)
5		cmptop 23419	. . . . . . . . . 10 ⊢ (𝐽 ∈ Comp → 𝐽 ∈ Top)
6	4, 5	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → 𝐽 ∈ Top)
7	1	toptopon 22939	. . . . . . . . 9 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
8	6, 7	sylib 218	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → 𝐽 ∈ (TopOn‘𝑋))
9		eqid 2735	. . . . . . . . . . 11 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
10	9	cnfldtopon 24819	. . . . . . . . . 10 ⊢ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)
11	10	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ))
12		1cnd 11254	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → 1 ∈ ℂ)
13	8, 11, 12	cnmptc 23686	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → (𝑧 ∈ 𝑋 ↦ 1) ∈ (𝐽 Cn (TopOpen‘ℂ_fld)))
14		bndth.4	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
15		uniretop 24799	. . . . . . . . . . . . . . . . . . 19 ⊢ ℝ = ∪ (topGen‘ran (,))
16	2	unieqi 4924	. . . . . . . . . . . . . . . . . . 19 ⊢ ∪ 𝐾 = ∪ (topGen‘ran (,))
17	15, 16	eqtr4i 2766	. . . . . . . . . . . . . . . . . 18 ⊢ ℝ = ∪ 𝐾
18	1, 17	cnf 23270	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋⟶ℝ)
19	14, 18	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐹:𝑋⟶ℝ)
20	19	frnd 6745	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ran 𝐹 ⊆ ℝ)
21	19	fdmd 6747	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → dom 𝐹 = 𝑋)
22		evth.5	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑋 ≠ ∅)
23	21, 22	eqnetrd 3006	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → dom 𝐹 ≠ ∅)
24		dm0rn0 5938	. . . . . . . . . . . . . . . . 17 ⊢ (dom 𝐹 = ∅ ↔ ran 𝐹 = ∅)
25	24	necon3bii 2991	. . . . . . . . . . . . . . . 16 ⊢ (dom 𝐹 ≠ ∅ ↔ ran 𝐹 ≠ ∅)
26	23, 25	sylib 218	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ran 𝐹 ≠ ∅)
27	1, 2, 3, 14	bndth 25004	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ 𝑥)
28	19	ffnd 6738	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐹 Fn 𝑋)
29		breq1 5151	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝐹‘𝑦) → (𝑧 ≤ 𝑥 ↔ (𝐹‘𝑦) ≤ 𝑥))
30	29	ralrn 7108	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐹 Fn 𝑋 → (∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑥 ↔ ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ 𝑥))
31	28, 30	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑥 ↔ ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ 𝑥))
32	31	rexbidv 3177	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ 𝑥))
33	27, 32	mpbird 257	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑥)
34	20, 26, 33	3jca 1127	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (ran 𝐹 ⊆ ℝ ∧ ran 𝐹 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑥))
35		suprcl 12226	. . . . . . . . . . . . . 14 ⊢ ((ran 𝐹 ⊆ ℝ ∧ ran 𝐹 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑥) → sup(ran 𝐹, ℝ, < ) ∈ ℝ)
36	34, 35	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → sup(ran 𝐹, ℝ, < ) ∈ ℝ)
37	36	recnd 11287	. . . . . . . . . . . 12 ⊢ (𝜑 → sup(ran 𝐹, ℝ, < ) ∈ ℂ)
38	37	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → sup(ran 𝐹, ℝ, < ) ∈ ℂ)
39	8, 11, 38	cnmptc 23686	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → (𝑧 ∈ 𝑋 ↦ sup(ran 𝐹, ℝ, < )) ∈ (𝐽 Cn (TopOpen‘ℂ_fld)))
40	19	feqmptd 6977	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹 = (𝑧 ∈ 𝑋 ↦ (𝐹‘𝑧)))
41	9	cnfldtop 24820	. . . . . . . . . . . . . 14 ⊢ (TopOpen‘ℂ_fld) ∈ Top
42		cnrest2r 23311	. . . . . . . . . . . . . 14 ⊢ ((TopOpen‘ℂ_fld) ∈ Top → (𝐽 Cn ((TopOpen‘ℂ_fld) ↾_t ℝ)) ⊆ (𝐽 Cn (TopOpen‘ℂ_fld)))
43	41, 42	ax-mp 5	. . . . . . . . . . . . 13 ⊢ (𝐽 Cn ((TopOpen‘ℂ_fld) ↾_t ℝ)) ⊆ (𝐽 Cn (TopOpen‘ℂ_fld))
44	9	tgioo2 24839	. . . . . . . . . . . . . . . 16 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
45	2, 44	eqtri 2763	. . . . . . . . . . . . . . 15 ⊢ 𝐾 = ((TopOpen‘ℂ_fld) ↾_t ℝ)
46	45	oveq2i 7442	. . . . . . . . . . . . . 14 ⊢ (𝐽 Cn 𝐾) = (𝐽 Cn ((TopOpen‘ℂ_fld) ↾_t ℝ))
47	14, 46	eleqtrdi 2849	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn ((TopOpen‘ℂ_fld) ↾_t ℝ)))
48	43, 47	sselid 3993	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn (TopOpen‘ℂ_fld)))
49	40, 48	eqeltrrd 2840	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑧 ∈ 𝑋 ↦ (𝐹‘𝑧)) ∈ (𝐽 Cn (TopOpen‘ℂ_fld)))
50	49	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → (𝑧 ∈ 𝑋 ↦ (𝐹‘𝑧)) ∈ (𝐽 Cn (TopOpen‘ℂ_fld)))
51	9	subcn 24902	. . . . . . . . . . 11 ⊢ − ∈ (((TopOpen‘ℂ_fld) ×_t (TopOpen‘ℂ_fld)) Cn (TopOpen‘ℂ_fld))
52	51	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → − ∈ (((TopOpen‘ℂ_fld) ×_t (TopOpen‘ℂ_fld)) Cn (TopOpen‘ℂ_fld)))
53	8, 39, 50, 52	cnmpt12f 23690	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → (𝑧 ∈ 𝑋 ↦ (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))) ∈ (𝐽 Cn (TopOpen‘ℂ_fld)))
54	36	ad2antrr 726	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑧 ∈ 𝑋) → sup(ran 𝐹, ℝ, < ) ∈ ℝ)
55		ffvelcdm 7101	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )}) ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) ∈ (ℝ ∖ {sup(ran 𝐹, ℝ, < )}))
56	55	adantll 714	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) ∈ (ℝ ∖ {sup(ran 𝐹, ℝ, < )}))
57		eldifsn 4791	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹‘𝑧) ∈ (ℝ ∖ {sup(ran 𝐹, ℝ, < )}) ↔ ((𝐹‘𝑧) ∈ ℝ ∧ (𝐹‘𝑧) ≠ sup(ran 𝐹, ℝ, < )))
58	56, 57	sylib 218	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑧 ∈ 𝑋) → ((𝐹‘𝑧) ∈ ℝ ∧ (𝐹‘𝑧) ≠ sup(ran 𝐹, ℝ, < )))
59	58	simpld 494	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) ∈ ℝ)
60	54, 59	resubcld 11689	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑧 ∈ 𝑋) → (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)) ∈ ℝ)
61	60	recnd 11287	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑧 ∈ 𝑋) → (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)) ∈ ℂ)
62	54	recnd 11287	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑧 ∈ 𝑋) → sup(ran 𝐹, ℝ, < ) ∈ ℂ)
63	59	recnd 11287	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) ∈ ℂ)
64	58	simprd 495	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) ≠ sup(ran 𝐹, ℝ, < ))
65	64	necomd 2994	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑧 ∈ 𝑋) → sup(ran 𝐹, ℝ, < ) ≠ (𝐹‘𝑧))
66	62, 63, 65	subne0d 11627	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑧 ∈ 𝑋) → (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)) ≠ 0)
67		eldifsn 4791	. . . . . . . . . . . . 13 ⊢ ((sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)) ∈ (ℂ ∖ {0}) ↔ ((sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)) ∈ ℂ ∧ (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)) ≠ 0))
68	61, 66, 67	sylanbrc 583	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑧 ∈ 𝑋) → (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)) ∈ (ℂ ∖ {0}))
69	68	fmpttd 7135	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → (𝑧 ∈ 𝑋 ↦ (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))):𝑋⟶(ℂ ∖ {0}))
70	69	frnd 6745	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → ran (𝑧 ∈ 𝑋 ↦ (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))) ⊆ (ℂ ∖ {0}))
71		difssd 4147	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → (ℂ ∖ {0}) ⊆ ℂ)
72		cnrest2 23310	. . . . . . . . . 10 ⊢ (((TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ) ∧ ran (𝑧 ∈ 𝑋 ↦ (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))) ⊆ (ℂ ∖ {0}) ∧ (ℂ ∖ {0}) ⊆ ℂ) → ((𝑧 ∈ 𝑋 ↦ (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))) ∈ (𝐽 Cn (TopOpen‘ℂ_fld)) ↔ (𝑧 ∈ 𝑋 ↦ (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))) ∈ (𝐽 Cn ((TopOpen‘ℂ_fld) ↾_t (ℂ ∖ {0})))))
73	11, 70, 71, 72	syl3anc 1370	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → ((𝑧 ∈ 𝑋 ↦ (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))) ∈ (𝐽 Cn (TopOpen‘ℂ_fld)) ↔ (𝑧 ∈ 𝑋 ↦ (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))) ∈ (𝐽 Cn ((TopOpen‘ℂ_fld) ↾_t (ℂ ∖ {0})))))
74	53, 73	mpbid 232	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → (𝑧 ∈ 𝑋 ↦ (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))) ∈ (𝐽 Cn ((TopOpen‘ℂ_fld) ↾_t (ℂ ∖ {0}))))
75		eqid 2735	. . . . . . . . . 10 ⊢ ((TopOpen‘ℂ_fld) ↾_t (ℂ ∖ {0})) = ((TopOpen‘ℂ_fld) ↾_t (ℂ ∖ {0}))
76	9, 75	divcn 24906	. . . . . . . . 9 ⊢ / ∈ (((TopOpen‘ℂ_fld) ×_t ((TopOpen‘ℂ_fld) ↾_t (ℂ ∖ {0}))) Cn (TopOpen‘ℂ_fld))
77	76	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → / ∈ (((TopOpen‘ℂ_fld) ×_t ((TopOpen‘ℂ_fld) ↾_t (ℂ ∖ {0}))) Cn (TopOpen‘ℂ_fld)))
78	8, 13, 74, 77	cnmpt12f 23690	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → (𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)))) ∈ (𝐽 Cn (TopOpen‘ℂ_fld)))
79	60, 66	rereccld 12092	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑧 ∈ 𝑋) → (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))) ∈ ℝ)
80	79	fmpttd 7135	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → (𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)))):𝑋⟶ℝ)
81	80	frnd 6745	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → ran (𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)))) ⊆ ℝ)
82		ax-resscn 11210	. . . . . . . . 9 ⊢ ℝ ⊆ ℂ
83	82	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → ℝ ⊆ ℂ)
84		cnrest2 23310	. . . . . . . 8 ⊢ (((TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ) ∧ ran (𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)))) ⊆ ℝ ∧ ℝ ⊆ ℂ) → ((𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)))) ∈ (𝐽 Cn (TopOpen‘ℂ_fld)) ↔ (𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)))) ∈ (𝐽 Cn ((TopOpen‘ℂ_fld) ↾_t ℝ))))
85	11, 81, 83, 84	syl3anc 1370	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → ((𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)))) ∈ (𝐽 Cn (TopOpen‘ℂ_fld)) ↔ (𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)))) ∈ (𝐽 Cn ((TopOpen‘ℂ_fld) ↾_t ℝ))))
86	78, 85	mpbid 232	. . . . . 6 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → (𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)))) ∈ (𝐽 Cn ((TopOpen‘ℂ_fld) ↾_t ℝ)))
87	86, 46	eleqtrrdi 2850	. . . . 5 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → (𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)))) ∈ (𝐽 Cn 𝐾))
88	1, 2, 4, 87	bndth 25004	. . . 4 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝑋 ((𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))))‘𝑦) ≤ 𝑥)
89	36	ad2antrr 726	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → sup(ran 𝐹, ℝ, < ) ∈ ℝ)
90		simpr 484	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ)
91		1re 11259	. . . . . . . . . . 11 ⊢ 1 ∈ ℝ
92		ifcl 4576	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℝ ∧ 1 ∈ ℝ) → if(1 ≤ 𝑥, 𝑥, 1) ∈ ℝ)
93	90, 91, 92	sylancl 586	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → if(1 ≤ 𝑥, 𝑥, 1) ∈ ℝ)
94		0red 11262	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → 0 ∈ ℝ)
95	91	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → 1 ∈ ℝ)
96		0lt1 11783	. . . . . . . . . . . . 13 ⊢ 0 < 1
97	96	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → 0 < 1)
98		max1 13224	. . . . . . . . . . . . 13 ⊢ ((1 ∈ ℝ ∧ 𝑥 ∈ ℝ) → 1 ≤ if(1 ≤ 𝑥, 𝑥, 1))
99	91, 90, 98	sylancr 587	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → 1 ≤ if(1 ≤ 𝑥, 𝑥, 1))
100	94, 95, 93, 97, 99	ltletrd 11419	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → 0 < if(1 ≤ 𝑥, 𝑥, 1))
101	100	gt0ne0d 11825	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → if(1 ≤ 𝑥, 𝑥, 1) ≠ 0)
102	93, 101	rereccld 12092	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → (1 / if(1 ≤ 𝑥, 𝑥, 1)) ∈ ℝ)
103	93, 100	recgt0d 12200	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → 0 < (1 / if(1 ≤ 𝑥, 𝑥, 1)))
104	102, 103	elrpd 13072	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → (1 / if(1 ≤ 𝑥, 𝑥, 1)) ∈ ℝ⁺)
105	89, 104	ltsubrpd 13107	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1))) < sup(ran 𝐹, ℝ, < ))
106	89, 102	resubcld 11689	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1))) ∈ ℝ)
107	106, 89	ltnled 11406	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → ((sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1))) < sup(ran 𝐹, ℝ, < ) ↔ ¬ sup(ran 𝐹, ℝ, < ) ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1)))))
108	105, 107	mpbid 232	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → ¬ sup(ran 𝐹, ℝ, < ) ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1))))
109		simprl 771	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → 𝑥 ∈ ℝ)
110		max2 13226	. . . . . . . . . . . 12 ⊢ ((1 ∈ ℝ ∧ 𝑥 ∈ ℝ) → 𝑥 ≤ if(1 ≤ 𝑥, 𝑥, 1))
111	91, 109, 110	sylancr 587	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → 𝑥 ≤ if(1 ≤ 𝑥, 𝑥, 1))
112	36	ad2antrr 726	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → sup(ran 𝐹, ℝ, < ) ∈ ℝ)
113		ffvelcdm 7101	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )}) ∧ 𝑦 ∈ 𝑋) → (𝐹‘𝑦) ∈ (ℝ ∖ {sup(ran 𝐹, ℝ, < )}))
114	113	ad2ant2l 746	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → (𝐹‘𝑦) ∈ (ℝ ∖ {sup(ran 𝐹, ℝ, < )}))
115		eldifsn 4791	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹‘𝑦) ∈ (ℝ ∖ {sup(ran 𝐹, ℝ, < )}) ↔ ((𝐹‘𝑦) ∈ ℝ ∧ (𝐹‘𝑦) ≠ sup(ran 𝐹, ℝ, < )))
116	114, 115	sylib 218	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → ((𝐹‘𝑦) ∈ ℝ ∧ (𝐹‘𝑦) ≠ sup(ran 𝐹, ℝ, < )))
117	116	simpld 494	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → (𝐹‘𝑦) ∈ ℝ)
118	112, 117	resubcld 11689	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦)) ∈ ℝ)
119		fnfvelrn 7100	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹 Fn 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐹‘𝑦) ∈ ran 𝐹)
120	28, 119	sylan 580	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝐹‘𝑦) ∈ ran 𝐹)
121		suprub 12227	. . . . . . . . . . . . . . . . . 18 ⊢ (((ran 𝐹 ⊆ ℝ ∧ ran 𝐹 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑥) ∧ (𝐹‘𝑦) ∈ ran 𝐹) → (𝐹‘𝑦) ≤ sup(ran 𝐹, ℝ, < ))
122	34, 120, 121	syl2an2r 685	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝐹‘𝑦) ≤ sup(ran 𝐹, ℝ, < ))
123	122	ad2ant2rl 749	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → (𝐹‘𝑦) ≤ sup(ran 𝐹, ℝ, < ))
124	116	simprd 495	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → (𝐹‘𝑦) ≠ sup(ran 𝐹, ℝ, < ))
125	124	necomd 2994	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → sup(ran 𝐹, ℝ, < ) ≠ (𝐹‘𝑦))
126	117, 112, 123, 125	leneltd 11413	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → (𝐹‘𝑦) < sup(ran 𝐹, ℝ, < ))
127	117, 112	posdifd 11848	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → ((𝐹‘𝑦) < sup(ran 𝐹, ℝ, < ) ↔ 0 < (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))))
128	126, 127	mpbid 232	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → 0 < (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦)))
129	128	gt0ne0d 11825	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦)) ≠ 0)
130	118, 129	rereccld 12092	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))) ∈ ℝ)
131	109, 91, 92	sylancl 586	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → if(1 ≤ 𝑥, 𝑥, 1) ∈ ℝ)
132		letr 11353	. . . . . . . . . . . 12 ⊢ (((1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))) ∈ ℝ ∧ 𝑥 ∈ ℝ ∧ if(1 ≤ 𝑥, 𝑥, 1) ∈ ℝ) → (((1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))) ≤ 𝑥 ∧ 𝑥 ≤ if(1 ≤ 𝑥, 𝑥, 1)) → (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))) ≤ if(1 ≤ 𝑥, 𝑥, 1)))
133	130, 109, 131, 132	syl3anc 1370	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → (((1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))) ≤ 𝑥 ∧ 𝑥 ≤ if(1 ≤ 𝑥, 𝑥, 1)) → (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))) ≤ if(1 ≤ 𝑥, 𝑥, 1)))
134	111, 133	mpan2d 694	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → ((1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))) ≤ 𝑥 → (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))) ≤ if(1 ≤ 𝑥, 𝑥, 1)))
135		fveq2 6907	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = 𝑦 → (𝐹‘𝑧) = (𝐹‘𝑦))
136	135	oveq2d 7447	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑦 → (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)) = (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦)))
137	136	oveq2d 7447	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑦 → (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))) = (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))))
138		eqid 2735	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧)))) = (𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))))
139		ovex 7464	. . . . . . . . . . . . 13 ⊢ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))) ∈ V
140	137, 138, 139	fvmpt 7016	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝑋 → ((𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))))‘𝑦) = (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))))
141	140	breq1d 5158	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝑋 → (((𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))))‘𝑦) ≤ 𝑥 ↔ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))) ≤ 𝑥))
142	141	ad2antll 729	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → (((𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))))‘𝑦) ≤ 𝑥 ↔ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))) ≤ 𝑥))
143	102	adantrr 717	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → (1 / if(1 ≤ 𝑥, 𝑥, 1)) ∈ ℝ)
144	100	adantrr 717	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → 0 < if(1 ≤ 𝑥, 𝑥, 1))
145	131, 144	recgt0d 12200	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → 0 < (1 / if(1 ≤ 𝑥, 𝑥, 1)))
146		lerec 12149	. . . . . . . . . . . 12 ⊢ ((((1 / if(1 ≤ 𝑥, 𝑥, 1)) ∈ ℝ ∧ 0 < (1 / if(1 ≤ 𝑥, 𝑥, 1))) ∧ ((sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦)) ∈ ℝ ∧ 0 < (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦)))) → ((1 / if(1 ≤ 𝑥, 𝑥, 1)) ≤ (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦)) ↔ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))) ≤ (1 / (1 / if(1 ≤ 𝑥, 𝑥, 1)))))
147	143, 145, 118, 128, 146	syl22anc 839	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → ((1 / if(1 ≤ 𝑥, 𝑥, 1)) ≤ (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦)) ↔ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))) ≤ (1 / (1 / if(1 ≤ 𝑥, 𝑥, 1)))))
148		lesub 11740	. . . . . . . . . . . 12 ⊢ (((1 / if(1 ≤ 𝑥, 𝑥, 1)) ∈ ℝ ∧ sup(ran 𝐹, ℝ, < ) ∈ ℝ ∧ (𝐹‘𝑦) ∈ ℝ) → ((1 / if(1 ≤ 𝑥, 𝑥, 1)) ≤ (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦)) ↔ (𝐹‘𝑦) ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1)))))
149	143, 112, 117, 148	syl3anc 1370	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → ((1 / if(1 ≤ 𝑥, 𝑥, 1)) ≤ (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦)) ↔ (𝐹‘𝑦) ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1)))))
150	131	recnd 11287	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → if(1 ≤ 𝑥, 𝑥, 1) ∈ ℂ)
151	101	adantrr 717	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → if(1 ≤ 𝑥, 𝑥, 1) ≠ 0)
152	150, 151	recrecd 12038	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → (1 / (1 / if(1 ≤ 𝑥, 𝑥, 1))) = if(1 ≤ 𝑥, 𝑥, 1))
153	152	breq2d 5160	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → ((1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))) ≤ (1 / (1 / if(1 ≤ 𝑥, 𝑥, 1))) ↔ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))) ≤ if(1 ≤ 𝑥, 𝑥, 1)))
154	147, 149, 153	3bitr3d 309	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → ((𝐹‘𝑦) ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1))) ↔ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑦))) ≤ if(1 ≤ 𝑥, 𝑥, 1)))
155	134, 142, 154	3imtr4d 294	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ 𝑋)) → (((𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))))‘𝑦) ≤ 𝑥 → (𝐹‘𝑦) ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1)))))
156	155	anassrs 467	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) ∧ 𝑦 ∈ 𝑋) → (((𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))))‘𝑦) ≤ 𝑥 → (𝐹‘𝑦) ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1)))))
157	156	ralimdva 3165	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → (∀𝑦 ∈ 𝑋 ((𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))))‘𝑦) ≤ 𝑥 → ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1)))))
158	34	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → (ran 𝐹 ⊆ ℝ ∧ ran 𝐹 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑥))
159		suprleub 12232	. . . . . . . . 9 ⊢ (((ran 𝐹 ⊆ ℝ ∧ ran 𝐹 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1))) ∈ ℝ) → (sup(ran 𝐹, ℝ, < ) ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1))) ↔ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1)))))
160	158, 106, 159	syl2anc 584	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → (sup(ran 𝐹, ℝ, < ) ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1))) ↔ ∀𝑧 ∈ ran 𝐹 𝑧 ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1)))))
161	28	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → 𝐹 Fn 𝑋)
162		breq1 5151	. . . . . . . . . 10 ⊢ (𝑧 = (𝐹‘𝑦) → (𝑧 ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1))) ↔ (𝐹‘𝑦) ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1)))))
163	162	ralrn 7108	. . . . . . . . 9 ⊢ (𝐹 Fn 𝑋 → (∀𝑧 ∈ ran 𝐹 𝑧 ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1))) ↔ ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1)))))
164	161, 163	syl 17	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → (∀𝑧 ∈ ran 𝐹 𝑧 ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1))) ↔ ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1)))))
165	160, 164	bitrd 279	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → (sup(ran 𝐹, ℝ, < ) ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1))) ↔ ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1)))))
166	157, 165	sylibrd 259	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → (∀𝑦 ∈ 𝑋 ((𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))))‘𝑦) ≤ 𝑥 → sup(ran 𝐹, ℝ, < ) ≤ (sup(ran 𝐹, ℝ, < ) − (1 / if(1 ≤ 𝑥, 𝑥, 1)))))
167	108, 166	mtod 198	. . . . 5 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) ∧ 𝑥 ∈ ℝ) → ¬ ∀𝑦 ∈ 𝑋 ((𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))))‘𝑦) ≤ 𝑥)
168	167	nrexdv 3147	. . . 4 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})) → ¬ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝑋 ((𝑧 ∈ 𝑋 ↦ (1 / (sup(ran 𝐹, ℝ, < ) − (𝐹‘𝑧))))‘𝑦) ≤ 𝑥)
169	88, 168	pm2.65da 817	. . 3 ⊢ (𝜑 → ¬ 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )}))
170	122	ralrimiva 3144	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ sup(ran 𝐹, ℝ, < ))
171		breq2 5152	. . . . . . . . . 10 ⊢ ((𝐹‘𝑥) = sup(ran 𝐹, ℝ, < ) → ((𝐹‘𝑦) ≤ (𝐹‘𝑥) ↔ (𝐹‘𝑦) ≤ sup(ran 𝐹, ℝ, < )))
172	171	ralbidv 3176	. . . . . . . . 9 ⊢ ((𝐹‘𝑥) = sup(ran 𝐹, ℝ, < ) → (∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ (𝐹‘𝑥) ↔ ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ sup(ran 𝐹, ℝ, < )))
173	170, 172	syl5ibrcom 247	. . . . . . . 8 ⊢ (𝜑 → ((𝐹‘𝑥) = sup(ran 𝐹, ℝ, < ) → ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ (𝐹‘𝑥)))
174	173	necon3bd 2952	. . . . . . 7 ⊢ (𝜑 → (¬ ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ (𝐹‘𝑥) → (𝐹‘𝑥) ≠ sup(ran 𝐹, ℝ, < )))
175	174	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (¬ ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ (𝐹‘𝑥) → (𝐹‘𝑥) ≠ sup(ran 𝐹, ℝ, < )))
176	19	ffvelcdmda 7104	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ∈ ℝ)
177		eldifsn 4791	. . . . . . . 8 ⊢ ((𝐹‘𝑥) ∈ (ℝ ∖ {sup(ran 𝐹, ℝ, < )}) ↔ ((𝐹‘𝑥) ∈ ℝ ∧ (𝐹‘𝑥) ≠ sup(ran 𝐹, ℝ, < )))
178	177	baib 535	. . . . . . 7 ⊢ ((𝐹‘𝑥) ∈ ℝ → ((𝐹‘𝑥) ∈ (ℝ ∖ {sup(ran 𝐹, ℝ, < )}) ↔ (𝐹‘𝑥) ≠ sup(ran 𝐹, ℝ, < )))
179	176, 178	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐹‘𝑥) ∈ (ℝ ∖ {sup(ran 𝐹, ℝ, < )}) ↔ (𝐹‘𝑥) ≠ sup(ran 𝐹, ℝ, < )))
180	175, 179	sylibrd 259	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (¬ ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ (𝐹‘𝑥) → (𝐹‘𝑥) ∈ (ℝ ∖ {sup(ran 𝐹, ℝ, < )})))
181	180	ralimdva 3165	. . . 4 ⊢ (𝜑 → (∀𝑥 ∈ 𝑋 ¬ ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ (𝐹‘𝑥) → ∀𝑥 ∈ 𝑋 (𝐹‘𝑥) ∈ (ℝ ∖ {sup(ran 𝐹, ℝ, < )})))
182		ffnfv 7139	. . . . . 6 ⊢ (𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )}) ↔ (𝐹 Fn 𝑋 ∧ ∀𝑥 ∈ 𝑋 (𝐹‘𝑥) ∈ (ℝ ∖ {sup(ran 𝐹, ℝ, < )})))
183	182	baib 535	. . . . 5 ⊢ (𝐹 Fn 𝑋 → (𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )}) ↔ ∀𝑥 ∈ 𝑋 (𝐹‘𝑥) ∈ (ℝ ∖ {sup(ran 𝐹, ℝ, < )})))
184	28, 183	syl 17	. . . 4 ⊢ (𝜑 → (𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )}) ↔ ∀𝑥 ∈ 𝑋 (𝐹‘𝑥) ∈ (ℝ ∖ {sup(ran 𝐹, ℝ, < )})))
185	181, 184	sylibrd 259	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝑋 ¬ ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ (𝐹‘𝑥) → 𝐹:𝑋⟶(ℝ ∖ {sup(ran 𝐹, ℝ, < )})))
186	169, 185	mtod 198	. 2 ⊢ (𝜑 → ¬ ∀𝑥 ∈ 𝑋 ¬ ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ (𝐹‘𝑥))
187		dfrex2 3071	. 2 ⊢ (∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ (𝐹‘𝑥) ↔ ¬ ∀𝑥 ∈ 𝑋 ¬ ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ (𝐹‘𝑥))
188	186, 187	sylibr 234	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝐹‘𝑦) ≤ (𝐹‘𝑥))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 ≠ wne 2938 ∀wral 3059 ∃wrex 3068 ∖ cdif 3960 ⊆ wss 3963 ∅c0 4339 ifcif 4531 {csn 4631 ∪ cuni 4912 class class class wbr 5148 ↦ cmpt 5231 dom cdm 5689 ran crn 5690 Fn wfn 6558 ⟶wf 6559 ‘cfv 6563 (class class class)co 7431 supcsup 9478 ℂcc 11151 ℝcr 11152 0cc0 11153 1c1 11154 < clt 11293 ≤ cle 11294 − cmin 11490 / cdiv 11918 (,)cioo 13384 ↾_t crest 17467 TopOpenctopn 17468 topGenctg 17484 ℂ_fldccnfld 21382 Topctop 22915 TopOnctopon 22932 Cn ccn 23248 Compccmp 23410 ×_t ctx 23584

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 ax-pre-sup 11231

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-tp 4636 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-iin 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-se 5642 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-isom 6572 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-of 7697 df-om 7888 df-1st 8013 df-2nd 8014 df-supp 8185 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-2o 8506 df-er 8744 df-map 8867 df-ixp 8937 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-fsupp 9400 df-fi 9449 df-sup 9480 df-inf 9481 df-oi 9548 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-div 11919 df-nn 12265 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12525 df-z 12612 df-dec 12732 df-uz 12877 df-q 12989 df-rp 13033 df-xneg 13152 df-xadd 13153 df-xmul 13154 df-ioo 13388 df-icc 13391 df-fz 13545 df-fzo 13692 df-seq 14040 df-exp 14100 df-hash 14367 df-cj 15135 df-re 15136 df-im 15137 df-sqrt 15271 df-abs 15272 df-struct 17181 df-sets 17198 df-slot 17216 df-ndx 17228 df-base 17246 df-ress 17275 df-plusg 17311 df-mulr 17312 df-starv 17313 df-sca 17314 df-vsca 17315 df-ip 17316 df-tset 17317 df-ple 17318 df-ds 17320 df-unif 17321 df-hom 17322 df-cco 17323 df-rest 17469 df-topn 17470 df-0g 17488 df-gsum 17489 df-topgen 17490 df-pt 17491 df-prds 17494 df-xrs 17549 df-qtop 17554 df-imas 17555 df-xps 17557 df-mre 17631 df-mrc 17632 df-acs 17634 df-mgm 18666 df-sgrp 18745 df-mnd 18761 df-submnd 18810 df-mulg 19099 df-cntz 19348 df-cmn 19815 df-psmet 21374 df-xmet 21375 df-met 21376 df-bl 21377 df-mopn 21378 df-cnfld 21383 df-top 22916 df-topon 22933 df-topsp 22955 df-bases 22969 df-cn 23251 df-cnp 23252 df-cmp 23411 df-tx 23586 df-hmeo 23779 df-xms 24346 df-ms 24347 df-tms 24348

This theorem is referenced by: evth2 25006 evthicc 25508 evthf 44965 cncmpmax 44970

W3C validator