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

Theorem imo72b2 39001
Description: IMO 1972 B2. (14th International Mathemahics 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.
StepHypRef Expression
1 imo72b2.2 . . . . 5 (𝜑𝐺:ℝ⟶ℝ)
2 imo72b2.4 . . . . 5 (𝜑𝐵 ∈ ℝ)
31, 2ffvelrnd 6503 . . . 4 (𝜑 → (𝐺𝐵) ∈ ℝ)
43recnd 10270 . . 3 (𝜑 → (𝐺𝐵) ∈ ℂ)
54abscld 14383 . 2 (𝜑 → (abs‘(𝐺𝐵)) ∈ ℝ)
6 1red 10257 . 2 (𝜑 → 1 ∈ ℝ)
7 simpr 471 . . 3 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 1 < (abs‘(𝐺𝐵)))
81adantr 466 . . . . . . 7 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 𝐺:ℝ⟶ℝ)
92adantr 466 . . . . . . 7 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 𝐵 ∈ ℝ)
108, 9ffvelrnd 6503 . . . . . 6 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (𝐺𝐵) ∈ ℝ)
1110recnd 10270 . . . . 5 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (𝐺𝐵) ∈ ℂ)
1211abscld 14383 . . . 4 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs‘(𝐺𝐵)) ∈ ℝ)
136adantr 466 . . . 4 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 1 ∈ ℝ)
14 ax-resscn 10195 . . . . . . . . 9 ℝ ⊆ ℂ
15 imaco 5784 . . . . . . . . . . . 12 ((abs ∘ 𝐹) “ ℝ) = (abs “ (𝐹 “ ℝ))
1615eqcomi 2780 . . . . . . . . . . 11 (abs “ (𝐹 “ ℝ)) = ((abs ∘ 𝐹) “ ℝ)
17 imassrn 5618 . . . . . . . . . . . . 13 ((abs ∘ 𝐹) “ ℝ) ⊆ ran (abs ∘ 𝐹)
1817a1i 11 . . . . . . . . . . . 12 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ((abs ∘ 𝐹) “ ℝ) ⊆ ran (abs ∘ 𝐹))
19 imo72b2.1 . . . . . . . . . . . . . . 15 (𝜑𝐹:ℝ⟶ℝ)
2019adantr 466 . . . . . . . . . . . . . 14 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 𝐹:ℝ⟶ℝ)
21 absf 14285 . . . . . . . . . . . . . . . 16 abs:ℂ⟶ℝ
2221a1i 11 . . . . . . . . . . . . . . 15 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → abs:ℂ⟶ℝ)
2314a1i 11 . . . . . . . . . . . . . . 15 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ℝ ⊆ ℂ)
2422, 23fssresd 6211 . . . . . . . . . . . . . 14 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs ↾ ℝ):ℝ⟶ℝ)
2520, 24fco2d 38987 . . . . . . . . . . . . 13 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs ∘ 𝐹):ℝ⟶ℝ)
26 frn 6193 . . . . . . . . . . . . 13 ((abs ∘ 𝐹):ℝ⟶ℝ → ran (abs ∘ 𝐹) ⊆ ℝ)
2725, 26syl 17 . . . . . . . . . . . 12 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ran (abs ∘ 𝐹) ⊆ ℝ)
2818, 27sstrd 3762 . . . . . . . . . . 11 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ((abs ∘ 𝐹) “ ℝ) ⊆ ℝ)
2916, 28syl5eqss 3798 . . . . . . . . . 10 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs “ (𝐹 “ ℝ)) ⊆ ℝ)
30 0re 10242 . . . . . . . . . . . . . . . 16 0 ∈ ℝ
3130ne0ii 4071 . . . . . . . . . . . . . . 15 ℝ ≠ ∅
3231a1i 11 . . . . . . . . . . . . . 14 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ℝ ≠ ∅)
3332, 25wnefimgd 38986 . . . . . . . . . . . . 13 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ((abs ∘ 𝐹) “ ℝ) ≠ ∅)
3433necomd 2998 . . . . . . . . . . . 12 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ∅ ≠ ((abs ∘ 𝐹) “ ℝ))
3516a1i 11 . . . . . . . . . . . 12 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs “ (𝐹 “ ℝ)) = ((abs ∘ 𝐹) “ ℝ))
3634, 35neeqtrrd 3017 . . . . . . . . . . 11 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ∅ ≠ (abs “ (𝐹 “ ℝ)))
3736necomd 2998 . . . . . . . . . 10 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs “ (𝐹 “ ℝ)) ≠ ∅)
38 simpr 471 . . . . . . . . . . . . 13 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑐 = 1) → 𝑐 = 1)
3938breq2d 4798 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑐 = 1) → (𝑡𝑐𝑡 ≤ 1))
4039ralbidv 3135 . . . . . . . . . . 11 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑐 = 1) → (∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡𝑐 ↔ ∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡 ≤ 1))
41 imo72b2.6 . . . . . . . . . . . . 13 (𝜑 → ∀𝑦 ∈ ℝ (abs‘(𝐹𝑦)) ≤ 1)
4219, 41extoimad 38990 . . . . . . . . . . . 12 (𝜑 → ∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡 ≤ 1)
4342adantr 466 . . . . . . . . . . 11 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡 ≤ 1)
4413, 40, 43rspcedvd 3467 . . . . . . . . . 10 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ∃𝑐 ∈ ℝ ∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡𝑐)
4529, 37, 44suprcld 11188 . . . . . . . . 9 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ∈ ℝ)
4614, 45sseldi 3750 . . . . . . . 8 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ∈ ℂ)
4714, 12sseldi 3750 . . . . . . . 8 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs‘(𝐺𝐵)) ∈ ℂ)
4846, 47mulcomd 10263 . . . . . . 7 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) · (abs‘(𝐺𝐵))) = ((abs‘(𝐺𝐵)) · sup((abs “ (𝐹 “ ℝ)), ℝ, < )))
4930a1i 11 . . . . . . . . . . . 12 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 0 ∈ ℝ)
50 0lt1 10752 . . . . . . . . . . . . 13 0 < 1
5150a1i 11 . . . . . . . . . . . 12 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 0 < 1)
5249, 13, 12, 51, 7lttrd 10400 . . . . . . . . . . 11 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 0 < (abs‘(𝐺𝐵)))
5352gt0ne0d 10794 . . . . . . . . . 10 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs‘(𝐺𝐵)) ≠ 0)
5445, 12, 53redivcld 11055 . . . . . . . . 9 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / (abs‘(𝐺𝐵))) ∈ ℝ)
5520adantr 466 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 𝐹:ℝ⟶ℝ)
568adantr 466 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 𝐺:ℝ⟶ℝ)
57 simpr 471 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 𝑢 ∈ ℝ)
589adantr 466 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 𝐵 ∈ ℝ)
59 simpr 471 . . . . . . . . . . . . . . . . . . . 20 ((𝜑𝑣 = 𝐵) → 𝑣 = 𝐵)
6059oveq2d 6809 . . . . . . . . . . . . . . . . . . 19 ((𝜑𝑣 = 𝐵) → (𝑢 + 𝑣) = (𝑢 + 𝐵))
6160fveq2d 6336 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑣 = 𝐵) → (𝐹‘(𝑢 + 𝑣)) = (𝐹‘(𝑢 + 𝐵)))
6259oveq2d 6809 . . . . . . . . . . . . . . . . . . 19 ((𝜑𝑣 = 𝐵) → (𝑢𝑣) = (𝑢𝐵))
6362fveq2d 6336 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑣 = 𝐵) → (𝐹‘(𝑢𝑣)) = (𝐹‘(𝑢𝐵)))
6461, 63oveq12d 6811 . . . . . . . . . . . . . . . . 17 ((𝜑𝑣 = 𝐵) → ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢𝐵))))
6559fveq2d 6336 . . . . . . . . . . . . . . . . . . 19 ((𝜑𝑣 = 𝐵) → (𝐺𝑣) = (𝐺𝐵))
6665oveq2d 6809 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑣 = 𝐵) → ((𝐹𝑢) · (𝐺𝑣)) = ((𝐹𝑢) · (𝐺𝐵)))
6766oveq2d 6809 . . . . . . . . . . . . . . . . 17 ((𝜑𝑣 = 𝐵) → (2 · ((𝐹𝑢) · (𝐺𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝐵))))
6864, 67eqeq12d 2786 . . . . . . . . . . . . . . . 16 ((𝜑𝑣 = 𝐵) → (((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣))) ↔ ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢𝐵))) = (2 · ((𝐹𝑢) · (𝐺𝐵)))))
6968ralbidv 3135 . . . . . . . . . . . . . . 15 ((𝜑𝑣 = 𝐵) → (∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣))) ↔ ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢𝐵))) = (2 · ((𝐹𝑢) · (𝐺𝐵)))))
70 imo72b2.5 . . . . . . . . . . . . . . . 16 (𝜑 → ∀𝑢 ∈ ℝ ∀𝑣 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣))))
71 ralcom2 3252 . . . . . . . . . . . . . . . . . 18 (∀𝑢 ∈ ℝ ∀𝑣 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣))) → ∀𝑣 ∈ ℝ ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣))))
7271a1i 11 . . . . . . . . . . . . . . . . 17 (𝜑 → (∀𝑢 ∈ ℝ ∀𝑣 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣))) → ∀𝑣 ∈ ℝ ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣)))))
7372imp 393 . . . . . . . . . . . . . . . 16 ((𝜑 ∧ ∀𝑢 ∈ ℝ ∀𝑣 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣)))) → ∀𝑣 ∈ ℝ ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣))))
7470, 73mpdan 667 . . . . . . . . . . . . . . 15 (𝜑 → ∀𝑣 ∈ ℝ ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣))))
7569, 2, 74rspcdvinvd 39000 . . . . . . . . . . . . . 14 (𝜑 → ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢𝐵))) = (2 · ((𝐹𝑢) · (𝐺𝐵))))
7675r19.21bi 3081 . . . . . . . . . . . . 13 ((𝜑𝑢 ∈ ℝ) → ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢𝐵))) = (2 · ((𝐹𝑢) · (𝐺𝐵))))
7776adantlr 694 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢𝐵))) = (2 · ((𝐹𝑢) · (𝐺𝐵))))
7841ad2antrr 705 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → ∀𝑦 ∈ ℝ (abs‘(𝐹𝑦)) ≤ 1)
7955, 56, 57, 58, 77, 78imo72b2lem0 38991 . . . . . . . . . . 11 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → ((abs‘(𝐹𝑢)) · (abs‘(𝐺𝐵))) ≤ sup((abs “ (𝐹 “ ℝ)), ℝ, < ))
80 0xr 10288 . . . . . . . . . . . . 13 0 ∈ ℝ*
8180a1i 11 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 0 ∈ ℝ*)
82 1re 10241 . . . . . . . . . . . . . 14 1 ∈ ℝ
8382rexri 10299 . . . . . . . . . . . . 13 1 ∈ ℝ*
8483a1i 11 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 1 ∈ ℝ*)
8512adantr 466 . . . . . . . . . . . . 13 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → (abs‘(𝐺𝐵)) ∈ ℝ)
8685rexrd 10291 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → (abs‘(𝐺𝐵)) ∈ ℝ*)
8750a1i 11 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 0 < 1)
88 simplr 752 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 1 < (abs‘(𝐺𝐵)))
8981, 84, 86, 87, 88xrlttrd 12195 . . . . . . . . . . 11 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 0 < (abs‘(𝐺𝐵)))
9020ffvelrnda 6502 . . . . . . . . . . . . 13 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → (𝐹𝑢) ∈ ℝ)
9190recnd 10270 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → (𝐹𝑢) ∈ ℂ)
9291abscld 14383 . . . . . . . . . . 11 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → (abs‘(𝐹𝑢)) ∈ ℝ)
9345adantr 466 . . . . . . . . . . 11 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ∈ ℝ)
9479, 89, 85, 92, 93lemuldiv3d 38998 . . . . . . . . . 10 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → (abs‘(𝐹𝑢)) ≤ (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / (abs‘(𝐺𝐵))))
9594ralrimiva 3115 . . . . . . . . 9 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ∀𝑢 ∈ ℝ (abs‘(𝐹𝑢)) ≤ (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / (abs‘(𝐺𝐵))))
9620, 54, 95imo72b2lem2 38993 . . . . . . . 8 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ≤ (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / (abs‘(𝐺𝐵))))
9796, 52, 12, 45, 45lemuldiv4d 38999 . . . . . . 7 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) · (abs‘(𝐺𝐵))) ≤ sup((abs “ (𝐹 “ ℝ)), ℝ, < ))
9848, 97eqbrtrrd 4810 . . . . . 6 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ((abs‘(𝐺𝐵)) · sup((abs “ (𝐹 “ ℝ)), ℝ, < )) ≤ sup((abs “ (𝐹 “ ℝ)), ℝ, < ))
99 imo72b2.7 . . . . . . . 8 (𝜑 → ∃𝑥 ∈ ℝ (𝐹𝑥) ≠ 0)
10099adantr 466 . . . . . . 7 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ∃𝑥 ∈ ℝ (𝐹𝑥) ≠ 0)
10141adantr 466 . . . . . . 7 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ∀𝑦 ∈ ℝ (abs‘(𝐹𝑦)) ≤ 1)
10220, 100, 101imo72b2lem1 38997 . . . . . 6 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 0 < sup((abs “ (𝐹 “ ℝ)), ℝ, < ))
10398, 102, 45, 12, 45lemuldiv3d 38998 . . . . 5 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs‘(𝐺𝐵)) ≤ (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / sup((abs “ (𝐹 “ ℝ)), ℝ, < )))
10423, 45sseldd 3753 . . . . . . 7 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ∈ ℂ)
105102gt0ne0d 10794 . . . . . . 7 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ≠ 0)
106104, 105dividd 11001 . . . . . 6 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / sup((abs “ (𝐹 “ ℝ)), ℝ, < )) = 1)
107106eqcomd 2777 . . . . 5 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 1 = (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / sup((abs “ (𝐹 “ ℝ)), ℝ, < )))
108103, 107breqtrrd 4814 . . . 4 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs‘(𝐺𝐵)) ≤ 1)
10912, 13, 108lensymd 10390 . . 3 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ¬ 1 < (abs‘(𝐺𝐵)))
1107, 109pm2.65da 817 . 2 (𝜑 → ¬ 1 < (abs‘(𝐺𝐵)))
1115, 6, 110nltled 10389 1 (𝜑 → (abs‘(𝐺𝐵)) ≤ 1)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 382   = wceq 1631  wcel 2145  wne 2943  wral 3061  wrex 3062  wss 3723  c0 4063   class class class wbr 4786  ran crn 5250  cima 5252  ccom 5253  wf 6027  cfv 6031  (class class class)co 6793  supcsup 8502  cc 10136  cr 10137  0cc0 10138  1c1 10139   + caddc 10141   · cmul 10143  *cxr 10275   < clt 10276  cle 10277  cmin 10468   / cdiv 10886  2c2 11272  abscabs 14182
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4915  ax-nul 4923  ax-pow 4974  ax-pr 5034  ax-un 7096  ax-cnex 10194  ax-resscn 10195  ax-1cn 10196  ax-icn 10197  ax-addcl 10198  ax-addrcl 10199  ax-mulcl 10200  ax-mulrcl 10201  ax-mulcom 10202  ax-addass 10203  ax-mulass 10204  ax-distr 10205  ax-i2m1 10206  ax-1ne0 10207  ax-1rid 10208  ax-rnegex 10209  ax-rrecex 10210  ax-cnre 10211  ax-pre-lttri 10212  ax-pre-lttrn 10213  ax-pre-ltadd 10214  ax-pre-mulgt0 10215  ax-pre-sup 10216
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 835  df-3or 1072  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-nel 3047  df-ral 3066  df-rex 3067  df-reu 3068  df-rmo 3069  df-rab 3070  df-v 3353  df-sbc 3588  df-csb 3683  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-pss 3739  df-nul 4064  df-if 4226  df-pw 4299  df-sn 4317  df-pr 4319  df-tp 4321  df-op 4323  df-uni 4575  df-iun 4656  df-br 4787  df-opab 4847  df-mpt 4864  df-tr 4887  df-id 5157  df-eprel 5162  df-po 5170  df-so 5171  df-fr 5208  df-we 5210  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-pred 5823  df-ord 5869  df-on 5870  df-lim 5871  df-suc 5872  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-f1 6036  df-fo 6037  df-f1o 6038  df-fv 6039  df-riota 6754  df-ov 6796  df-oprab 6797  df-mpt2 6798  df-om 7213  df-2nd 7316  df-wrecs 7559  df-recs 7621  df-rdg 7659  df-er 7896  df-en 8110  df-dom 8111  df-sdom 8112  df-sup 8504  df-pnf 10278  df-mnf 10279  df-xr 10280  df-ltxr 10281  df-le 10282  df-sub 10470  df-neg 10471  df-div 10887  df-nn 11223  df-2 11281  df-3 11282  df-n0 11495  df-z 11580  df-uz 11889  df-rp 12036  df-seq 13009  df-exp 13068  df-cj 14047  df-re 14048  df-im 14049  df-sqrt 14183  df-abs 14184
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator