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

Theorem lo1res 15735
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 15694 . . . 4 (𝐹 ∈ ≤𝑂(1) → 𝐹:dom 𝐹⟶ℝ)
2 lo1bdd 15696 . . . 4 ((𝐹 ∈ ≤𝑂(1) ∧ 𝐹:dom 𝐹⟶ℝ) → ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ dom 𝐹(𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ 𝑚))
31, 2mpdan 700 . . 3 (𝐹 ∈ ≤𝑂(1) → ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ dom 𝐹(𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ 𝑚))
4 inss1 4132 . . . . . . 7 (dom 𝐹 ∩ 𝐴) ⊆ dom 𝐹
5 ssralv 3978 . . . . . . 7 ((dom 𝐹 ∩ 𝐴) ⊆ dom 𝐹 → (∀𝑦 ∈ dom 𝐹(𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ 𝑚) → ∀𝑦 ∈ (dom 𝐹 ∩ 𝐴)(𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ 𝑚)))
64, 5ax-mp 5 . . . . . 6 (∀𝑦 ∈ dom 𝐹(𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ 𝑚) → ∀𝑦 ∈ (dom 𝐹 ∩ 𝐴)(𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ 𝑚))
7 elinel2 4098 . . . . . . . . . 10 (𝑦 ∈ (dom 𝐹 ∩ 𝐴) → 𝑦 ∈ 𝐴)
87fvresd 6910 . . . . . . . . 9 (𝑦 ∈ (dom 𝐹 ∩ 𝐴) → ((𝐹 ↾ 𝐴)‘𝑦) = (𝐹‘𝑦))
98breq1d 5112 . . . . . . . 8 (𝑦 ∈ (dom 𝐹 ∩ 𝐴) → (((𝐹 ↾ 𝐴)‘𝑦) ≤ 𝑚 ↔ (𝐹‘𝑦) ≤ 𝑚))
109imbi2d 343 . . . . . . 7 (𝑦 ∈ (dom 𝐹 ∩ 𝐴) → ((𝑥 ≤ 𝑦 → ((𝐹 ↾ 𝐴)‘𝑦) ≤ 𝑚) ↔ (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ 𝑚)))
1110ralbiia 3106 . . . . . 6 (∀𝑦 ∈ (dom 𝐹 ∩ 𝐴)(𝑥 ≤ 𝑦 → ((𝐹 ↾ 𝐴)‘𝑦) ≤ 𝑚) ↔ ∀𝑦 ∈ (dom 𝐹 ∩ 𝐴)(𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ 𝑚))
126, 11sylibr 237 . . . . 5 (∀𝑦 ∈ dom 𝐹(𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ 𝑚) → ∀𝑦 ∈ (dom 𝐹 ∩ 𝐴)(𝑥 ≤ 𝑦 → ((𝐹 ↾ 𝐴)‘𝑦) ≤ 𝑚))
1312reximi 3100 . . . 4 (∃𝑚 ∈ ℝ ∀𝑦 ∈ dom 𝐹(𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ 𝑚) → ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ 𝐴)(𝑥 ≤ 𝑦 → ((𝐹 ↾ 𝐴)‘𝑦) ≤ 𝑚))
1413reximi 3100 . . 3 (∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ dom 𝐹(𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ 𝑚) → ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ 𝐴)(𝑥 ≤ 𝑦 → ((𝐹 ↾ 𝐴)‘𝑦) ≤ 𝑚))
153, 14syl 18 . 2 (𝐹 ∈ ≤𝑂(1) → ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ 𝐴)(𝑥 ≤ 𝑦 → ((𝐹 ↾ 𝐴)‘𝑦) ≤ 𝑚))
16 fssres 6753 . . . . 5 ((𝐹:dom 𝐹⟶ℝ ∧ (dom 𝐹 ∩ 𝐴) ⊆ dom 𝐹) → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶ℝ)
171, 4, 16sylancl 598 . . . 4 (𝐹 ∈ ≤𝑂(1) → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶ℝ)
18 resres 5984 . . . . . 6 ((𝐹 ↾ dom 𝐹) ↾ 𝐴) = (𝐹 ↾ (dom 𝐹 ∩ 𝐴))
19 ffn 6714 . . . . . . . 8 (𝐹:dom 𝐹⟶ℝ → 𝐹 Fn dom 𝐹)
20 fnresdm 6663 . . . . . . . 8 (𝐹 Fn dom 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹)
211, 19, 203syl 19 . . . . . . 7 (𝐹 ∈ ≤𝑂(1) → (𝐹 ↾ dom 𝐹) = 𝐹)
2221reseq1d 5970 . . . . . 6 (𝐹 ∈ ≤𝑂(1) → ((𝐹 ↾ dom 𝐹) ↾ 𝐴) = (𝐹 ↾ 𝐴))
2318, 22eqtr3id 2809 . . . . 5 (𝐹 ∈ ≤𝑂(1) → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) = (𝐹 ↾ 𝐴))
2423feq1d 6696 . . . 4 (𝐹 ∈ ≤𝑂(1) → ((𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶ℝ ↔ (𝐹 ↾ 𝐴):(dom 𝐹 ∩ 𝐴)⟶ℝ))
2517, 24mpbid 235 . . 3 (𝐹 ∈ ≤𝑂(1) → (𝐹 ↾ 𝐴):(dom 𝐹 ∩ 𝐴)⟶ℝ)
26 lo1dm 15695 . . . 4 (𝐹 ∈ ≤𝑂(1) → dom 𝐹 ⊆ ℝ)
274, 26sstrid 3920 . . 3 (𝐹 ∈ ≤𝑂(1) → (dom 𝐹 ∩ 𝐴) ⊆ ℝ)
28 ello12 15692 . . 3 (((𝐹 ↾ 𝐴):(dom 𝐹 ∩ 𝐴)⟶ℝ ∧ (dom 𝐹 ∩ 𝐴) ⊆ ℝ) → ((𝐹 ↾ 𝐴) ∈ ≤𝑂(1) ↔ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ 𝐴)(𝑥 ≤ 𝑦 → ((𝐹 ↾ 𝐴)‘𝑦) ≤ 𝑚)))
2925, 27, 28syl2anc 596 . 2 (𝐹 ∈ ≤𝑂(1) → ((𝐹 ↾ 𝐴) ∈ ≤𝑂(1) ↔ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ (dom 𝐹 ∩ 𝐴)(𝑥 ≤ 𝑦 → ((𝐹 ↾ 𝐴)‘𝑦) ≤ 𝑚)))
3015, 29mpbird 260 1 (𝐹 ∈ ≤𝑂(1) → (𝐹 ↾ 𝐴) ∈ ≤𝑂(1))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086   ⊆ wss 3896   ∩ cin 4088   class class class wbr 5102  dom cdm 5651   ↾ cres 5653   Fn wfn 6538  ⟶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 8725  df-pm 8858  df-en 8982  df-dom 8983  df-sdom 8984  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:  o1res  15736  lo1res2  15738  lo1resb  15740
  Copyright terms: Public domain W3C validator