ivthALT - Mathbox for Jeff Hankins

	Mathbox for Jeff Hankins		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > ivthALT		Structured version Visualization version GIF version

Theorem ivthALT 36887

Description: An alternate proof of the Intermediate Value Theorem ivth 25650 using topology. (Contributed by Jeff Hankins, 17-Aug-2009.) (Revised by Mario Carneiro, 15-Dec-2013.) (New usage is discouraged.) (Proof modification is discouraged.)

**Assertion**
Ref	Expression
ivthALT	⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ∃𝑥 ∈ (𝐴(,)𝐵)(𝐹‘𝑥) = 𝑈)

Distinct variable groups: 𝑥,𝐴 𝑥,𝐵 𝑥,𝐷 𝑥,𝐹 𝑥,𝑈

Proof of Theorem ivthALT Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp31 1228	. . . . . 6 ⊢ (((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵)))) → 𝐹 ∈ (𝐷–cn→ℂ))
2		cncff 25089	. . . . . 6 ⊢ (𝐹 ∈ (𝐷–cn→ℂ) → 𝐹:𝐷⟶ℂ)
3	1, 2	syl 18	. . . . 5 ⊢ (((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵)))) → 𝐹:𝐷⟶ℂ)
4		ffun 6715	. . . . 5 ⊢ (𝐹:𝐷⟶ℂ → Fun 𝐹)
5	3, 4	syl 18	. . . 4 ⊢ (((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵)))) → Fun 𝐹)
6	5	3ad2ant3 1153	. . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → Fun 𝐹)
7		iccconn 25025	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) ∈ Conn)
8	7	3adant3 1150	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) → ((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) ∈ Conn)
9	8	3ad2ant1 1151	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) ∈ Conn)
10		simpr1 1213	. . . . . . . . . . . . . 14 ⊢ ((𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵)))) → 𝐹 ∈ (𝐷–cn→ℂ))
11	10, 2	syl 18	. . . . . . . . . . . . 13 ⊢ ((𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵)))) → 𝐹:𝐷⟶ℂ)
12	11	anim2i 629	. . . . . . . . . . . 12 ⊢ (((𝐴[,]𝐵) ⊆ 𝐷 ∧ (𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐹:𝐷⟶ℂ))
13	12	3impb 1132	. . . . . . . . . . 11 ⊢ (((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵)))) → ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐹:𝐷⟶ℂ))
14	13	3ad2ant3 1153	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐹:𝐷⟶ℂ))
15	4	adantl 487	. . . . . . . . . . 11 ⊢ (((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐹:𝐷⟶ℂ) → Fun 𝐹)
16		fdm 6722	. . . . . . . . . . . . 13 ⊢ (𝐹:𝐷⟶ℂ → dom 𝐹 = 𝐷)
17	16	sseq2d 3972	. . . . . . . . . . . 12 ⊢ (𝐹:𝐷⟶ℂ → ((𝐴[,]𝐵) ⊆ dom 𝐹 ↔ (𝐴[,]𝐵) ⊆ 𝐷))
18	17	biimparc 485	. . . . . . . . . . 11 ⊢ (((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐹:𝐷⟶ℂ) → (𝐴[,]𝐵) ⊆ dom 𝐹)
19	15, 18	jca 521	. . . . . . . . . 10 ⊢ (((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐹:𝐷⟶ℂ) → (Fun 𝐹 ∧ (𝐴[,]𝐵) ⊆ dom 𝐹))
20	14, 19	syl 18	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (Fun 𝐹 ∧ (𝐴[,]𝐵) ⊆ dom 𝐹))
21		fores 6809	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ (𝐴[,]𝐵) ⊆ dom 𝐹) → (𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)–onto→(𝐹 “ (𝐴[,]𝐵)))
22	20, 21	syl 18	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)–onto→(𝐹 “ (𝐴[,]𝐵)))
23		retop 24955	. . . . . . . . . 10 ⊢ (topGen‘ran (,)) ∈ Top
24		simp332 1346	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ)
25		uniretop 24956	. . . . . . . . . . 11 ⊢ ℝ = ∪ (topGen‘ran (,))
26	25	restuni 23356	. . . . . . . . . 10 ⊢ (((topGen‘ran (,)) ∈ Top ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ) → (𝐹 “ (𝐴[,]𝐵)) = ∪ ((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵))))
27	23, 24, 26	sylancr 599	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐹 “ (𝐴[,]𝐵)) = ∪ ((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵))))
28		foeq3 6797	. . . . . . . . 9 ⊢ ((𝐹 “ (𝐴[,]𝐵)) = ∪ ((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵))) → ((𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)–onto→(𝐹 “ (𝐴[,]𝐵)) ↔ (𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)–onto→∪ ((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵)))))
29	27, 28	syl 18	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ((𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)–onto→(𝐹 “ (𝐴[,]𝐵)) ↔ (𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)–onto→∪ ((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵)))))
30	22, 29	mpbid 235	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)–onto→∪ ((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵))))
31		simp331 1345	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝐹 ∈ (𝐷–cn→ℂ))
32		ssid 3962	. . . . . . . . . . . . . . 15 ⊢ ℂ ⊆ ℂ
33		eqid 2766	. . . . . . . . . . . . . . . 16 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
34		eqid 2766	. . . . . . . . . . . . . . . 16 ⊢ ((TopOpen‘ℂ_fld) ↾_t 𝐷) = ((TopOpen‘ℂ_fld) ↾_t 𝐷)
35	33	cnfldtop 24977	. . . . . . . . . . . . . . . . . 18 ⊢ (TopOpen‘ℂ_fld) ∈ Top
36	33	cnfldtopon 24976	. . . . . . . . . . . . . . . . . . . 20 ⊢ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)
37	36	toponunii 23110	. . . . . . . . . . . . . . . . . . 19 ⊢ ℂ = ∪ (TopOpen‘ℂ_fld)
38	37	restid 17511	. . . . . . . . . . . . . . . . . 18 ⊢ ((TopOpen‘ℂ_fld) ∈ Top → ((TopOpen‘ℂ_fld) ↾_t ℂ) = (TopOpen‘ℂ_fld))
39	35, 38	ax-mp 5	. . . . . . . . . . . . . . . . 17 ⊢ ((TopOpen‘ℂ_fld) ↾_t ℂ) = (TopOpen‘ℂ_fld)
40	39	eqcomi 2775	. . . . . . . . . . . . . . . 16 ⊢ (TopOpen‘ℂ_fld) = ((TopOpen‘ℂ_fld) ↾_t ℂ)
41	33, 34, 40	cncfcn 25106	. . . . . . . . . . . . . . 15 ⊢ ((𝐷 ⊆ ℂ ∧ ℂ ⊆ ℂ) → (𝐷–cn→ℂ) = (((TopOpen‘ℂ_fld) ↾_t 𝐷) Cn (TopOpen‘ℂ_fld)))
42	32, 41	mpan2 704	. . . . . . . . . . . . . 14 ⊢ (𝐷 ⊆ ℂ → (𝐷–cn→ℂ) = (((TopOpen‘ℂ_fld) ↾_t 𝐷) Cn (TopOpen‘ℂ_fld)))
43	42	3ad2ant2 1152	. . . . . . . . . . . . 13 ⊢ (((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵)))) → (𝐷–cn→ℂ) = (((TopOpen‘ℂ_fld) ↾_t 𝐷) Cn (TopOpen‘ℂ_fld)))
44	43	3ad2ant3 1153	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐷–cn→ℂ) = (((TopOpen‘ℂ_fld) ↾_t 𝐷) Cn (TopOpen‘ℂ_fld)))
45	31, 44	eleqtrd 2868	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝐹 ∈ (((TopOpen‘ℂ_fld) ↾_t 𝐷) Cn (TopOpen‘ℂ_fld)))
46		simp31 1228	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐴[,]𝐵) ⊆ 𝐷)
47		simp32 1229	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝐷 ⊆ ℂ)
48		resttopon 23355	. . . . . . . . . . . . . 14 ⊢ (((TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ) ∧ 𝐷 ⊆ ℂ) → ((TopOpen‘ℂ_fld) ↾_t 𝐷) ∈ (TopOn‘𝐷))
49	36, 47, 48	sylancr 599	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ((TopOpen‘ℂ_fld) ↾_t 𝐷) ∈ (TopOn‘𝐷))
50		toponuni 23108	. . . . . . . . . . . . 13 ⊢ (((TopOpen‘ℂ_fld) ↾_t 𝐷) ∈ (TopOn‘𝐷) → 𝐷 = ∪ ((TopOpen‘ℂ_fld) ↾_t 𝐷))
51	49, 50	syl 18	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝐷 = ∪ ((TopOpen‘ℂ_fld) ↾_t 𝐷))
52	46, 51	sseqtrd 3976	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐴[,]𝐵) ⊆ ∪ ((TopOpen‘ℂ_fld) ↾_t 𝐷))
53		eqid 2766	. . . . . . . . . . . 12 ⊢ ∪ ((TopOpen‘ℂ_fld) ↾_t 𝐷) = ∪ ((TopOpen‘ℂ_fld) ↾_t 𝐷)
54	53	cnrest 23479	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (((TopOpen‘ℂ_fld) ↾_t 𝐷) Cn (TopOpen‘ℂ_fld)) ∧ (𝐴[,]𝐵) ⊆ ∪ ((TopOpen‘ℂ_fld) ↾_t 𝐷)) → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((((TopOpen‘ℂ_fld) ↾_t 𝐷) ↾_t (𝐴[,]𝐵)) Cn (TopOpen‘ℂ_fld)))
55	45, 52, 54	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((((TopOpen‘ℂ_fld) ↾_t 𝐷) ↾_t (𝐴[,]𝐵)) Cn (TopOpen‘ℂ_fld)))
56	35	a1i 11	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (TopOpen‘ℂ_fld) ∈ Top)
57		cnex 11199	. . . . . . . . . . . . . 14 ⊢ ℂ ∈ V
58		ssexg 5295	. . . . . . . . . . . . . 14 ⊢ ((𝐷 ⊆ ℂ ∧ ℂ ∈ V) → 𝐷 ∈ V)
59	47, 57, 58	sylancl 598	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝐷 ∈ V)
60		restabs 23359	. . . . . . . . . . . . 13 ⊢ (((TopOpen‘ℂ_fld) ∈ Top ∧ (𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ∈ V) → (((TopOpen‘ℂ_fld) ↾_t 𝐷) ↾_t (𝐴[,]𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)))
61	56, 46, 59, 60	syl3anc 1398	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (((TopOpen‘ℂ_fld) ↾_t 𝐷) ↾_t (𝐴[,]𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)))
62		iccssre 13474	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
63	62	3adant3 1150	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
64	63	3ad2ant1 1151	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐴[,]𝐵) ⊆ ℝ)
65		eqid 2766	. . . . . . . . . . . . . 14 ⊢ (topGen‘ran (,)) = (topGen‘ran (,))
66	33, 65	rerest 24998	. . . . . . . . . . . . 13 ⊢ ((𝐴[,]𝐵) ⊆ ℝ → ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) = ((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)))
67	64, 66	syl 18	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) = ((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)))
68	61, 67	eqtrd 2801	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (((TopOpen‘ℂ_fld) ↾_t 𝐷) ↾_t (𝐴[,]𝐵)) = ((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)))
69	68	oveq1d 7438	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ((((TopOpen‘ℂ_fld) ↾_t 𝐷) ↾_t (𝐴[,]𝐵)) Cn (TopOpen‘ℂ_fld)) = (((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) Cn (TopOpen‘ℂ_fld)))
70	55, 69	eleqtrd 2868	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐹 ↾ (𝐴[,]𝐵)) ∈ (((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) Cn (TopOpen‘ℂ_fld)))
71	36	a1i 11	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ))
72		df-ima 5679	. . . . . . . . . . . 12 ⊢ (𝐹 “ (𝐴[,]𝐵)) = ran (𝐹 ↾ (𝐴[,]𝐵))
73	72	eqimss2i 4001	. . . . . . . . . . 11 ⊢ ran (𝐹 ↾ (𝐴[,]𝐵)) ⊆ (𝐹 “ (𝐴[,]𝐵))
74	73	a1i 11	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ran (𝐹 ↾ (𝐴[,]𝐵)) ⊆ (𝐹 “ (𝐴[,]𝐵)))
75		ax-resscn 11175	. . . . . . . . . . 11 ⊢ ℝ ⊆ ℂ
76	24, 75	sstrdi 3952	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐹 “ (𝐴[,]𝐵)) ⊆ ℂ)
77		cnrest2 23480	. . . . . . . . . 10 ⊢ (((TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ) ∧ ran (𝐹 ↾ (𝐴[,]𝐵)) ⊆ (𝐹 “ (𝐴[,]𝐵)) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℂ) → ((𝐹 ↾ (𝐴[,]𝐵)) ∈ (((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) Cn (TopOpen‘ℂ_fld)) ↔ (𝐹 ↾ (𝐴[,]𝐵)) ∈ (((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) Cn ((TopOpen‘ℂ_fld) ↾_t (𝐹 “ (𝐴[,]𝐵))))))
78	71, 74, 76, 77	syl3anc 1398	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ((𝐹 ↾ (𝐴[,]𝐵)) ∈ (((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) Cn (TopOpen‘ℂ_fld)) ↔ (𝐹 ↾ (𝐴[,]𝐵)) ∈ (((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) Cn ((TopOpen‘ℂ_fld) ↾_t (𝐹 “ (𝐴[,]𝐵))))))
79	70, 78	mpbid 235	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐹 ↾ (𝐴[,]𝐵)) ∈ (((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) Cn ((TopOpen‘ℂ_fld) ↾_t (𝐹 “ (𝐴[,]𝐵)))))
80	33, 65	rerest 24998	. . . . . . . . . 10 ⊢ ((𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ → ((TopOpen‘ℂ_fld) ↾_t (𝐹 “ (𝐴[,]𝐵))) = ((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵))))
81	24, 80	syl 18	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ((TopOpen‘ℂ_fld) ↾_t (𝐹 “ (𝐴[,]𝐵))) = ((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵))))
82	81	oveq2d 7439	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) Cn ((TopOpen‘ℂ_fld) ↾_t (𝐹 “ (𝐴[,]𝐵)))) = (((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) Cn ((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵)))))
83	79, 82	eleqtrd 2868	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐹 ↾ (𝐴[,]𝐵)) ∈ (((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) Cn ((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵)))))
84		eqid 2766	. . . . . . . 8 ⊢ ∪ ((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵))) = ∪ ((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵)))
85	84	cnconn 23616	. . . . . . 7 ⊢ ((((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) ∈ Conn ∧ (𝐹 ↾ (𝐴[,]𝐵)):(𝐴[,]𝐵)–onto→∪ ((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵))) ∧ (𝐹 ↾ (𝐴[,]𝐵)) ∈ (((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) Cn ((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵))))) → ((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵))) ∈ Conn)
86	9, 30, 83, 85	syl3anc 1398	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵))) ∈ Conn)
87		reconn 25023	. . . . . . . . 9 ⊢ ((𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ → (((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵))) ∈ Conn ↔ ∀𝑥 ∈ (𝐹 “ (𝐴[,]𝐵))∀𝑦 ∈ (𝐹 “ (𝐴[,]𝐵))(𝑥[,]𝑦) ⊆ (𝐹 “ (𝐴[,]𝐵))))
88	87	3ad2ant2 1152	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))) → (((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵))) ∈ Conn ↔ ∀𝑥 ∈ (𝐹 “ (𝐴[,]𝐵))∀𝑦 ∈ (𝐹 “ (𝐴[,]𝐵))(𝑥[,]𝑦) ⊆ (𝐹 “ (𝐴[,]𝐵))))
89	88	3ad2ant3 1153	. . . . . . 7 ⊢ (((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵)))) → (((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵))) ∈ Conn ↔ ∀𝑥 ∈ (𝐹 “ (𝐴[,]𝐵))∀𝑦 ∈ (𝐹 “ (𝐴[,]𝐵))(𝑥[,]𝑦) ⊆ (𝐹 “ (𝐴[,]𝐵))))
90	89	3ad2ant3 1153	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (((topGen‘ran (,)) ↾_t (𝐹 “ (𝐴[,]𝐵))) ∈ Conn ↔ ∀𝑥 ∈ (𝐹 “ (𝐴[,]𝐵))∀𝑦 ∈ (𝐹 “ (𝐴[,]𝐵))(𝑥[,]𝑦) ⊆ (𝐹 “ (𝐴[,]𝐵))))
91	86, 90	mpbid 235	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ∀𝑥 ∈ (𝐹 “ (𝐴[,]𝐵))∀𝑦 ∈ (𝐹 “ (𝐴[,]𝐵))(𝑥[,]𝑦) ⊆ (𝐹 “ (𝐴[,]𝐵)))
92		simp11 1222	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝐴 ∈ ℝ)
93	92	rexrd 11277	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝐴 ∈ ℝ^*)
94		simp12 1223	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝐵 ∈ ℝ)
95	94	rexrd 11277	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝐵 ∈ ℝ^*)
96		ltle 11316	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 → 𝐴 ≤ 𝐵))
97	96	imp 412	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐴 < 𝐵) → 𝐴 ≤ 𝐵)
98	97	3adantl3 1187	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵) → 𝐴 ≤ 𝐵)
99	98	3adant3 1150	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝐴 ≤ 𝐵)
100		lbicc2 13509	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ (𝐴[,]𝐵))
101	93, 95, 99, 100	syl3anc 1398	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝐴 ∈ (𝐴[,]𝐵))
102		funfvima2 7236	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ (𝐴[,]𝐵) ⊆ dom 𝐹) → (𝐴 ∈ (𝐴[,]𝐵) → (𝐹‘𝐴) ∈ (𝐹 “ (𝐴[,]𝐵))))
103	20, 101, 102	sylc 66	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐹‘𝐴) ∈ (𝐹 “ (𝐴[,]𝐵)))
104		ubicc2 13510	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ (𝐴[,]𝐵))
105	93, 95, 99, 104	syl3anc 1398	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝐵 ∈ (𝐴[,]𝐵))
106		funfvima2 7236	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ (𝐴[,]𝐵) ⊆ dom 𝐹) → (𝐵 ∈ (𝐴[,]𝐵) → (𝐹‘𝐵) ∈ (𝐹 “ (𝐴[,]𝐵))))
107	20, 105, 106	sylc 66	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐹‘𝐵) ∈ (𝐹 “ (𝐴[,]𝐵)))
108		oveq1 7430	. . . . . . . 8 ⊢ (𝑥 = (𝐹‘𝐴) → (𝑥[,]𝑦) = ((𝐹‘𝐴)[,]𝑦))
109	108	sseq1d 3971	. . . . . . 7 ⊢ (𝑥 = (𝐹‘𝐴) → ((𝑥[,]𝑦) ⊆ (𝐹 “ (𝐴[,]𝐵)) ↔ ((𝐹‘𝐴)[,]𝑦) ⊆ (𝐹 “ (𝐴[,]𝐵))))
110		oveq2 7431	. . . . . . . 8 ⊢ (𝑦 = (𝐹‘𝐵) → ((𝐹‘𝐴)[,]𝑦) = ((𝐹‘𝐴)[,](𝐹‘𝐵)))
111	110	sseq1d 3971	. . . . . . 7 ⊢ (𝑦 = (𝐹‘𝐵) → (((𝐹‘𝐴)[,]𝑦) ⊆ (𝐹 “ (𝐴[,]𝐵)) ↔ ((𝐹‘𝐴)[,](𝐹‘𝐵)) ⊆ (𝐹 “ (𝐴[,]𝐵))))
112	109, 111	rspc2v 3595	. . . . . 6 ⊢ (((𝐹‘𝐴) ∈ (𝐹 “ (𝐴[,]𝐵)) ∧ (𝐹‘𝐵) ∈ (𝐹 “ (𝐴[,]𝐵))) → (∀𝑥 ∈ (𝐹 “ (𝐴[,]𝐵))∀𝑦 ∈ (𝐹 “ (𝐴[,]𝐵))(𝑥[,]𝑦) ⊆ (𝐹 “ (𝐴[,]𝐵)) → ((𝐹‘𝐴)[,](𝐹‘𝐵)) ⊆ (𝐹 “ (𝐴[,]𝐵))))
113	103, 107, 112	syl2anc 596	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (∀𝑥 ∈ (𝐹 “ (𝐴[,]𝐵))∀𝑦 ∈ (𝐹 “ (𝐴[,]𝐵))(𝑥[,]𝑦) ⊆ (𝐹 “ (𝐴[,]𝐵)) → ((𝐹‘𝐴)[,](𝐹‘𝐵)) ⊆ (𝐹 “ (𝐴[,]𝐵))))
114	91, 113	mpd 16	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ((𝐹‘𝐴)[,](𝐹‘𝐵)) ⊆ (𝐹 “ (𝐴[,]𝐵)))
115		ioossicc 13478	. . . . . . . 8 ⊢ ((𝐹‘𝐴)(,)(𝐹‘𝐵)) ⊆ ((𝐹‘𝐴)[,](𝐹‘𝐵))
116	115	sseli 3936	. . . . . . 7 ⊢ (𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵)) → 𝑈 ∈ ((𝐹‘𝐴)[,](𝐹‘𝐵)))
117	116	3ad2ant3 1153	. . . . . 6 ⊢ ((𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))) → 𝑈 ∈ ((𝐹‘𝐴)[,](𝐹‘𝐵)))
118	117	3ad2ant3 1153	. . . . 5 ⊢ (((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵)))) → 𝑈 ∈ ((𝐹‘𝐴)[,](𝐹‘𝐵)))
119	118	3ad2ant3 1153	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝑈 ∈ ((𝐹‘𝐴)[,](𝐹‘𝐵)))
120	114, 119	sseldd 3941	. . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝑈 ∈ (𝐹 “ (𝐴[,]𝐵)))
121		fvelima 6953	. . 3 ⊢ ((Fun 𝐹 ∧ 𝑈 ∈ (𝐹 “ (𝐴[,]𝐵))) → ∃𝑥 ∈ (𝐴[,]𝐵)(𝐹‘𝑥) = 𝑈)
122	6, 120, 121	syl2anc 596	. 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ∃𝑥 ∈ (𝐴[,]𝐵)(𝐹‘𝑥) = 𝑈)
123		simpl1 1210	. . . . . . . 8 ⊢ (((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈) → 𝑥 ∈ ℝ^*)
124	123	a1i 11	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈) → 𝑥 ∈ ℝ^*))
125		simprr 785	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) ∧ ((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈)) → (𝐹‘𝑥) = 𝑈)
126	24, 103	sseldd 3941	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐹‘𝐴) ∈ ℝ)
127		simp333 1347	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵)))
128	126	rexrd 11277	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐹‘𝐴) ∈ ℝ^*)
129	24, 107	sseldd 3941	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐹‘𝐵) ∈ ℝ)
130	129	rexrd 11277	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐹‘𝐵) ∈ ℝ^*)
131		elioo2 13431	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹‘𝐴) ∈ ℝ^* ∧ (𝐹‘𝐵) ∈ ℝ^*) → (𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵)) ↔ (𝑈 ∈ ℝ ∧ (𝐹‘𝐴) < 𝑈 ∧ 𝑈 < (𝐹‘𝐵))))
132	128, 130, 131	syl2anc 596	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵)) ↔ (𝑈 ∈ ℝ ∧ (𝐹‘𝐴) < 𝑈 ∧ 𝑈 < (𝐹‘𝐵))))
133	127, 132	mpbid 235	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝑈 ∈ ℝ ∧ (𝐹‘𝐴) < 𝑈 ∧ 𝑈 < (𝐹‘𝐵)))
134	133	simp2d 1161	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝐹‘𝐴) < 𝑈)
135	126, 134	gtned 11363	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝑈 ≠ (𝐹‘𝐴))
136	135	adantr 486	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) ∧ ((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈)) → 𝑈 ≠ (𝐹‘𝐴))
137	125, 136	eqnetrd 3028	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) ∧ ((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈)) → (𝐹‘𝑥) ≠ (𝐹‘𝐴))
138	137	neneqd 2966	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) ∧ ((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈)) → ¬ (𝐹‘𝑥) = (𝐹‘𝐴))
139		fveq2 6888	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (𝐹‘𝑥) = (𝐹‘𝐴))
140	138, 139	nsyl 141	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) ∧ ((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈)) → ¬ 𝑥 = 𝐴)
141		simp13 1224	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝑈 ∈ ℝ)
142	133	simp3d 1162	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝑈 < (𝐹‘𝐵))
143	141, 142	ltned 11364	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → 𝑈 ≠ (𝐹‘𝐵))
144	143	adantr 486	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) ∧ ((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈)) → 𝑈 ≠ (𝐹‘𝐵))
145	125, 144	eqnetrd 3028	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) ∧ ((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈)) → (𝐹‘𝑥) ≠ (𝐹‘𝐵))
146	145	neneqd 2966	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) ∧ ((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈)) → ¬ (𝐹‘𝑥) = (𝐹‘𝐵))
147		fveq2 6888	. . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → (𝐹‘𝑥) = (𝐹‘𝐵))
148	146, 147	nsyl 141	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) ∧ ((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈)) → ¬ 𝑥 = 𝐵)
149		simprl3 1239	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) ∧ ((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈)) → (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵))
150	140, 148, 149	ecase13d 1502	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) ∧ ((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈)) → (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))
151	150	ex 418	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈) → (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)))
152	124, 151	jcad 522	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈) → (𝑥 ∈ ℝ^* ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))))
153		3anass 1111	. . . . . 6 ⊢ ((𝑥 ∈ ℝ^* ∧ 𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ↔ (𝑥 ∈ ℝ^* ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)))
154	152, 153	imbitrrdi 255	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈) → (𝑥 ∈ ℝ^* ∧ 𝐴 < 𝑥 ∧ 𝑥 < 𝐵)))
155		rexr 11273	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ^*)
156		rexr 11273	. . . . . . . . 9 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ^*)
157		elicc3 36869	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝑥 ∈ (𝐴[,]𝐵) ↔ (𝑥 ∈ ℝ^ ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵))))
158	155, 156, 157	syl2an 608	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐴[,]𝐵) ↔ (𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵))))
159	158	3adant3 1150	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) → (𝑥 ∈ (𝐴[,]𝐵) ↔ (𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵))))
160	159	3ad2ant1 1151	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝑥 ∈ (𝐴[,]𝐵) ↔ (𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵))))
161	160	anbi1d 643	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ((𝑥 ∈ (𝐴[,]𝐵) ∧ (𝐹‘𝑥) = 𝑈) ↔ ((𝑥 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵 ∧ (𝑥 = 𝐴 ∨ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵) ∨ 𝑥 = 𝐵)) ∧ (𝐹‘𝑥) = 𝑈)))
162		elioo1 13430	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝑥 ∈ (𝐴(,)𝐵) ↔ (𝑥 ∈ ℝ^ ∧ 𝐴 < 𝑥 ∧ 𝑥 < 𝐵)))
163	155, 156, 162	syl2an 608	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐴(,)𝐵) ↔ (𝑥 ∈ ℝ^* ∧ 𝐴 < 𝑥 ∧ 𝑥 < 𝐵)))
164	163	3adant3 1150	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) → (𝑥 ∈ (𝐴(,)𝐵) ↔ (𝑥 ∈ ℝ^* ∧ 𝐴 < 𝑥 ∧ 𝑥 < 𝐵)))
165	164	3ad2ant1 1151	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (𝑥 ∈ (𝐴(,)𝐵) ↔ (𝑥 ∈ ℝ^* ∧ 𝐴 < 𝑥 ∧ 𝑥 < 𝐵)))
166	154, 161, 165	3imtr4d 297	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ((𝑥 ∈ (𝐴[,]𝐵) ∧ (𝐹‘𝑥) = 𝑈) → 𝑥 ∈ (𝐴(,)𝐵)))
167		simpr 490	. . . . 5 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ∧ (𝐹‘𝑥) = 𝑈) → (𝐹‘𝑥) = 𝑈)
168	167	a1i 11	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ((𝑥 ∈ (𝐴[,]𝐵) ∧ (𝐹‘𝑥) = 𝑈) → (𝐹‘𝑥) = 𝑈))
169	166, 168	jcad 522	. . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ((𝑥 ∈ (𝐴[,]𝐵) ∧ (𝐹‘𝑥) = 𝑈) → (𝑥 ∈ (𝐴(,)𝐵) ∧ (𝐹‘𝑥) = 𝑈)))
170	169	reximdv2 3178	. 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → (∃𝑥 ∈ (𝐴[,]𝐵)(𝐹‘𝑥) = 𝑈 → ∃𝑥 ∈ (𝐴(,)𝐵)(𝐹‘𝑥) = 𝑈))
171	122, 170	mpd 16	1 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑈 ∈ ℝ) ∧ 𝐴 < 𝐵 ∧ ((𝐴[,]𝐵) ⊆ 𝐷 ∧ 𝐷 ⊆ ℂ ∧ (𝐹 ∈ (𝐷–cn→ℂ) ∧ (𝐹 “ (𝐴[,]𝐵)) ⊆ ℝ ∧ 𝑈 ∈ ((𝐹‘𝐴)(,)(𝐹‘𝐵))))) → ∃𝑥 ∈ (𝐴(,)𝐵)(𝐹‘𝑥) = 𝑈)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ w3o 1102 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ≠ wne 2961 ∀wral 3082 ∃wrex 3092 Vcvv 3458 ⊆ wss 3908 ∪ cuni 4877 class class class wbr 5114 dom cdm 5666 ran crn 5667 ↾ cres 5668 “ cima 5669 Fun wfun 6537 ⟶wf 6539 –onto→wfo 6541 ‘cfv 6543 (class class class)co 7423 ℂcc 11116 ℝcr 11117 ℝ^*cxr 11260 < clt 11261 ≤ cle 11262 (,)cioo 13390 [,]cicc 13393 ↾_t crest 17498 TopOpenctopn 17499 topGenctg 17515 ℂ_fldccnfld 21559 Topctop 23087 TopOnctopon 23104 Cn ccn 23418 Conncconn 23605 –cn→ccncf 25072

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 ax-pre-sup 11196

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8703 df-map 8835 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-fi 9381 df-sup 9412 df-inf 9413 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-div 11890 df-nn 12252 df-2 12321 df-3 12322 df-4 12323 df-5 12324 df-6 12325 df-7 12326 df-8 12327 df-9 12328 df-n0 12523 df-z 12610 df-dec 12730 df-uz 12881 df-q 12991 df-rp 13035 df-xneg 13155 df-xadd 13156 df-xmul 13157 df-ioo 13394 df-ico 13396 df-icc 13397 df-fz 13554 df-seq 14058 df-exp 14118 df-cj 15176 df-re 15177 df-im 15178 df-sqrt 15312 df-abs 15313 df-struct 17232 df-slot 17267 df-ndx 17279 df-base 17295 df-plusg 17348 df-mulr 17349 df-starv 17350 df-tset 17354 df-ple 17355 df-ds 17357 df-unif 17358 df-rest 17500 df-topn 17501 df-topgen 17521 df-psmet 21551 df-xmet 21552 df-met 21553 df-bl 21554 df-mopn 21555 df-cnfld 21560 df-top 23088 df-topon 23105 df-topsp 23127 df-bases 23140 df-cld 23213 df-cn 23421 df-cnp 23422 df-conn 23606 df-xms 24514 df-ms 24515 df-cncf 25074

This theorem is used by: (None)

W3C validator