imo72b2 - Mathbox for Stanislas Polu

	Mathbox for Stanislas Polu		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > imo72b2		Structured version Visualization version GIF version

Theorem imo72b2 42972

Description: IMO 1972 B2. (14th International Mathematical Olympiad in Poland, problem B2). (Contributed by Stanislas Polu, 9-Mar-2020.)

**Hypotheses**
Ref	Expression
imo72b2.1	⊢ (𝜑 → 𝐹:ℝ⟶ℝ)
imo72b2.2	⊢ (𝜑 → 𝐺:ℝ⟶ℝ)
imo72b2.4	⊢ (𝜑 → 𝐵 ∈ ℝ)
imo72b2.5	⊢ (𝜑 → ∀𝑢 ∈ ℝ ∀𝑣 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢 − 𝑣))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝑣))))
imo72b2.6	⊢ (𝜑 → ∀𝑦 ∈ ℝ (abs‘(𝐹‘𝑦)) ≤ 1)
imo72b2.7	⊢ (𝜑 → ∃𝑥 ∈ ℝ (𝐹‘𝑥) ≠ 0)

**Assertion**
Ref	Expression
imo72b2	⊢ (𝜑 → (abs‘(𝐺‘𝐵)) ≤ 1)

Distinct variable groups: 𝑢,𝐵,𝑣 𝑥,𝐵 𝑦,𝐵 𝑢,𝐹,𝑣 𝑥,𝐹 𝑦,𝐹 𝑢,𝐺,𝑣 𝑥,𝐺 𝑦,𝐺 𝜑,𝑢,𝑣 𝜑,𝑥 𝜑,𝑦,𝑢

