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

Theorem elo1 15492
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 5867 . . . . 5 (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
21ineq1d 4182 . . . 4 (𝑓 = 𝐹 → (dom 𝑓 ∩ (𝑥[,)+∞)) = (dom 𝐹 ∩ (𝑥[,)+∞)))
3 fveq1 6857 . . . . . 6 (𝑓 = 𝐹 → (𝑓𝑦) = (𝐹𝑦))
43fveq2d 6862 . . . . 5 (𝑓 = 𝐹 → (abs‘(𝑓𝑦)) = (abs‘(𝐹𝑦)))
54breq1d 5117 . . . 4 (𝑓 = 𝐹 → ((abs‘(𝑓𝑦)) ≤ 𝑚 ↔ (abs‘(𝐹𝑦)) ≤ 𝑚))
62, 5raleqbidv 3319 . . 3 (𝑓 = 𝐹 → (∀𝑦 ∈ (dom 𝑓 ∩ (𝑥[,)+∞))(abs‘(𝑓𝑦)) ≤ 𝑚 ↔ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(abs‘(𝐹𝑦)) ≤ 𝑚))
762rexbidv 3202 . 2 (𝑓 = 𝐹 → (∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝑓 ∩ (𝑥[,)+∞))(abs‘(𝑓𝑦)) ≤ 𝑚 ↔ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(abs‘(𝐹𝑦)) ≤ 𝑚))
8 df-o1 15456 . 2 𝑂(1) = {𝑓 ∈ (ℂ ↑pm ℝ) ∣ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝑓 ∩ (𝑥[,)+∞))(abs‘(𝑓𝑦)) ≤ 𝑚}
97, 8elrab2 3662 1 (𝐹 ∈ 𝑂(1) ↔ (𝐹 ∈ (ℂ ↑pm ℝ) ∧ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(abs‘(𝐹𝑦)) ≤ 𝑚))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1540  wcel 2109  wral 3044  wrex 3053  cin 3913   class class class wbr 5107  dom cdm 5638  cfv 6511  (class class class)co 7387  pm cpm 8800  cc 11066  cr 11067  +∞cpnf 11205  cle 11209  [,)cico 13308  abscabs 15200  𝑂(1)co1 15452
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-dm 5648  df-iota 6464  df-fv 6519  df-o1 15456
This theorem is referenced by:  elo12  15493  o1f  15495  o1dm  15496
  Copyright terms: Public domain W3C validator