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

Theorem lo1res 15512
Description: The restriction of an eventually upper bounded function is eventually upper bounded. (Contributed by Mario Carneiro, 15-Sep-2014.)
Assertion
Ref Expression
lo1res (𝐹 ∈ ≤𝑂(1) → (𝐹𝐴) ∈ ≤𝑂(1))

Proof of Theorem lo1res
Dummy variables 𝑥 𝑚 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lo1f 15471 . . . 4 (𝐹 ∈ ≤𝑂(1) → 𝐹:dom 𝐹⟶ℝ)
2 lo1bdd 15473 . . . 4 ((𝐹 ∈ ≤𝑂(1) ∧ 𝐹:dom 𝐹⟶ℝ) → ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ dom 𝐹(𝑥𝑦 → (𝐹𝑦) ≤ 𝑚))
31, 2mpdan 693 . . 3 (𝐹 ∈ ≤𝑂(1) → ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ dom 𝐹(𝑥𝑦 → (𝐹𝑦) ≤ 𝑚))
4 inss1 4165 . . . . . . 7 (dom 𝐹𝐴) ⊆ dom 𝐹
5 ssralv 3983 . . . . . . 7 ((dom 𝐹𝐴) ⊆ dom 𝐹 → (∀𝑦 ∈ dom 𝐹(𝑥𝑦 → (𝐹𝑦) ≤ 𝑚) → ∀𝑦 ∈ (dom 𝐹𝐴)(𝑥𝑦 → (𝐹𝑦) ≤ 𝑚)))
64, 5ax-mp 5 . . . . . 6 (∀𝑦 ∈ dom 𝐹(𝑥𝑦 → (𝐹𝑦) ≤ 𝑚) → ∀𝑦 ∈ (dom 𝐹𝐴)(𝑥𝑦 → (𝐹𝑦) ≤ 𝑚))
7 elinel2 4131 . . . . . . . . . 10 (𝑦 ∈ (dom 𝐹𝐴) → 𝑦𝐴)
87fvresd 6847 . . . . . . . . 9 (𝑦 ∈ (dom 𝐹𝐴) → ((𝐹𝐴)‘𝑦) = (𝐹𝑦))
98breq1d 5082 . . . . . . . 8 (𝑦 ∈ (dom 𝐹𝐴) → (((𝐹𝐴)‘𝑦) ≤ 𝑚 ↔ (𝐹𝑦) ≤ 𝑚))
109imbi2d 341 . . . . . . 7 (𝑦 ∈ (dom 𝐹𝐴) → ((𝑥𝑦 → ((𝐹𝐴)‘𝑦) ≤ 𝑚) ↔ (𝑥𝑦 → (𝐹𝑦) ≤ 𝑚)))
1110ralbiia 3083 . . . . . 6 (∀𝑦 ∈ (dom 𝐹𝐴)(𝑥𝑦 → ((𝐹𝐴)‘𝑦) ≤ 𝑚) ↔ ∀𝑦 ∈ (dom 𝐹𝐴)(𝑥𝑦 → (𝐹𝑦) ≤ 𝑚))
126, 11sylibr 235 . . . . 5 (∀𝑦 ∈ dom 𝐹(𝑥𝑦 → (𝐹𝑦) ≤ 𝑚) → ∀𝑦 ∈ (dom 𝐹𝐴)(𝑥𝑦 → ((𝐹𝐴)‘𝑦) ≤ 𝑚))
1312reximi 3077 . . . 4 (∃𝑚 ∈ ℝ ∀𝑦 ∈ dom 𝐹(𝑥𝑦 → (𝐹𝑦) ≤ 𝑚) → ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹𝐴)(𝑥𝑦 → ((𝐹𝐴)‘𝑦) ≤ 𝑚))
1413reximi 3077 . . 3 (∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ dom 𝐹(𝑥𝑦 → (𝐹𝑦) ≤ 𝑚) → ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹𝐴)(𝑥𝑦 → ((𝐹𝐴)‘𝑦) ≤ 𝑚))
153, 14syl 17 . 2 (𝐹 ∈ ≤𝑂(1) → ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹𝐴)(𝑥𝑦 → ((𝐹𝐴)‘𝑦) ≤ 𝑚))
16 fssres 6693 . . . . 5 ((𝐹:dom 𝐹⟶ℝ ∧ (dom 𝐹𝐴) ⊆ dom 𝐹) → (𝐹 ↾ (dom 𝐹𝐴)):(dom 𝐹𝐴)⟶ℝ)
171, 4, 16sylancl 592 . . . 4 (𝐹 ∈ ≤𝑂(1) → (𝐹 ↾ (dom 𝐹𝐴)):(dom 𝐹𝐴)⟶ℝ)
18 resres 5944 . . . . . 6 ((𝐹 ↾ dom 𝐹) ↾ 𝐴) = (𝐹 ↾ (dom 𝐹𝐴))
19 ffn 6655 . . . . . . . 8 (𝐹:dom 𝐹⟶ℝ → 𝐹 Fn dom 𝐹)
20 fnresdm 6604 . . . . . . . 8 (𝐹 Fn dom 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹)
211, 19, 203syl 18 . . . . . . 7 (𝐹 ∈ ≤𝑂(1) → (𝐹 ↾ dom 𝐹) = 𝐹)
2221reseq1d 5930 . . . . . 6 (𝐹 ∈ ≤𝑂(1) → ((𝐹 ↾ dom 𝐹) ↾ 𝐴) = (𝐹𝐴))
2318, 22eqtr3id 2788 . . . . 5 (𝐹 ∈ ≤𝑂(1) → (𝐹 ↾ (dom 𝐹𝐴)) = (𝐹𝐴))
2423feq1d 6637 . . . 4 (𝐹 ∈ ≤𝑂(1) → ((𝐹 ↾ (dom 𝐹𝐴)):(dom 𝐹𝐴)⟶ℝ ↔ (𝐹𝐴):(dom 𝐹𝐴)⟶ℝ))
2517, 24mpbid 233 . . 3 (𝐹 ∈ ≤𝑂(1) → (𝐹𝐴):(dom 𝐹𝐴)⟶ℝ)
26 lo1dm 15472 . . . 4 (𝐹 ∈ ≤𝑂(1) → dom 𝐹 ⊆ ℝ)
274, 26sstrid 3926 . . 3 (𝐹 ∈ ≤𝑂(1) → (dom 𝐹𝐴) ⊆ ℝ)
28 ello12 15469 . . 3 (((𝐹𝐴):(dom 𝐹𝐴)⟶ℝ ∧ (dom 𝐹𝐴) ⊆ ℝ) → ((𝐹𝐴) ∈ ≤𝑂(1) ↔ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹𝐴)(𝑥𝑦 → ((𝐹𝐴)‘𝑦) ≤ 𝑚)))
2925, 27, 28syl2anc 590 . 2 (𝐹 ∈ ≤𝑂(1) → ((𝐹𝐴) ∈ ≤𝑂(1) ↔ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹𝐴)(𝑥𝑦 → ((𝐹𝐴)‘𝑦) ≤ 𝑚)))
3015, 29mpbird 258 1 (𝐹 ∈ ≤𝑂(1) → (𝐹𝐴) ∈ ≤𝑂(1))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207   = wceq 1547  wcel 2119  wral 3053  wrex 3063  cin 3882  wss 3883   class class class wbr 5072  dom cdm 5618  cres 5620   Fn wfn 6480  wf 6481  cfv 6485  cr 11028  cle 11171  ≤𝑂(1)clo1 15440
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678  ax-cnex 11085  ax-resscn 11086  ax-pre-lttri 11103  ax-pre-lttrn 11104
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-nel 3039  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-po 5526  df-so 5527  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-er 8633  df-pm 8766  df-en 8884  df-dom 8885  df-sdom 8886  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-ico 13295  df-lo1 15444
This theorem is referenced by:  o1res  15513  lo1res2  15515  lo1resb  15517
  Copyright terms: Public domain W3C validator