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 39149
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 6550 . . . 4 (𝜑 → (𝐺𝐵) ∈ ℝ)
43recnd 10322 . . 3 (𝜑 → (𝐺𝐵) ∈ ℂ)
54abscld 14460 . 2 (𝜑 → (abs‘(𝐺𝐵)) ∈ ℝ)
6 1red 10294 . 2 (𝜑 → 1 ∈ ℝ)
7 simpr 477 . . 3 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 1 < (abs‘(𝐺𝐵)))
81adantr 472 . . . . . . 7 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 𝐺:ℝ⟶ℝ)
92adantr 472 . . . . . . 7 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 𝐵 ∈ ℝ)
108, 9ffvelrnd 6550 . . . . . 6 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (𝐺𝐵) ∈ ℝ)
1110recnd 10322 . . . . 5 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (𝐺𝐵) ∈ ℂ)
1211abscld 14460 . . . 4 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs‘(𝐺𝐵)) ∈ ℝ)
136adantr 472 . . . 4 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 1 ∈ ℝ)
14 ax-resscn 10246 . . . . . . . . 9 ℝ ⊆ ℂ
15 imaco 5826 . . . . . . . . . . . 12 ((abs ∘ 𝐹) “ ℝ) = (abs “ (𝐹 “ ℝ))
1615eqcomi 2774 . . . . . . . . . . 11 (abs “ (𝐹 “ ℝ)) = ((abs ∘ 𝐹) “ ℝ)
17 imassrn 5659 . . . . . . . . . . . . 13 ((abs ∘ 𝐹) “ ℝ) ⊆ ran (abs ∘ 𝐹)
1817a1i 11 . . . . . . . . . . . 12 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ((abs ∘ 𝐹) “ ℝ) ⊆ ran (abs ∘ 𝐹))
19 imo72b2.1 . . . . . . . . . . . . . . 15 (𝜑𝐹:ℝ⟶ℝ)
2019adantr 472 . . . . . . . . . . . . . 14 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 𝐹:ℝ⟶ℝ)
21 absf 14362 . . . . . . . . . . . . . . . 16 abs:ℂ⟶ℝ
2221a1i 11 . . . . . . . . . . . . . . 15 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → abs:ℂ⟶ℝ)
2314a1i 11 . . . . . . . . . . . . . . 15 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ℝ ⊆ ℂ)
2422, 23fssresd 6253 . . . . . . . . . . . . . 14 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs ↾ ℝ):ℝ⟶ℝ)
2520, 24fco2d 39135 . . . . . . . . . . . . 13 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs ∘ 𝐹):ℝ⟶ℝ)
2625frnd 6230 . . . . . . . . . . . 12 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ran (abs ∘ 𝐹) ⊆ ℝ)
2718, 26sstrd 3771 . . . . . . . . . . 11 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ((abs ∘ 𝐹) “ ℝ) ⊆ ℝ)
2816, 27syl5eqss 3809 . . . . . . . . . 10 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs “ (𝐹 “ ℝ)) ⊆ ℝ)
29 0re 10295 . . . . . . . . . . . . . . . 16 0 ∈ ℝ
3029ne0ii 4088 . . . . . . . . . . . . . . 15 ℝ ≠ ∅
3130a1i 11 . . . . . . . . . . . . . 14 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ℝ ≠ ∅)
3231, 25wnefimgd 39134 . . . . . . . . . . . . 13 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ((abs ∘ 𝐹) “ ℝ) ≠ ∅)
3332necomd 2992 . . . . . . . . . . . 12 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ∅ ≠ ((abs ∘ 𝐹) “ ℝ))
3416a1i 11 . . . . . . . . . . . 12 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs “ (𝐹 “ ℝ)) = ((abs ∘ 𝐹) “ ℝ))
3533, 34neeqtrrd 3011 . . . . . . . . . . 11 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ∅ ≠ (abs “ (𝐹 “ ℝ)))
3635necomd 2992 . . . . . . . . . 10 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs “ (𝐹 “ ℝ)) ≠ ∅)
37 simpr 477 . . . . . . . . . . . . 13 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑐 = 1) → 𝑐 = 1)
3837breq2d 4821 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑐 = 1) → (𝑡𝑐𝑡 ≤ 1))
3938ralbidv 3133 . . . . . . . . . . 11 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑐 = 1) → (∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡𝑐 ↔ ∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡 ≤ 1))
40 imo72b2.6 . . . . . . . . . . . . 13 (𝜑 → ∀𝑦 ∈ ℝ (abs‘(𝐹𝑦)) ≤ 1)
4119, 40extoimad 39138 . . . . . . . . . . . 12 (𝜑 → ∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡 ≤ 1)
4241adantr 472 . . . . . . . . . . 11 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡 ≤ 1)
4313, 39, 42rspcedvd 3468 . . . . . . . . . 10 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ∃𝑐 ∈ ℝ ∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡𝑐)
4428, 36, 43suprcld 11240 . . . . . . . . 9 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ∈ ℝ)
4514, 44sseldi 3759 . . . . . . . 8 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ∈ ℂ)
4614, 12sseldi 3759 . . . . . . . 8 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs‘(𝐺𝐵)) ∈ ℂ)
4745, 46mulcomd 10315 . . . . . . 7 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) · (abs‘(𝐺𝐵))) = ((abs‘(𝐺𝐵)) · sup((abs “ (𝐹 “ ℝ)), ℝ, < )))
4829a1i 11 . . . . . . . . . . . 12 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 0 ∈ ℝ)
49 0lt1 10804 . . . . . . . . . . . . 13 0 < 1
5049a1i 11 . . . . . . . . . . . 12 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 0 < 1)
5148, 13, 12, 50, 7lttrd 10452 . . . . . . . . . . 11 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 0 < (abs‘(𝐺𝐵)))
5251gt0ne0d 10846 . . . . . . . . . 10 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs‘(𝐺𝐵)) ≠ 0)
5344, 12, 52redivcld 11107 . . . . . . . . 9 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / (abs‘(𝐺𝐵))) ∈ ℝ)
5420adantr 472 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 𝐹:ℝ⟶ℝ)
558adantr 472 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 𝐺:ℝ⟶ℝ)
56 simpr 477 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 𝑢 ∈ ℝ)
579adantr 472 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 𝐵 ∈ ℝ)
58 simpr 477 . . . . . . . . . . . . . . . . . . . 20 ((𝜑𝑣 = 𝐵) → 𝑣 = 𝐵)
5958oveq2d 6858 . . . . . . . . . . . . . . . . . . 19 ((𝜑𝑣 = 𝐵) → (𝑢 + 𝑣) = (𝑢 + 𝐵))
6059fveq2d 6379 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑣 = 𝐵) → (𝐹‘(𝑢 + 𝑣)) = (𝐹‘(𝑢 + 𝐵)))
6158oveq2d 6858 . . . . . . . . . . . . . . . . . . 19 ((𝜑𝑣 = 𝐵) → (𝑢𝑣) = (𝑢𝐵))
6261fveq2d 6379 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑣 = 𝐵) → (𝐹‘(𝑢𝑣)) = (𝐹‘(𝑢𝐵)))
6360, 62oveq12d 6860 . . . . . . . . . . . . . . . . 17 ((𝜑𝑣 = 𝐵) → ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢𝐵))))
6458fveq2d 6379 . . . . . . . . . . . . . . . . . . 19 ((𝜑𝑣 = 𝐵) → (𝐺𝑣) = (𝐺𝐵))
6564oveq2d 6858 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑣 = 𝐵) → ((𝐹𝑢) · (𝐺𝑣)) = ((𝐹𝑢) · (𝐺𝐵)))
6665oveq2d 6858 . . . . . . . . . . . . . . . . 17 ((𝜑𝑣 = 𝐵) → (2 · ((𝐹𝑢) · (𝐺𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝐵))))
6763, 66eqeq12d 2780 . . . . . . . . . . . . . . . 16 ((𝜑𝑣 = 𝐵) → (((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣))) ↔ ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢𝐵))) = (2 · ((𝐹𝑢) · (𝐺𝐵)))))
6867ralbidv 3133 . . . . . . . . . . . . . . 15 ((𝜑𝑣 = 𝐵) → (∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣))) ↔ ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢𝐵))) = (2 · ((𝐹𝑢) · (𝐺𝐵)))))
69 imo72b2.5 . . . . . . . . . . . . . . . 16 (𝜑 → ∀𝑢 ∈ ℝ ∀𝑣 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣))))
70 ralcom2 3251 . . . . . . . . . . . . . . . . . 18 (∀𝑢 ∈ ℝ ∀𝑣 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣))) → ∀𝑣 ∈ ℝ ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣))))
7170a1i 11 . . . . . . . . . . . . . . . . 17 (𝜑 → (∀𝑢 ∈ ℝ ∀𝑣 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣))) → ∀𝑣 ∈ ℝ ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣)))))
7271imp 395 . . . . . . . . . . . . . . . 16 ((𝜑 ∧ ∀𝑢 ∈ ℝ ∀𝑣 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣)))) → ∀𝑣 ∈ ℝ ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣))))
7369, 72mpdan 678 . . . . . . . . . . . . . . 15 (𝜑 → ∀𝑣 ∈ ℝ ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝑣)) + (𝐹‘(𝑢𝑣))) = (2 · ((𝐹𝑢) · (𝐺𝑣))))
7468, 2, 73rspcdvinvd 39148 . . . . . . . . . . . . . 14 (𝜑 → ∀𝑢 ∈ ℝ ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢𝐵))) = (2 · ((𝐹𝑢) · (𝐺𝐵))))
7574r19.21bi 3079 . . . . . . . . . . . . 13 ((𝜑𝑢 ∈ ℝ) → ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢𝐵))) = (2 · ((𝐹𝑢) · (𝐺𝐵))))
7675adantlr 706 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → ((𝐹‘(𝑢 + 𝐵)) + (𝐹‘(𝑢𝐵))) = (2 · ((𝐹𝑢) · (𝐺𝐵))))
7740ad2antrr 717 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → ∀𝑦 ∈ ℝ (abs‘(𝐹𝑦)) ≤ 1)
7854, 55, 56, 57, 76, 77imo72b2lem0 39139 . . . . . . . . . . 11 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → ((abs‘(𝐹𝑢)) · (abs‘(𝐺𝐵))) ≤ sup((abs “ (𝐹 “ ℝ)), ℝ, < ))
79 0xr 10340 . . . . . . . . . . . . 13 0 ∈ ℝ*
8079a1i 11 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 0 ∈ ℝ*)
81 1re 10293 . . . . . . . . . . . . . 14 1 ∈ ℝ
8281rexri 10351 . . . . . . . . . . . . 13 1 ∈ ℝ*
8382a1i 11 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 1 ∈ ℝ*)
8412adantr 472 . . . . . . . . . . . . 13 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → (abs‘(𝐺𝐵)) ∈ ℝ)
8584rexrd 10343 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → (abs‘(𝐺𝐵)) ∈ ℝ*)
8649a1i 11 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 0 < 1)
87 simplr 785 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 1 < (abs‘(𝐺𝐵)))
8880, 83, 85, 86, 87xrlttrd 12192 . . . . . . . . . . 11 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → 0 < (abs‘(𝐺𝐵)))
8920ffvelrnda 6549 . . . . . . . . . . . . 13 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → (𝐹𝑢) ∈ ℝ)
9089recnd 10322 . . . . . . . . . . . 12 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → (𝐹𝑢) ∈ ℂ)
9190abscld 14460 . . . . . . . . . . 11 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → (abs‘(𝐹𝑢)) ∈ ℝ)
9244adantr 472 . . . . . . . . . . 11 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ∈ ℝ)
9378, 88, 84, 91, 92lemuldiv3d 39146 . . . . . . . . . 10 (((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) ∧ 𝑢 ∈ ℝ) → (abs‘(𝐹𝑢)) ≤ (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / (abs‘(𝐺𝐵))))
9493ralrimiva 3113 . . . . . . . . 9 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ∀𝑢 ∈ ℝ (abs‘(𝐹𝑢)) ≤ (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / (abs‘(𝐺𝐵))))
9520, 53, 94imo72b2lem2 39141 . . . . . . . 8 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ≤ (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / (abs‘(𝐺𝐵))))
9695, 51, 12, 44, 44lemuldiv4d 39147 . . . . . . 7 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) · (abs‘(𝐺𝐵))) ≤ sup((abs “ (𝐹 “ ℝ)), ℝ, < ))
9747, 96eqbrtrrd 4833 . . . . . 6 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ((abs‘(𝐺𝐵)) · sup((abs “ (𝐹 “ ℝ)), ℝ, < )) ≤ sup((abs “ (𝐹 “ ℝ)), ℝ, < ))
98 imo72b2.7 . . . . . . . 8 (𝜑 → ∃𝑥 ∈ ℝ (𝐹𝑥) ≠ 0)
9998adantr 472 . . . . . . 7 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ∃𝑥 ∈ ℝ (𝐹𝑥) ≠ 0)
10040adantr 472 . . . . . . 7 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ∀𝑦 ∈ ℝ (abs‘(𝐹𝑦)) ≤ 1)
10120, 99, 100imo72b2lem1 39145 . . . . . 6 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 0 < sup((abs “ (𝐹 “ ℝ)), ℝ, < ))
10297, 101, 44, 12, 44lemuldiv3d 39146 . . . . 5 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs‘(𝐺𝐵)) ≤ (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / sup((abs “ (𝐹 “ ℝ)), ℝ, < )))
10323, 44sseldd 3762 . . . . . . 7 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ∈ ℂ)
104101gt0ne0d 10846 . . . . . . 7 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → sup((abs “ (𝐹 “ ℝ)), ℝ, < ) ≠ 0)
105103, 104dividd 11053 . . . . . 6 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / sup((abs “ (𝐹 “ ℝ)), ℝ, < )) = 1)
106105eqcomd 2771 . . . . 5 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → 1 = (sup((abs “ (𝐹 “ ℝ)), ℝ, < ) / sup((abs “ (𝐹 “ ℝ)), ℝ, < )))
107102, 106breqtrrd 4837 . . . 4 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → (abs‘(𝐺𝐵)) ≤ 1)
10812, 13, 107lensymd 10442 . . 3 ((𝜑 ∧ 1 < (abs‘(𝐺𝐵))) → ¬ 1 < (abs‘(𝐺𝐵)))
1097, 108pm2.65da 851 . 2 (𝜑 → ¬ 1 < (abs‘(𝐺𝐵)))
1105, 6, 109nltled 10441 1 (𝜑 → (abs‘(𝐺𝐵)) ≤ 1)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1652  wcel 2155  wne 2937  wral 3055  wrex 3056  wss 3732  c0 4079   class class class wbr 4809  ran crn 5278  cima 5280  ccom 5281  wf 6064  cfv 6068  (class class class)co 6842  supcsup 8553  cc 10187  cr 10188  0cc0 10189  1c1 10190   + caddc 10192   · cmul 10194  *cxr 10327   < clt 10328  cle 10329  cmin 10520   / cdiv 10938  2c2 11327  abscabs 14259
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2070  ax-7 2105  ax-8 2157  ax-9 2164  ax-10 2183  ax-11 2198  ax-12 2211  ax-13 2352  ax-ext 2743  ax-sep 4941  ax-nul 4949  ax-pow 5001  ax-pr 5062  ax-un 7147  ax-cnex 10245  ax-resscn 10246  ax-1cn 10247  ax-icn 10248  ax-addcl 10249  ax-addrcl 10250  ax-mulcl 10251  ax-mulrcl 10252  ax-mulcom 10253  ax-addass 10254  ax-mulass 10255  ax-distr 10256  ax-i2m1 10257  ax-1ne0 10258  ax-1rid 10259  ax-rnegex 10260  ax-rrecex 10261  ax-cnre 10262  ax-pre-lttri 10263  ax-pre-lttrn 10264  ax-pre-ltadd 10265  ax-pre-mulgt0 10266  ax-pre-sup 10267
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 874  df-3or 1108  df-3an 1109  df-tru 1656  df-ex 1875  df-nf 1879  df-sb 2063  df-mo 2565  df-eu 2582  df-clab 2752  df-cleq 2758  df-clel 2761  df-nfc 2896  df-ne 2938  df-nel 3041  df-ral 3060  df-rex 3061  df-reu 3062  df-rmo 3063  df-rab 3064  df-v 3352  df-sbc 3597  df-csb 3692  df-dif 3735  df-un 3737  df-in 3739  df-ss 3746  df-pss 3748  df-nul 4080  df-if 4244  df-pw 4317  df-sn 4335  df-pr 4337  df-tp 4339  df-op 4341  df-uni 4595  df-iun 4678  df-br 4810  df-opab 4872  df-mpt 4889  df-tr 4912  df-id 5185  df-eprel 5190  df-po 5198  df-so 5199  df-fr 5236  df-we 5238  df-xp 5283  df-rel 5284  df-cnv 5285  df-co 5286  df-dm 5287  df-rn 5288  df-res 5289  df-ima 5290  df-pred 5865  df-ord 5911  df-on 5912  df-lim 5913  df-suc 5914  df-iota 6031  df-fun 6070  df-fn 6071  df-f 6072  df-f1 6073  df-fo 6074  df-f1o 6075  df-fv 6076  df-riota 6803  df-ov 6845  df-oprab 6846  df-mpt2 6847  df-om 7264  df-2nd 7367  df-wrecs 7610  df-recs 7672  df-rdg 7710  df-er 7947  df-en 8161  df-dom 8162  df-sdom 8163  df-sup 8555  df-pnf 10330  df-mnf 10331  df-xr 10332  df-ltxr 10333  df-le 10334  df-sub 10522  df-neg 10523  df-div 10939  df-nn 11275  df-2 11335  df-3 11336  df-n0 11539  df-z 11625  df-uz 11887  df-rp 12029  df-seq 13009  df-exp 13068  df-cj 14124  df-re 14125  df-im 14126  df-sqrt 14260  df-abs 14261
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator