Theorem ello1 15694

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 5889	. . . . 5 ⊢ (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
2	1	ineq1d 4118	. . . 4 ⊢ (𝑓 = 𝐹 → (dom 𝑓 ∩ (𝑥[,)+∞)) = (dom 𝐹 ∩ (𝑥[,)+∞)))
3		fveq1 6892	. . . . 5 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑦) = (𝐹‘𝑦))
4	3	breq1d 5115	. . . 4 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑦) ≤ 𝑚 ↔ (𝐹‘𝑦) ≤ 𝑚))
5	2, 4	raleqbidv 3337	. . 3 ⊢ (𝑓 = 𝐹 → (∀𝑦 ∈ (dom 𝑓 ∩ (𝑥[,)+∞))(𝑓‘𝑦) ≤ 𝑚 ↔ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(𝐹‘𝑦) ≤ 𝑚))
6	5	2rexbidv 3230	. 2 ⊢ (𝑓 = 𝐹 → (∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝑓 ∩ (𝑥[,)+∞))(𝑓‘𝑦) ≤ 𝑚 ↔ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(𝐹‘𝑦) ≤ 𝑚))
7		df-lo1 15670	. 2 ⊢ ≤𝑂(1) = {𝑓 ∈ (ℝ ↑pm ℝ) ∣ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝑓 ∩ (𝑥[,)+∞))(𝑓‘𝑦) ≤ 𝑚}
8	6, 7	elrab2 3651	1 ⊢ (𝐹 ∈ ≤𝑂(1) ↔ (𝐹 ∈ (ℝ ↑pm ℝ) ∧ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ (𝑥[,)+∞))(𝐹‘𝑦) ≤ 𝑚))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ∀wral 3079  ∃wrex 3089   ∩ cin 4091   class class class wbr 5105  dom cdm 5654  ‘cfv 6546  (class class class)co 7427   ↑_pm cpm 8859  ℝcr 11209  +∞cpnf 11350   ≤ cle 11354  [,)cico 13488  ≤𝑂(1)clo1 15666

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-dm 5664  df-iota 6500  df-fv 6554  df-lo1 15670

This theorem is used by:  ello12  15695  lo1f  15697  lo1dm  15698