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

Theorem elo1 15486
Description: Elementhood in the set of eventually bounded functions. (Contributed by Mario Carneiro, 15-Sep-2014.)
Assertion
Ref Expression
elo1 (𝐹 ∈ 𝑂(1) ↔ (𝐹 ∈ (ℂ ↑pm ℝ) ∧ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(abs‘(𝐹𝑦)) ≤ 𝑚))
Distinct variable group:   𝑥,𝑚,𝑦,𝐹

Proof of Theorem elo1
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 dmeq 5852 . . . . 5 (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
21ineq1d 4155 . . . 4 (𝑓 = 𝐹 → (dom 𝑓 ∩ (𝑥[,)+∞)) = (dom 𝐹 ∩ (𝑥[,)+∞)))
3 fveq1 6833 . . . . . 6 (𝑓 = 𝐹 → (𝑓𝑦) = (𝐹𝑦))
43fveq2d 6838 . . . . 5 (𝑓 = 𝐹 → (abs‘(𝑓𝑦)) = (abs‘(𝐹𝑦)))
54breq1d 5089 . . . 4 (𝑓 = 𝐹 → ((abs‘(𝑓𝑦)) ≤ 𝑚 ↔ (abs‘(𝐹𝑦)) ≤ 𝑚))
62, 5raleqbidv 3314 . . 3 (𝑓 = 𝐹 → (∀𝑦 ∈ (dom 𝑓 ∩ (𝑥[,)+∞))(abs‘(𝑓𝑦)) ≤ 𝑚 ↔ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(abs‘(𝐹𝑦)) ≤ 𝑚))
762rexbidv 3205 . 2 (𝑓 = 𝐹 → (∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝑓 ∩ (𝑥[,)+∞))(abs‘(𝑓𝑦)) ≤ 𝑚 ↔ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(abs‘(𝐹𝑦)) ≤ 𝑚))
8 df-o1 15450 . 2 𝑂(1) = {𝑓 ∈ (ℂ ↑pm ℝ) ∣ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝑓 ∩ (𝑥[,)+∞))(abs‘(𝑓𝑦)) ≤ 𝑚}
97, 8elrab2 3639 1 (𝐹 ∈ 𝑂(1) ↔ (𝐹 ∈ (ℂ ↑pm ℝ) ∧ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(abs‘(𝐹𝑦)) ≤ 𝑚))
Colors of variables: wff setvar class
Syntax hints:  wb 207  wa 396   = wceq 1547  wcel 2119  wral 3054  wrex 3064  cin 3889   class class class wbr 5079  dom cdm 5625  cfv 6492  (class class class)co 7363  pm cpm 8771  cc 11034  cr 11035  +∞cpnf 11174  cle 11178  [,)cico 13298  abscabs 15194  𝑂(1)co1 15446
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-dm 5635  df-iota 6448  df-fv 6500  df-o1 15450
This theorem is referenced by:  elo12  15487  o1f  15489  o1dm  15490
  Copyright terms: Public domain W3C validator