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

Theorem ello1mpt 15697
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 7120 . . 3 (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℝ)
3 ello1mpt.1 . . 3 (𝜑 → 𝐴 ⊆ ℝ)
4 ello12 15692 . . 3 (((𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ ≤𝑂(1) ↔ ∃𝑦 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚)))
52, 3, 4syl2anc 596 . 2 (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ ≤𝑂(1) ↔ ∃𝑦 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚)))
6 nfv 1946 . . . . . 6 Ⅎ𝑥 𝑦 ≤ 𝑧
7 nffvmpt1 6901 . . . . . . 7 Ⅎ𝑥((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧)
8 nfcv 2922 . . . . . . 7 Ⅎ𝑥 ≤
9 nfcv 2922 . . . . . . 7 Ⅎ𝑥𝑚
107, 8, 9nfbr 5151 . . . . . 6 Ⅎ𝑥((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚
116, 10nfim 1928 . . . . 5 Ⅎ𝑥(𝑦 ≤ 𝑧 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚)
12 nfv 1946 . . . . 5 Ⅎ𝑧(𝑦 ≤ 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ≤ 𝑚)
13 breq2 5106 . . . . . 6 (𝑧 = 𝑥 → (𝑦 ≤ 𝑧 ↔ 𝑦 ≤ 𝑥))
14 fveq2 6890 . . . . . . 7 (𝑧 = 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
1514breq1d 5112 . . . . . 6 (𝑧 = 𝑥 → (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚 ↔ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ≤ 𝑚))
1613, 15imbi12d 347 . . . . 5 (𝑧 = 𝑥 → ((𝑦 ≤ 𝑧 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚) ↔ (𝑦 ≤ 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ≤ 𝑚)))
1711, 12, 16cbvralw 3304 . . . 4 (∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚) ↔ ∀𝑥 ∈ 𝐴 (𝑦 ≤ 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ≤ 𝑚))
18 simpr 490 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
19 eqid 2760 . . . . . . . . 9 (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
2019fvmpt2 7010 . . . . . . . 8 ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ ℝ) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
2118, 1, 20syl2anc 596 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
2221breq1d 5112 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ≤ 𝑚 ↔ 𝐵 ≤ 𝑚))
2322imbi2d 343 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑦 ≤ 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ≤ 𝑚) ↔ (𝑦 ≤ 𝑥 → 𝐵 ≤ 𝑚)))
2423ralbidva 3183 . . . 4 (𝜑 → (∀𝑥 ∈ 𝐴 (𝑦 ≤ 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ≤ 𝑚) ↔ ∀𝑥 ∈ 𝐴 (𝑦 ≤ 𝑥 → 𝐵 ≤ 𝑚)))
2517, 24bitrid 286 . . 3 (𝜑 → (∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ≤ 𝑚) ↔ ∀𝑥 ∈ 𝐴 (𝑦 ≤ 𝑥 → 𝐵 ≤ 𝑚)))
26252rexbidv 3227 . 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 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086   ⊆ wss 3896   class class class wbr 5102   ↦ cmpt 5185  ⟶wf 6539  ‘cfv 6543  ℝcr 11206   ≤ cle 11351  ≤𝑂(1)clo1 15663
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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755  ax-cnex 11263  ax-resscn 11264  ax-pre-lttri 11281  ax-pre-lttrn 11282
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-po 5559  df-so 5560  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7427  df-oprab 7428  df-mpo 7429  df-er 8724  df-pm 8857  df-en 8981  df-dom 8982  df-sdom 8983  df-pnf 11352  df-mnf 11353  df-xr 11354  df-ltxr 11355  df-le 11356  df-ico 13489  df-lo1 15667
This theorem is used by:  ello1mpt2  15698  ello1d  15699  elo1mpt  15710  o1lo1  15713  lo1resb  15740  lo1add  15803  lo1mul  15804  lo1le  15828
  Copyright terms: Public domain W3C validator