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

Theorem elo1 15479
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 4160 . . . 4 (𝑓 = 𝐹 → (dom 𝑓 ∩ (𝑥[,)+∞)) = (dom 𝐹 ∩ (𝑥[,)+∞)))
3 fveq1 6833 . . . . . 6 (𝑓 = 𝐹 → (𝑓𝑦) = (𝐹𝑦))
43fveq2d 6838 . . . . 5 (𝑓 = 𝐹 → (abs‘(𝑓𝑦)) = (abs‘(𝐹𝑦)))
54breq1d 5096 . . . 4 (𝑓 = 𝐹 → ((abs‘(𝑓𝑦)) ≤ 𝑚 ↔ (abs‘(𝐹𝑦)) ≤ 𝑚))
62, 5raleqbidv 3312 . . 3 (𝑓 = 𝐹 → (∀𝑦 ∈ (dom 𝑓 ∩ (𝑥[,)+∞))(abs‘(𝑓𝑦)) ≤ 𝑚 ↔ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(abs‘(𝐹𝑦)) ≤ 𝑚))
762rexbidv 3203 . 2 (𝑓 = 𝐹 → (∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝑓 ∩ (𝑥[,)+∞))(abs‘(𝑓𝑦)) ≤ 𝑚 ↔ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(abs‘(𝐹𝑦)) ≤ 𝑚))
8 df-o1 15443 . 2 𝑂(1) = {𝑓 ∈ (ℂ ↑pm ℝ) ∣ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝑓 ∩ (𝑥[,)+∞))(abs‘(𝑓𝑦)) ≤ 𝑚}
97, 8elrab2 3638 1 (𝐹 ∈ 𝑂(1) ↔ (𝐹 ∈ (ℂ ↑pm ℝ) ∧ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(abs‘(𝐹𝑦)) ≤ 𝑚))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1542  wcel 2114  wral 3052  wrex 3062  cin 3889   class class class wbr 5086  dom cdm 5624  cfv 6492  (class class class)co 7360  pm cpm 8767  cc 11027  cr 11028  +∞cpnf 11167  cle 11171  [,)cico 13291  abscabs 15187  𝑂(1)co1 15439
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-dm 5634  df-iota 6448  df-fv 6500  df-o1 15443
This theorem is referenced by:  elo12  15480  o1f  15482  o1dm  15483
  Copyright terms: Public domain W3C validator