Theorem ello1 15590

Description: Elementhood in the set of eventually upper bounded functions. (Contributed by Mario Carneiro, 26-May-2016.)

Assertion

Ref	Expression
ello1	⊢ (𝐹 ∈ ≤𝑂(1) ↔ (𝐹 ∈ (ℝ ↑pm ℝ) ∧ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(𝐹‘𝑦) ≤ 𝑚))

Distinct variable group:   𝑥,𝑚,𝑦,𝐹

Proof of Theorem ello1

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dmeq 5895	. . . . 5 ⊢ (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
2	1	ineq1d 4172	. . . 4 ⊢ (𝑓 = 𝐹 → (dom 𝑓 ∩ (𝑥[,)+∞)) = (dom 𝐹 ∩ (𝑥[,)+∞)))
3		fveq1 6884	. . . . 5 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑦) = (𝐹‘𝑦))
4	3	breq1d 5121	. . . 4 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑦) ≤ 𝑚 ↔ (𝐹‘𝑦) ≤ 𝑚))
5	2, 4	raleqbidv 3340	. . 3 ⊢ (𝑓 = 𝐹 → (∀𝑦 ∈ (dom 𝑓 ∩ (𝑥[,)+∞))(𝑓‘𝑦) ≤ 𝑚 ↔ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(𝐹‘𝑦) ≤ 𝑚))
6	5	2rexbidv 3232	. 2 ⊢ (𝑓 = 𝐹 → (∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝑓 ∩ (𝑥[,)+∞))(𝑓‘𝑦) ≤ 𝑚 ↔ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(𝐹‘𝑦) ≤ 𝑚))
7		df-lo1 15566	. 2 ⊢ ≤𝑂(1) = {𝑓 ∈ (ℝ ↑pm ℝ) ∣ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝑓 ∩ (𝑥[,)+∞))(𝑓‘𝑦) ≤ 𝑚}
8	6, 7	elrab2 3656	1 ⊢ (𝐹 ∈ ≤𝑂(1) ↔ (𝐹 ∈ (ℝ ↑pm ℝ) ∧ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(𝐹‘𝑦) ≤ 𝑚))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ∃wrex 3091   ∩ cin 3905   class class class wbr 5111  dom cdm 5663  ‘cfv 6540  (class class class)co 7419   ↑_pm cpm 8831  ℝcr 11114  +∞cpnf 11255   ≤ cle 11259  [,)cico 13390  ≤𝑂(1)clo1 15562

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-dm 5673  df-iota 6496  df-fv 6548  df-lo1 15566

This theorem is used by:  ello12  15591  lo1f  15593  lo1dm  15594