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

Theorem ello1mpt 15732
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 7147 . . 3 (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℝ)
3 ello1mpt.1 . . 3 (𝜑 → 𝐴 ⊆ ℝ)
4 ello12 15727 . . 3 (((𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ ≤𝑂(1) ↔ ∃𝑦 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚)))
52, 3, 4syl2anc 596 . 2 (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ ≤𝑂(1) ↔ ∃𝑦 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚)))
6 nfv 1949 . . . . . 6 Ⅎ𝑥 𝑦 ≤ 𝑧
7 nffvmpt1 6927 . . . . . . 7 Ⅎ𝑥((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧)
8 nfcv 2926 . . . . . . 7 Ⅎ𝑥 ≤
9 nfcv 2926 . . . . . . 7 Ⅎ𝑥𝑚
107, 8, 9nfbr 5158 . . . . . 6 Ⅎ𝑥((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚
116, 10nfim 1931 . . . . 5 Ⅎ𝑥(𝑦 ≤ 𝑧 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚)
12 nfv 1949 . . . . 5 Ⅎ𝑧(𝑦 ≤ 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ≤ 𝑚)
13 breq2 5112 . . . . . 6 (𝑧 = 𝑥 → (𝑦 ≤ 𝑧 ↔ 𝑦 ≤ 𝑥))
14 fveq2 6916 . . . . . . 7 (𝑧 = 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
1514breq1d 5118 . . . . . 6 (𝑧 = 𝑥 → (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚 ↔ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ≤ 𝑚))
1613, 15imbi12d 347 . . . . 5 (𝑧 = 𝑥 → ((𝑦 ≤ 𝑧 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚) ↔ (𝑦 ≤ 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ≤ 𝑚)))
1711, 12, 16cbvralw 3308 . . . 4 (∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚) ↔ ∀𝑥 ∈ 𝐴 (𝑦 ≤ 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ≤ 𝑚))
18 simpr 490 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
19 eqid 2763 . . . . . . . . 9 (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
2019fvmpt2 7036 . . . . . . . 8 ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ ℝ) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
2118, 1, 20syl2anc 596 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
2221breq1d 5118 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ≤ 𝑚 ↔ 𝐵 ≤ 𝑚))
2322imbi2d 343 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑦 ≤ 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ≤ 𝑚) ↔ (𝑦 ≤ 𝑥 → 𝐵 ≤ 𝑚)))
2423ralbidva 3187 . . . 4 (𝜑 → (∀𝑥 ∈ 𝐴 (𝑦 ≤ 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ≤ 𝑚) ↔ ∀𝑥 ∈ 𝐴 (𝑦 ≤ 𝑥 → 𝐵 ≤ 𝑚)))
2517, 24bitrid 286 . . 3 (𝜑 → (∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚) ↔ ∀𝑥 ∈ 𝐴 (𝑦 ≤ 𝑥 → 𝐵 ≤ 𝑚)))
26252rexbidv 3231 . 2 (𝜑 → (∃𝑦 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚) ↔ ∃𝑦 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑥 ∈ 𝐴 (𝑦 ≤ 𝑥 → 𝐵 ≤ 𝑚)))
275, 26bitrd 282 1 (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ ≤𝑂(1) ↔ ∃𝑦 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑥 ∈ 𝐴 (𝑦 ≤ 𝑥 → 𝐵 ≤ 𝑚)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900   class class class wbr 5108   ↦ cmpt 5192  ⟶wf 6562  ‘cfv 6566  ℝcr 11238   ≤ cle 11383  ≤𝑂(1)clo1 15698
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-pre-lttri 11313  ax-pre-lttrn 11314
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-po 5566  df-so 5567  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-er 8755  df-pm 8888  df-en 9012  df-dom 9013  df-sdom 9014  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-ico 13522  df-lo1 15702
This theorem is used by:  ello1mpt2  15733  ello1d  15734  elo1mpt  15745  o1lo1  15748  lo1resb  15775  lo1add  15838  lo1mul  15839  lo1le  15863
  Copyright terms: Public domain W3C validator