Proof of Theorem imo72b2 Dummy variables 𝑐 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		imo72b2.2	. . . . 5 ⊢ (𝜑 → 𝐺:ℝ⟶ℝ)
2		imo72b2.4	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ)
3	1, 2	ffvelcdmd 7088	. . . 4 ⊢ (𝜑 → (𝐺‘𝐵) ∈ ℝ)
4	3	recnd 11242	. . 3 ⊢ (𝜑 → (𝐺‘𝐵) ∈ ℂ)
5	4	abscld 15383	. 2 ⊢ (𝜑 → (abs‘(𝐺‘𝐵)) ∈ ℝ)
6		1red 11215	. 2 ⊢ (𝜑 → 1 ∈ ℝ)
7		simpr 486	. . 3 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → 1 < (abs‘(𝐺‘𝐵)))
8	1	adantr 482	. . . . . . 7 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → 𝐺:ℝ⟶ℝ)
9	2	adantr 482	. . . . . . 7 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → 𝐵 ∈ ℝ)
10	8, 9	ffvelcdmd 7088	. . . . . 6 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → (𝐺‘𝐵) ∈ ℝ)
11	10	recnd 11242	. . . . 5 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → (𝐺‘𝐵) ∈ ℂ)
12	11	abscld 15383	. . . 4 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → (abs‘(𝐺‘𝐵)) ∈ ℝ)
13	6	adantr 482	. . . 4 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → 1 ∈ ℝ)
14		ax-resscn 11167	. . . . . . . . 9 ⊢ ℝ ⊆ ℂ
15		imaco 6251	. . . . . . . . . . . 12 ⊢ ((abs ∘ 𝐹) “ ℝ) = (abs “ (𝐹 “ ℝ))
16	15	eqcomi 2742	. . . . . . . . . . 11 ⊢ (abs “ (𝐹 “ ℝ)) = ((abs ∘ 𝐹) “ ℝ)
17		imassrn 6071	. . . . . . . . . . . . 13 ⊢ ((abs ∘ 𝐹) “ ℝ) ⊆ ran (abs ∘ 𝐹)
18	17	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → ((abs ∘ 𝐹) “ ℝ) ⊆ ran (abs ∘ 𝐹))
19		imo72b2.1	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹:ℝ⟶ℝ)
20	19	adantr 482	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → 𝐹:ℝ⟶ℝ)
21		absf 15284	. . . . . . . . . . . . . . . 16 ⊢ abs:ℂ⟶ℝ
22	21	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → abs:ℂ⟶ℝ)
23	14	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → ℝ ⊆ ℂ)
24	22, 23	fssresd 6759	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → (abs ↾ ℝ):ℝ⟶ℝ)
25	20, 24	fco2d 42962	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → (abs ∘ 𝐹):ℝ⟶ℝ)
26	25	frnd 6726	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → ran (abs ∘ 𝐹) ⊆ ℝ)
27	18, 26	sstrd 3993	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → ((abs ∘ 𝐹) “ ℝ) ⊆ ℝ)
28	16, 27	eqsstrid 4031	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → (abs “ (𝐹 “ ℝ)) ⊆ ℝ)
29		0re 11216	. . . . . . . . . . . . . . . 16 ⊢ 0 ∈ ℝ
30	29	ne0ii 4338	. . . . . . . . . . . . . . 15 ⊢ ℝ ≠ ∅
31	30	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → ℝ ≠ ∅)
32	31, 25	wnefimgd 42961	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → ((abs ∘ 𝐹) “ ℝ) ≠ ∅)
33	32	necomd 2997	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → ∅ ≠ ((abs ∘ 𝐹) “ ℝ))
34	16	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → (abs “ (𝐹 “ ℝ)) = ((abs ∘ 𝐹) “ ℝ))
35	33, 34	neeqtrrd 3016	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → ∅ ≠ (abs “ (𝐹 “ ℝ)))
36	35	necomd 2997	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → (abs “ (𝐹 “ ℝ)) ≠ ∅)
37		simpr 486	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑐 = 1) → 𝑐 = 1)
38	37	breq2d 5161	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑐 = 1) → (𝑡 ≤ 𝑐 ↔ 𝑡 ≤ 1))
39	38	ralbidv 3178	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑐 = 1) → (∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡 ≤ 𝑐 ↔ ∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡 ≤ 1))
40		imo72b2.6	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∀𝑦 ∈ ℝ (abs‘(𝐹‘𝑦)) ≤ 1)
41	19, 40	extoimad 42964	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡 ≤ 1)
42	41	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → ∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡 ≤ 1)
43	13, 39, 42	rspcedvd 3615	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → ∃𝑐 ∈ ℝ ∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡 ≤ 𝑐)
44	28, 36, 43	suprcld 12177	. . . . . . . . 9 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ∈ ℝ)
45	14, 44	sselid 3981	. . . . . . . 8 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ∈ ℂ)
46	14, 12	sselid 3981	. . . . . . . 8 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → (abs‘(𝐺‘𝐵)) ∈ ℂ)
47	45, 46	mulcomd 11235	. . . . . . 7 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) · (abs‘(𝐺‘𝐵))) = ((abs‘(𝐺‘𝐵)) · sup((abs “ (𝐹 “ ℝ)), ℝ, < )))
48	29	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → 0 ∈ ℝ)
49		0lt1 11736	. . . . . . . . . . . . 13 ⊢ 0 < 1
50	49	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → 0 < 1)
51	48, 13, 12, 50, 7	lttrd 11375	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → 0 < (abs‘(𝐺‘𝐵)))
52	51	gt0ne0d 11778	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → (abs‘(𝐺‘𝐵)) ≠ 0)
53	44, 12, 52	redivcld 12042	. . . . . . . . 9 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / (abs‘(𝐺‘𝐵))) ∈ ℝ)
54	20	adantr 482	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → 𝐹:ℝ⟶ℝ)
55	8	adantr 482	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → 𝐺:ℝ⟶ℝ)
56		simpr 486	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → 𝑢 ∈ ℝ)
57	9	adantr 482	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → 𝐵 ∈ ℝ)
58		simpr 486	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑣 = 𝐵) → 𝑣 = 𝐵)
59	58	oveq2d 7425	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑣 = 𝐵) → (𝑢 + 𝑣) = (𝑢 + 𝐵))
60	59	fveq2d 6896	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑣 = 𝐵) → (𝐹‘(𝑢 + 𝑣)) = (𝐹‘(𝑢 + 𝐵)))
61	58	oveq2d 7425	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑣 = 𝐵) → (𝑢 − 𝑣) = (𝑢 − 𝐵))
62	61	fveq2d 6896	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑣 = 𝐵) → (𝐹‘(𝑢 − 𝑣)) = (𝐹‘(𝑢 − 𝐵)))
63	60, 62	oveq12d 7427	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑣 = 𝐵) → ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢 − 𝑣))) = ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢 − 𝐵))))
64	58	fveq2d 6896	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑣 = 𝐵) → (𝐺‘𝑣) = (𝐺‘𝐵))
65	64	oveq2d 7425	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑣 = 𝐵) → ((𝐹‘𝑢) · (𝐺‘𝑣)) = ((𝐹‘𝑢) · (𝐺‘𝐵)))
66	65	oveq2d 7425	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑣 = 𝐵) → (2 · ((𝐹‘𝑢) · (𝐺‘𝑣))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝐵))))
67	63, 66	eqeq12d 2749	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑣 = 𝐵) → (((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢 − 𝑣))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝑣))) ↔ ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢 − 𝐵))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝐵)))))
68	67	ralbidv 3178	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑣 = 𝐵) → (∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢 − 𝑣))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝑣))) ↔ ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢 − 𝐵))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝐵)))))
69		imo72b2.5	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ∀𝑢 ∈ ℝ ∀𝑣 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢 − 𝑣))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝑣))))
70		ralcom 3287	. . . . . . . . . . . . . . . . . . 19 ⊢ (∀𝑢 ∈ ℝ ∀𝑣 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢 − 𝑣))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝑣))) ↔ ∀𝑣 ∈ ℝ ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢 − 𝑣))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝑣))))
71	70	biimpi 215	. . . . . . . . . . . . . . . . . 18 ⊢ (∀𝑢 ∈ ℝ ∀𝑣 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢 − 𝑣))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝑣))) → ∀𝑣 ∈ ℝ ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢 − 𝑣))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝑣))))
72	71	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (∀𝑢 ∈ ℝ ∀𝑣 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢 − 𝑣))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝑣))) → ∀𝑣 ∈ ℝ ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢 − 𝑣))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝑣)))))
73	72	imp 408	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ ∀𝑢 ∈ ℝ ∀𝑣 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢 − 𝑣))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝑣)))) → ∀𝑣 ∈ ℝ ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢 − 𝑣))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝑣))))
74	69, 73	mpdan 686	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ∀𝑣 ∈ ℝ ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢 − 𝑣))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝑣))))
75	68, 2, 74	rspcdv2 3608	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢 − 𝐵))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝐵))))
76	75	r19.21bi 3249	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑢 ∈ ℝ) → ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢 − 𝐵))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝐵))))
77	76	adantlr 714	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢 − 𝐵))) = (2 · ((𝐹‘𝑢) · (𝐺‘𝐵))))
78	40	ad2antrr 725	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → ∀𝑦 ∈ ℝ (abs‘(𝐹‘𝑦)) ≤ 1)
79	54, 55, 56, 57, 77, 78	imo72b2lem0 42965	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → ((abs‘(𝐹‘𝑢)) · (abs‘(𝐺‘𝐵))) ≤ sup((abs “ (𝐹 “ ℝ)), ℝ, < ))
80		0xr 11261	. . . . . . . . . . . . 13 ⊢ 0 ∈ ℝ^*
81	80	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → 0 ∈ ℝ^*)
82		1xr 11273	. . . . . . . . . . . . 13 ⊢ 1 ∈ ℝ^*
83	82	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → 1 ∈ ℝ^*)
84	12	adantr 482	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → (abs‘(𝐺‘𝐵)) ∈ ℝ)
85	84	rexrd 11264	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → (abs‘(𝐺‘𝐵)) ∈ ℝ^*)
86	49	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → 0 < 1)
87		simplr 768	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → 1 < (abs‘(𝐺‘𝐵)))
88	81, 83, 85, 86, 87	xrlttrd 13138	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → 0 < (abs‘(𝐺‘𝐵)))
89	20	ffvelcdmda 7087	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → (𝐹‘𝑢) ∈ ℝ)
90	89	recnd 11242	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → (𝐹‘𝑢) ∈ ℂ)
91	90	abscld 15383	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → (abs‘(𝐹‘𝑢)) ∈ ℝ)
92	44	adantr 482	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ∈ ℝ)
93	79, 88, 84, 91, 92	lemuldiv3d 42970	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) ∧ 𝑢 ∈ ℝ) → (abs‘(𝐹‘𝑢)) ≤ (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / (abs‘(𝐺‘𝐵))))
94	93	ralrimiva 3147	. . . . . . . . 9 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → ∀𝑢 ∈ ℝ (abs‘(𝐹‘𝑢)) ≤ (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / (abs‘(𝐺‘𝐵))))
95	20, 53, 94	imo72b2lem2 42967	. . . . . . . 8 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ≤ (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / (abs‘(𝐺‘𝐵))))
96	95, 51, 12, 44, 44	lemuldiv4d 42971	. . . . . . 7 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) · (abs‘(𝐺‘𝐵))) ≤ sup((abs “ (𝐹 “ ℝ)), ℝ, < ))
97	47, 96	eqbrtrrd 5173	. . . . . 6 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → ((abs‘(𝐺‘𝐵)) · sup((abs “ (𝐹 “ ℝ)), ℝ, < )) ≤ sup((abs “ (𝐹 “ ℝ)), ℝ, < ))
98		imo72b2.7	. . . . . . . 8 ⊢ (𝜑 → ∃𝑥 ∈ ℝ (𝐹‘𝑥) ≠ 0)
99	98	adantr 482	. . . . . . 7 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → ∃𝑥 ∈ ℝ (𝐹‘𝑥) ≠ 0)
100	40	adantr 482	. . . . . . 7 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → ∀𝑦 ∈ ℝ (abs‘(𝐹‘𝑦)) ≤ 1)
101	20, 99, 100	imo72b2lem1 42969	. . . . . 6 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → 0 < sup((abs “ (𝐹 “ ℝ)), ℝ, < ))
102	97, 101, 44, 12, 44	lemuldiv3d 42970	. . . . 5 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → (abs‘(𝐺‘𝐵)) ≤ (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / sup((abs “ (𝐹 “ ℝ)), ℝ, < )))
103	23, 44	sseldd 3984	. . . . . . 7 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ∈ ℂ)
104	101	gt0ne0d 11778	. . . . . . 7 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ≠ 0)
105	103, 104	dividd 11988	. . . . . 6 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / sup((abs “ (𝐹 “ ℝ)), ℝ, < )) = 1)
106	105	eqcomd 2739	. . . . 5 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → 1 = (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / sup((abs “ (𝐹 “ ℝ)), ℝ, < )))
107	102, 106	breqtrrd 5177	. . . 4 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → (abs‘(𝐺‘𝐵)) ≤ 1)
108	12, 13, 107	lensymd 11365	. . 3 ⊢ ((𝜑 ∧ 1 < (abs‘(𝐺‘𝐵))) → ¬ 1 < (abs‘(𝐺‘𝐵)))
109	7, 108	pm2.65da 816	. 2 ⊢ (𝜑 → ¬ 1 < (abs‘(𝐺‘𝐵)))
110	5, 6, 109	nltled 11364	1 ⊢ (𝜑 → (abs‘(𝐺‘𝐵)) ≤ 1)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 ∀wral 3062 ∃wrex 3071 ⊆ wss 3949 ∅c0 4323 class class class wbr 5149 ran crn 5678 “ cima 5680 ∘ ccom 5681 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 supcsup 9435 ℂcc 11108 ℝcr 11109 0cc0 11110 1c1 11111 + caddc 11113 · cmul 11115 ℝ^*cxr 11247 < clt 11248 ≤ cle 11249 − cmin 11444 / cdiv 11871 2c2 12267 abscabs 15181

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-sup 9437 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-3 12276 df-n0 12473 df-z 12559 df-uz 12823 df-rp 12975 df-seq 13967 df-exp 14028 df-cj 15046 df-re 15047 df-im 15048 df-sqrt 15182 df-abs 15183

This theorem is referenced by: (None)

W3C validator