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

Theorem ello1mpt 15483
Description: Elementhood in the set of eventually upper bounded functions. (Contributed by Mario Carneiro, 26-May-2016.)
Hypotheses
Ref Expression
ello1mpt.1 (𝜑𝐴 ⊆ ℝ)
ello1mpt.2 ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ)
Assertion
Ref Expression
ello1mpt (𝜑 → ((𝑥𝐴𝐵) ∈ ≤𝑂(1) ↔ ∃𝑦 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑥𝐴 (𝑦𝑥𝐵𝑚)))
Distinct variable groups:   𝑥,𝑚,𝑦,𝐴   𝐵,𝑚,𝑦   𝜑,𝑚,𝑥,𝑦
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem ello1mpt
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 ello1mpt.2 . . . 4 ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ)
21fmpttd 7067 . . 3 (𝜑 → (𝑥𝐴𝐵):𝐴⟶ℝ)
3 ello1mpt.1 . . 3 (𝜑𝐴 ⊆ ℝ)
4 ello12 15478 . . 3 (((𝑥𝐴𝐵):𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((𝑥𝐴𝐵) ∈ ≤𝑂(1) ↔ ∃𝑦 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑧𝐴 (𝑦𝑧 → ((𝑥𝐴𝐵)‘𝑧) ≤ 𝑚)))
52, 3, 4syl2anc 585 . 2 (𝜑 → ((𝑥𝐴𝐵) ∈ ≤𝑂(1) ↔ ∃𝑦 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑧𝐴 (𝑦𝑧 → ((𝑥𝐴𝐵)‘𝑧) ≤ 𝑚)))
6 nfv 1916 . . . . . 6 𝑥 𝑦𝑧
7 nffvmpt1 6851 . . . . . . 7 𝑥((𝑥𝐴𝐵)‘𝑧)
8 nfcv 2898 . . . . . . 7 𝑥
9 nfcv 2898 . . . . . . 7 𝑥𝑚
107, 8, 9nfbr 5132 . . . . . 6 𝑥((𝑥𝐴𝐵)‘𝑧) ≤ 𝑚
116, 10nfim 1898 . . . . 5 𝑥(𝑦𝑧 → ((𝑥𝐴𝐵)‘𝑧) ≤ 𝑚)
12 nfv 1916 . . . . 5 𝑧(𝑦𝑥 → ((𝑥𝐴𝐵)‘𝑥) ≤ 𝑚)
13 breq2 5089 . . . . . 6 (𝑧 = 𝑥 → (𝑦𝑧𝑦𝑥))
14 fveq2 6840 . . . . . . 7 (𝑧 = 𝑥 → ((𝑥𝐴𝐵)‘𝑧) = ((𝑥𝐴𝐵)‘𝑥))
1514breq1d 5095 . . . . . 6 (𝑧 = 𝑥 → (((𝑥𝐴𝐵)‘𝑧) ≤ 𝑚 ↔ ((𝑥𝐴𝐵)‘𝑥) ≤ 𝑚))
1613, 15imbi12d 344 . . . . 5 (𝑧 = 𝑥 → ((𝑦𝑧 → ((𝑥𝐴𝐵)‘𝑧) ≤ 𝑚) ↔ (𝑦𝑥 → ((𝑥𝐴𝐵)‘𝑥) ≤ 𝑚)))
1711, 12, 16cbvralw 3279 . . . 4 (∀𝑧𝐴 (𝑦𝑧 → ((𝑥𝐴𝐵)‘𝑧) ≤ 𝑚) ↔ ∀𝑥𝐴 (𝑦𝑥 → ((𝑥𝐴𝐵)‘𝑥) ≤ 𝑚))
18 simpr 484 . . . . . . . 8 ((𝜑𝑥𝐴) → 𝑥𝐴)
19 eqid 2736 . . . . . . . . 9 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
2019fvmpt2 6959 . . . . . . . 8 ((𝑥𝐴𝐵 ∈ ℝ) → ((𝑥𝐴𝐵)‘𝑥) = 𝐵)
2118, 1, 20syl2anc 585 . . . . . . 7 ((𝜑𝑥𝐴) → ((𝑥𝐴𝐵)‘𝑥) = 𝐵)
2221breq1d 5095 . . . . . 6 ((𝜑𝑥𝐴) → (((𝑥𝐴𝐵)‘𝑥) ≤ 𝑚𝐵𝑚))
2322imbi2d 340 . . . . 5 ((𝜑𝑥𝐴) → ((𝑦𝑥 → ((𝑥𝐴𝐵)‘𝑥) ≤ 𝑚) ↔ (𝑦𝑥𝐵𝑚)))
2423ralbidva 3158 . . . 4 (𝜑 → (∀𝑥𝐴 (𝑦𝑥 → ((𝑥𝐴𝐵)‘𝑥) ≤ 𝑚) ↔ ∀𝑥𝐴 (𝑦𝑥𝐵𝑚)))
2517, 24bitrid 283 . . 3 (𝜑 → (∀𝑧𝐴 (𝑦𝑧 → ((𝑥𝐴𝐵)‘𝑧) ≤ 𝑚) ↔ ∀𝑥𝐴 (𝑦𝑥𝐵𝑚)))
26252rexbidv 3202 . 2 (𝜑 → (∃𝑦 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑧𝐴 (𝑦𝑧 → ((𝑥𝐴𝐵)‘𝑧) ≤ 𝑚) ↔ ∃𝑦 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑥𝐴 (𝑦𝑥𝐵𝑚)))
275, 26bitrd 279 1 (𝜑 → ((𝑥𝐴𝐵) ∈ ≤𝑂(1) ↔ ∃𝑦 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑥𝐴 (𝑦𝑥𝐵𝑚)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wral 3051  wrex 3061  wss 3889   class class class wbr 5085  cmpt 5166  wf 6494  cfv 6498  cr 11037  cle 11180  ≤𝑂(1)clo1 15449
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-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-pre-lttri 11112  ax-pre-lttrn 11113
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-po 5539  df-so 5540  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-er 8643  df-pm 8776  df-en 8894  df-dom 8895  df-sdom 8896  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-ico 13304  df-lo1 15453
This theorem is referenced by:  ello1mpt2  15484  ello1d  15485  elo1mpt  15496  o1lo1  15499  lo1resb  15526  lo1add  15589  lo1mul  15590  lo1le  15614
  Copyright terms: Public domain W3C validator