ivthlem3 - Metamath Proof Explorer

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

Theorem ivthlem3 25502

Description: Lemma for ivth 25503, the intermediate value theorem. Show that (𝐹‘𝐶) cannot be greater than 𝑈, and so establish the existence of a root of the function. (Contributed by Mario Carneiro, 30-Apr-2014.) (Revised by Mario Carneiro, 17-Jun-2014.)

**Hypotheses**
Ref	Expression
ivth.1	⊢ (𝜑 → 𝐴 ∈ ℝ)
ivth.2	⊢ (𝜑 → 𝐵 ∈ ℝ)
ivth.3	⊢ (𝜑 → 𝑈 ∈ ℝ)
ivth.4	⊢ (𝜑 → 𝐴 < 𝐵)
ivth.5	⊢ (𝜑 → (𝐴[,]𝐵) ⊆ 𝐷)
ivth.7	⊢ (𝜑 → 𝐹 ∈ (𝐷–cn→ℂ))
ivth.8	⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐹‘𝑥) ∈ ℝ)
ivth.9	⊢ (𝜑 → ((𝐹‘𝐴) < 𝑈 ∧ 𝑈 < (𝐹‘𝐵)))
ivth.10	⊢ 𝑆 = {𝑥 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑥) ≤ 𝑈}
ivth.11	⊢ 𝐶 = sup(𝑆, ℝ, < )

**Assertion**
Ref	Expression
ivthlem3	⊢ (𝜑 → (𝐶 ∈ (𝐴(,)𝐵) ∧ (𝐹‘𝐶) = 𝑈))

Distinct variable groups: 𝑥,𝐵 𝑥,𝐷 𝑥,𝐹 𝜑,𝑥 𝑥,𝐴 𝑥,𝐶 𝑥,𝑆 𝑥,𝑈

Proof of Theorem ivthlem3 Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ivth.11	. . . 4 ⊢ 𝐶 = sup(𝑆, ℝ, < )
2		ivth.10	. . . . . . 7 ⊢ 𝑆 = {𝑥 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑥) ≤ 𝑈}
3	2	ssrab3 4092	. . . . . 6 ⊢ 𝑆 ⊆ (𝐴[,]𝐵)
4		ivth.1	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ)
5		ivth.2	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ)
6		iccssre 13466	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
7	4, 5, 6	syl2anc 584	. . . . . 6 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ)
8	3, 7	sstrid 4007	. . . . 5 ⊢ (𝜑 → 𝑆 ⊆ ℝ)
9		ivth.3	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ ℝ)
10		ivth.4	. . . . . . . 8 ⊢ (𝜑 → 𝐴 < 𝐵)
11		ivth.5	. . . . . . . 8 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ 𝐷)
12		ivth.7	. . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ (𝐷–cn→ℂ))
13		ivth.8	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐹‘𝑥) ∈ ℝ)
14		ivth.9	. . . . . . . 8 ⊢ (𝜑 → ((𝐹‘𝐴) < 𝑈 ∧ 𝑈 < (𝐹‘𝐵)))
15	4, 5, 9, 10, 11, 12, 13, 14, 2	ivthlem1 25500	. . . . . . 7 ⊢ (𝜑 → (𝐴 ∈ 𝑆 ∧ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝐵))
16	15	simpld 494	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑆)
17	16	ne0d 4348	. . . . 5 ⊢ (𝜑 → 𝑆 ≠ ∅)
18	15	simprd 495	. . . . . 6 ⊢ (𝜑 → ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝐵)
19		brralrspcev 5208	. . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝐵) → ∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝑥)
20	5, 18, 19	syl2anc 584	. . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝑥)
21	8, 17, 20	suprcld 12229	. . . 4 ⊢ (𝜑 → sup(𝑆, ℝ, < ) ∈ ℝ)
22	1, 21	eqeltrid 2843	. . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ)
23	14	simpld 494	. . . . 5 ⊢ (𝜑 → (𝐹‘𝐴) < 𝑈)
24	4, 5, 9, 10, 11, 12, 13, 14, 2, 1	ivthlem2 25501	. . . . . 6 ⊢ (𝜑 → ¬ (𝐹‘𝐶) < 𝑈)
25	12	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) → 𝐹 ∈ (𝐷–cn→ℂ))
26	8, 17, 20, 16	suprubd 12228	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 ≤ sup(𝑆, ℝ, < ))
27	26, 1	breqtrrdi 5190	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ≤ 𝐶)
28	8, 17, 20	3jca 1127	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑆 ⊆ ℝ ∧ 𝑆 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝑥))
29		suprleub 12232	. . . . . . . . . . . . . . 15 ⊢ (((𝑆 ⊆ ℝ ∧ 𝑆 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝑥) ∧ 𝐵 ∈ ℝ) → (sup(𝑆, ℝ, < ) ≤ 𝐵 ↔ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝐵))
30	28, 5, 29	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (sup(𝑆, ℝ, < ) ≤ 𝐵 ↔ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝐵))
31	18, 30	mpbird 257	. . . . . . . . . . . . 13 ⊢ (𝜑 → sup(𝑆, ℝ, < ) ≤ 𝐵)
32	1, 31	eqbrtrid 5183	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐶 ≤ 𝐵)
33		elicc2 13449	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))
34	4, 5, 33	syl2anc 584	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))
35	22, 27, 32, 34	mpbir3and 1341	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐶 ∈ (𝐴[,]𝐵))
36	11, 35	sseldd 3996	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ 𝐷)
37	36	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) → 𝐶 ∈ 𝐷)
38		fveq2 6907	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐶 → (𝐹‘𝑥) = (𝐹‘𝐶))
39	38	eleq1d 2824	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐶 → ((𝐹‘𝑥) ∈ ℝ ↔ (𝐹‘𝐶) ∈ ℝ))
40	13	ralrimiva 3144	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴[,]𝐵)(𝐹‘𝑥) ∈ ℝ)
41	39, 40, 35	rspcdva 3623	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ℝ)
42		difrp 13071	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ ℝ ∧ (𝐹‘𝐶) ∈ ℝ) → (𝑈 < (𝐹‘𝐶) ↔ ((𝐹‘𝐶) − 𝑈) ∈ ℝ⁺))
43	9, 41, 42	syl2anc 584	. . . . . . . . . 10 ⊢ (𝜑 → (𝑈 < (𝐹‘𝐶) ↔ ((𝐹‘𝐶) − 𝑈) ∈ ℝ⁺))
44	43	biimpa 476	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) → ((𝐹‘𝐶) − 𝑈) ∈ ℝ⁺)
45		cncfi 24934	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝐷–cn→ℂ) ∧ 𝐶 ∈ 𝐷 ∧ ((𝐹‘𝐶) − 𝑈) ∈ ℝ⁺) → ∃𝑧 ∈ ℝ⁺ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈)))
46	25, 37, 44, 45	syl3anc 1370	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) → ∃𝑧 ∈ ℝ⁺ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈)))
47		ssralv 4064	. . . . . . . . . . . 12 ⊢ ((𝐴[,]𝐵) ⊆ 𝐷 → (∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈)) → ∀𝑦 ∈ (𝐴[,]𝐵)((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈))))
48	11, 47	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈)) → ∀𝑦 ∈ (𝐴[,]𝐵)((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈))))
49	48	ad2antrr 726	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → (∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈)) → ∀𝑦 ∈ (𝐴[,]𝐵)((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈))))
50	22	ad2antrr 726	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → 𝐶 ∈ ℝ)
51		ltsubrp 13069	. . . . . . . . . . . . . . 15 ⊢ ((𝐶 ∈ ℝ ∧ 𝑧 ∈ ℝ⁺) → (𝐶 − 𝑧) < 𝐶)
52	50, 51	sylancom 588	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → (𝐶 − 𝑧) < 𝐶)
53	52, 1	breqtrdi 5189	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → (𝐶 − 𝑧) < sup(𝑆, ℝ, < ))
54	28	ad2antrr 726	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → (𝑆 ⊆ ℝ ∧ 𝑆 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝑥))
55		rpre 13041	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ ℝ⁺ → 𝑧 ∈ ℝ)
56	55	adantl 481	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → 𝑧 ∈ ℝ)
57	50, 56	resubcld 11689	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → (𝐶 − 𝑧) ∈ ℝ)
58		suprlub 12230	. . . . . . . . . . . . . 14 ⊢ (((𝑆 ⊆ ℝ ∧ 𝑆 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝑥) ∧ (𝐶 − 𝑧) ∈ ℝ) → ((𝐶 − 𝑧) < sup(𝑆, ℝ, < ) ↔ ∃𝑦 ∈ 𝑆 (𝐶 − 𝑧) < 𝑦))
59	54, 57, 58	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → ((𝐶 − 𝑧) < sup(𝑆, ℝ, < ) ↔ ∃𝑦 ∈ 𝑆 (𝐶 − 𝑧) < 𝑦))
60	53, 59	mpbid 232	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → ∃𝑦 ∈ 𝑆 (𝐶 − 𝑧) < 𝑦)
61	3	sseli 3991	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ 𝑆 → 𝑦 ∈ (𝐴[,]𝐵))
62	61	ad2antrl 728	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑆 ∧ (𝐶 − 𝑧) < 𝑦)) → 𝑦 ∈ (𝐴[,]𝐵))
63		simplll 775	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑆 ∧ (𝐶 − 𝑧) < 𝑦)) → 𝜑)
64	63, 7	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑆 ∧ (𝐶 − 𝑧) < 𝑦)) → (𝐴[,]𝐵) ⊆ ℝ)
65	64, 62	sseldd 3996	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑆 ∧ (𝐶 − 𝑧) < 𝑦)) → 𝑦 ∈ ℝ)
66	63, 22	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑆 ∧ (𝐶 − 𝑧) < 𝑦)) → 𝐶 ∈ ℝ)
67	63, 28	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑆 ∧ (𝐶 − 𝑧) < 𝑦)) → (𝑆 ⊆ ℝ ∧ 𝑆 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝑥))
68		simprl 771	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑆 ∧ (𝐶 − 𝑧) < 𝑦)) → 𝑦 ∈ 𝑆)
69		suprub 12227	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑆 ⊆ ℝ ∧ 𝑆 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝑥) ∧ 𝑦 ∈ 𝑆) → 𝑦 ≤ sup(𝑆, ℝ, < ))
70	67, 68, 69	syl2anc 584	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑆 ∧ (𝐶 − 𝑧) < 𝑦)) → 𝑦 ≤ sup(𝑆, ℝ, < ))
71	70, 1	breqtrrdi 5190	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑆 ∧ (𝐶 − 𝑧) < 𝑦)) → 𝑦 ≤ 𝐶)
72	65, 66, 71	abssuble0d 15468	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑆 ∧ (𝐶 − 𝑧) < 𝑦)) → (abs‘(𝑦 − 𝐶)) = (𝐶 − 𝑦))
73	56	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑆 ∧ (𝐶 − 𝑧) < 𝑦)) → 𝑧 ∈ ℝ)
74		simprr 773	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑆 ∧ (𝐶 − 𝑧) < 𝑦)) → (𝐶 − 𝑧) < 𝑦)
75	66, 73, 65, 74	ltsub23d 11866	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑆 ∧ (𝐶 − 𝑧) < 𝑦)) → (𝐶 − 𝑦) < 𝑧)
76	72, 75	eqbrtrd 5170	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑆 ∧ (𝐶 − 𝑧) < 𝑦)) → (abs‘(𝑦 − 𝐶)) < 𝑧)
77	62, 76, 68	jca32 515	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑆 ∧ (𝐶 − 𝑧) < 𝑦)) → (𝑦 ∈ (𝐴[,]𝐵) ∧ ((abs‘(𝑦 − 𝐶)) < 𝑧 ∧ 𝑦 ∈ 𝑆)))
78	77	ex 412	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → ((𝑦 ∈ 𝑆 ∧ (𝐶 − 𝑧) < 𝑦) → (𝑦 ∈ (𝐴[,]𝐵) ∧ ((abs‘(𝑦 − 𝐶)) < 𝑧 ∧ 𝑦 ∈ 𝑆))))
79	78	reximdv2 3162	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → (∃𝑦 ∈ 𝑆 (𝐶 − 𝑧) < 𝑦 → ∃𝑦 ∈ (𝐴[,]𝐵)((abs‘(𝑦 − 𝐶)) < 𝑧 ∧ 𝑦 ∈ 𝑆)))
80	60, 79	mpd 15	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → ∃𝑦 ∈ (𝐴[,]𝐵)((abs‘(𝑦 − 𝐶)) < 𝑧 ∧ 𝑦 ∈ 𝑆))
81		r19.29 3112	. . . . . . . . . . . 12 ⊢ ((∀𝑦 ∈ (𝐴[,]𝐵)((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈)) ∧ ∃𝑦 ∈ (𝐴[,]𝐵)((abs‘(𝑦 − 𝐶)) < 𝑧 ∧ 𝑦 ∈ 𝑆)) → ∃𝑦 ∈ (𝐴[,]𝐵)(((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈)) ∧ ((abs‘(𝑦 − 𝐶)) < 𝑧 ∧ 𝑦 ∈ 𝑆)))
82		pm3.45 622	. . . . . . . . . . . . . . 15 ⊢ (((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈)) → (((abs‘(𝑦 − 𝐶)) < 𝑧 ∧ 𝑦 ∈ 𝑆) → ((abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈) ∧ 𝑦 ∈ 𝑆)))
83	82	imp 406	. . . . . . . . . . . . . 14 ⊢ ((((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈)) ∧ ((abs‘(𝑦 − 𝐶)) < 𝑧 ∧ 𝑦 ∈ 𝑆)) → ((abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈) ∧ 𝑦 ∈ 𝑆))
84		fveq2 6907	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦))
85	84	eleq1d 2824	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑥) ∈ ℝ ↔ (𝐹‘𝑦) ∈ ℝ))
86	40	ad2antrr 726	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → ∀𝑥 ∈ (𝐴[,]𝐵)(𝐹‘𝑥) ∈ ℝ)
87	61	ad2antll 729	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → 𝑦 ∈ (𝐴[,]𝐵))
88	85, 86, 87	rspcdva 3623	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → (𝐹‘𝑦) ∈ ℝ)
89	41	ad2antrr 726	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → (𝐹‘𝐶) ∈ ℝ)
90	9	ad2antrr 726	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → 𝑈 ∈ ℝ)
91	89, 90	resubcld 11689	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → ((𝐹‘𝐶) − 𝑈) ∈ ℝ)
92	88, 89, 91	absdifltd 15469	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → ((abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈) ↔ (((𝐹‘𝐶) − ((𝐹‘𝐶) − 𝑈)) < (𝐹‘𝑦) ∧ (𝐹‘𝑦) < ((𝐹‘𝐶) + ((𝐹‘𝐶) − 𝑈)))))
93	89	recnd 11287	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → (𝐹‘𝐶) ∈ ℂ)
94	90	recnd 11287	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → 𝑈 ∈ ℂ)
95	93, 94	nncand 11623	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → ((𝐹‘𝐶) − ((𝐹‘𝐶) − 𝑈)) = 𝑈)
96	95	breq1d 5158	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → (((𝐹‘𝐶) − ((𝐹‘𝐶) − 𝑈)) < (𝐹‘𝑦) ↔ 𝑈 < (𝐹‘𝑦)))
97	84	breq1d 5158	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑥) ≤ 𝑈 ↔ (𝐹‘𝑦) ≤ 𝑈))
98	97, 2	elrab2 3698	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑦 ∈ 𝑆 ↔ (𝑦 ∈ (𝐴[,]𝐵) ∧ (𝐹‘𝑦) ≤ 𝑈))
99	98	simprbi 496	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑦 ∈ 𝑆 → (𝐹‘𝑦) ≤ 𝑈)
100	99	ad2antll 729	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → (𝐹‘𝑦) ≤ 𝑈)
101	88, 90, 100	lensymd 11410	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → ¬ 𝑈 < (𝐹‘𝑦))
102	101	pm2.21d 121	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → (𝑈 < (𝐹‘𝑦) → ¬ 𝑈 < (𝐹‘𝐶)))
103	96, 102	sylbid 240	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → (((𝐹‘𝐶) − ((𝐹‘𝐶) − 𝑈)) < (𝐹‘𝑦) → ¬ 𝑈 < (𝐹‘𝐶)))
104	103	adantrd 491	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → ((((𝐹‘𝐶) − ((𝐹‘𝐶) − 𝑈)) < (𝐹‘𝑦) ∧ (𝐹‘𝑦) < ((𝐹‘𝐶) + ((𝐹‘𝐶) − 𝑈))) → ¬ 𝑈 < (𝐹‘𝐶)))
105	92, 104	sylbid 240	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ (𝑧 ∈ ℝ⁺ ∧ 𝑦 ∈ 𝑆)) → ((abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈) → ¬ 𝑈 < (𝐹‘𝐶)))
106	105	expr 456	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → (𝑦 ∈ 𝑆 → ((abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈) → ¬ 𝑈 < (𝐹‘𝐶))))
107	106	impcomd 411	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → (((abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈) ∧ 𝑦 ∈ 𝑆) → ¬ 𝑈 < (𝐹‘𝐶)))
108	107	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (((abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈) ∧ 𝑦 ∈ 𝑆) → ¬ 𝑈 < (𝐹‘𝐶)))
109	83, 108	syl5 34	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → ((((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈)) ∧ ((abs‘(𝑦 − 𝐶)) < 𝑧 ∧ 𝑦 ∈ 𝑆)) → ¬ 𝑈 < (𝐹‘𝐶)))
110	109	rexlimdva 3153	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → (∃𝑦 ∈ (𝐴[,]𝐵)(((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈)) ∧ ((abs‘(𝑦 − 𝐶)) < 𝑧 ∧ 𝑦 ∈ 𝑆)) → ¬ 𝑈 < (𝐹‘𝐶)))
111	81, 110	syl5 34	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → ((∀𝑦 ∈ (𝐴[,]𝐵)((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈)) ∧ ∃𝑦 ∈ (𝐴[,]𝐵)((abs‘(𝑦 − 𝐶)) < 𝑧 ∧ 𝑦 ∈ 𝑆)) → ¬ 𝑈 < (𝐹‘𝐶)))
112	80, 111	mpan2d 694	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → (∀𝑦 ∈ (𝐴[,]𝐵)((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈)) → ¬ 𝑈 < (𝐹‘𝐶)))
113	49, 112	syld 47	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) ∧ 𝑧 ∈ ℝ⁺) → (∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈)) → ¬ 𝑈 < (𝐹‘𝐶)))
114	113	rexlimdva 3153	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) → (∃𝑧 ∈ ℝ⁺ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑧 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < ((𝐹‘𝐶) − 𝑈)) → ¬ 𝑈 < (𝐹‘𝐶)))
115	46, 114	mpd 15	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑈 < (𝐹‘𝐶)) → ¬ 𝑈 < (𝐹‘𝐶))
116	115	pm2.01da 799	. . . . . 6 ⊢ (𝜑 → ¬ 𝑈 < (𝐹‘𝐶))
117	41, 9	lttri3d 11399	. . . . . 6 ⊢ (𝜑 → ((𝐹‘𝐶) = 𝑈 ↔ (¬ (𝐹‘𝐶) < 𝑈 ∧ ¬ 𝑈 < (𝐹‘𝐶))))
118	24, 116, 117	mpbir2and 713	. . . . 5 ⊢ (𝜑 → (𝐹‘𝐶) = 𝑈)
119	23, 118	breqtrrd 5176	. . . 4 ⊢ (𝜑 → (𝐹‘𝐴) < (𝐹‘𝐶))
120	41	ltnrd 11393	. . . . . . . 8 ⊢ (𝜑 → ¬ (𝐹‘𝐶) < (𝐹‘𝐶))
121		fveq2 6907	. . . . . . . . . 10 ⊢ (𝐶 = 𝐴 → (𝐹‘𝐶) = (𝐹‘𝐴))
122	121	breq1d 5158	. . . . . . . . 9 ⊢ (𝐶 = 𝐴 → ((𝐹‘𝐶) < (𝐹‘𝐶) ↔ (𝐹‘𝐴) < (𝐹‘𝐶)))
123	122	notbid 318	. . . . . . . 8 ⊢ (𝐶 = 𝐴 → (¬ (𝐹‘𝐶) < (𝐹‘𝐶) ↔ ¬ (𝐹‘𝐴) < (𝐹‘𝐶)))
124	120, 123	syl5ibcom 245	. . . . . . 7 ⊢ (𝜑 → (𝐶 = 𝐴 → ¬ (𝐹‘𝐴) < (𝐹‘𝐶)))
125	124	necon2ad 2953	. . . . . 6 ⊢ (𝜑 → ((𝐹‘𝐴) < (𝐹‘𝐶) → 𝐶 ≠ 𝐴))
126	125, 27	jctild 525	. . . . 5 ⊢ (𝜑 → ((𝐹‘𝐴) < (𝐹‘𝐶) → (𝐴 ≤ 𝐶 ∧ 𝐶 ≠ 𝐴)))
127	4, 22	ltlend 11404	. . . . 5 ⊢ (𝜑 → (𝐴 < 𝐶 ↔ (𝐴 ≤ 𝐶 ∧ 𝐶 ≠ 𝐴)))
128	126, 127	sylibrd 259	. . . 4 ⊢ (𝜑 → ((𝐹‘𝐴) < (𝐹‘𝐶) → 𝐴 < 𝐶))
129	119, 128	mpd 15	. . 3 ⊢ (𝜑 → 𝐴 < 𝐶)
130	14	simprd 495	. . . . 5 ⊢ (𝜑 → 𝑈 < (𝐹‘𝐵))
131	118, 130	eqbrtrd 5170	. . . 4 ⊢ (𝜑 → (𝐹‘𝐶) < (𝐹‘𝐵))
132		fveq2 6907	. . . . . . . . . 10 ⊢ (𝐵 = 𝐶 → (𝐹‘𝐵) = (𝐹‘𝐶))
133	132	breq2d 5160	. . . . . . . . 9 ⊢ (𝐵 = 𝐶 → ((𝐹‘𝐶) < (𝐹‘𝐵) ↔ (𝐹‘𝐶) < (𝐹‘𝐶)))
134	133	notbid 318	. . . . . . . 8 ⊢ (𝐵 = 𝐶 → (¬ (𝐹‘𝐶) < (𝐹‘𝐵) ↔ ¬ (𝐹‘𝐶) < (𝐹‘𝐶)))
135	120, 134	syl5ibrcom 247	. . . . . . 7 ⊢ (𝜑 → (𝐵 = 𝐶 → ¬ (𝐹‘𝐶) < (𝐹‘𝐵)))
136	135	necon2ad 2953	. . . . . 6 ⊢ (𝜑 → ((𝐹‘𝐶) < (𝐹‘𝐵) → 𝐵 ≠ 𝐶))
137	136, 32	jctild 525	. . . . 5 ⊢ (𝜑 → ((𝐹‘𝐶) < (𝐹‘𝐵) → (𝐶 ≤ 𝐵 ∧ 𝐵 ≠ 𝐶)))
138	22, 5	ltlend 11404	. . . . 5 ⊢ (𝜑 → (𝐶 < 𝐵 ↔ (𝐶 ≤ 𝐵 ∧ 𝐵 ≠ 𝐶)))
139	137, 138	sylibrd 259	. . . 4 ⊢ (𝜑 → ((𝐹‘𝐶) < (𝐹‘𝐵) → 𝐶 < 𝐵))
140	131, 139	mpd 15	. . 3 ⊢ (𝜑 → 𝐶 < 𝐵)
141	4	rexrd 11309	. . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
142	5	rexrd 11309	. . . 4 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
143		elioo2 13425	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵)))
144	141, 142, 143	syl2anc 584	. . 3 ⊢ (𝜑 → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵)))
145	22, 129, 140, 144	mpbir3and 1341	. 2 ⊢ (𝜑 → 𝐶 ∈ (𝐴(,)𝐵))
146	145, 118	jca 511	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 {crab 3433 ⊆ wss 3963 ∅c0 4339 class class class wbr 5148 ‘cfv 6563 (class class class)co 7431 supcsup 9478 ℂcc 11151 ℝcr 11152 + caddc 11156 ℝ^*cxr 11292 < clt 11293 ≤ cle 11294 − cmin 11490 ℝ⁺crp 13032 (,)cioo 13384 [,]cicc 13387 abscabs 15270 –cn→ccncf 24916

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-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-op 4638 df-uni 4913 df-iun 4998 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-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-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-er 8744 df-map 8867 df-en 8985 df-dom 8986 df-sdom 8987 df-sup 9480 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-n0 12525 df-z 12612 df-uz 12877 df-rp 13033 df-ioo 13388 df-icc 13391 df-seq 14040 df-exp 14100 df-cj 15135 df-re 15136 df-im 15137 df-sqrt 15271 df-abs 15272 df-cncf 24918

This theorem is referenced by: ivth 25503

W3C validator