Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > lo1sub | Structured version Visualization version GIF version |
Description: The difference of an eventually upper bounded function and an eventually bounded function is eventually upper bounded. The "correct" sharp result here takes the second function to be eventually lower bounded instead of just bounded, but our notation for this is simply (𝑥 ∈ 𝐴 ↦ -𝐶) ∈ ≤𝑂(1), so it is just a special case of lo1add 15435. (Contributed by Mario Carneiro, 31-May-2016.) |
Ref | Expression |
---|---|
lo1sub.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) |
lo1sub.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℝ) |
lo1sub.3 | ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ ≤𝑂(1)) |
lo1sub.4 | ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝑂(1)) |
Ref | Expression |
---|---|
lo1sub | ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 − 𝐶)) ∈ ≤𝑂(1)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lo1sub.1 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) | |
2 | lo1sub.3 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ ≤𝑂(1)) | |
3 | 1, 2 | lo1mptrcl 15430 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ) |
4 | 3 | recnd 11104 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ) |
5 | lo1sub.2 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℝ) | |
6 | 5 | recnd 11104 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℂ) |
7 | 4, 6 | negsubd 11439 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 + -𝐶) = (𝐵 − 𝐶)) |
8 | 7 | mpteq2dva 5192 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + -𝐶)) = (𝑥 ∈ 𝐴 ↦ (𝐵 − 𝐶))) |
9 | 5 | renegcld 11503 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐶 ∈ ℝ) |
10 | lo1sub.4 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝑂(1)) | |
11 | 5 | o1lo1 15345 | . . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝑂(1) ↔ ((𝑥 ∈ 𝐴 ↦ 𝐶) ∈ ≤𝑂(1) ∧ (𝑥 ∈ 𝐴 ↦ -𝐶) ∈ ≤𝑂(1)))) |
12 | 10, 11 | mpbid 231 | . . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐶) ∈ ≤𝑂(1) ∧ (𝑥 ∈ 𝐴 ↦ -𝐶) ∈ ≤𝑂(1))) |
13 | 12 | simprd 496 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ -𝐶) ∈ ≤𝑂(1)) |
14 | 3, 9, 2, 13 | lo1add 15435 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + -𝐶)) ∈ ≤𝑂(1)) |
15 | 8, 14 | eqeltrrd 2838 | 1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 − 𝐶)) ∈ ≤𝑂(1)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∈ wcel 2105 ↦ cmpt 5175 (class class class)co 7337 ℝcr 10971 + caddc 10975 − cmin 11306 -cneg 11307 𝑂(1)co1 15294 ≤𝑂(1)clo1 15295 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 ax-sep 5243 ax-nul 5250 ax-pow 5308 ax-pr 5372 ax-un 7650 ax-cnex 11028 ax-resscn 11029 ax-1cn 11030 ax-icn 11031 ax-addcl 11032 ax-addrcl 11033 ax-mulcl 11034 ax-mulrcl 11035 ax-mulcom 11036 ax-addass 11037 ax-mulass 11038 ax-distr 11039 ax-i2m1 11040 ax-1ne0 11041 ax-1rid 11042 ax-rnegex 11043 ax-rrecex 11044 ax-cnre 11045 ax-pre-lttri 11046 ax-pre-lttrn 11047 ax-pre-ltadd 11048 ax-pre-mulgt0 11049 ax-pre-sup 11050 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3349 df-reu 3350 df-rab 3404 df-v 3443 df-sbc 3728 df-csb 3844 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3917 df-nul 4270 df-if 4474 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4853 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5176 df-tr 5210 df-id 5518 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5575 df-we 5577 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6238 df-ord 6305 df-on 6306 df-lim 6307 df-suc 6308 df-iota 6431 df-fun 6481 df-fn 6482 df-f 6483 df-f1 6484 df-fo 6485 df-f1o 6486 df-fv 6487 df-riota 7293 df-ov 7340 df-oprab 7341 df-mpo 7342 df-om 7781 df-2nd 7900 df-frecs 8167 df-wrecs 8198 df-recs 8272 df-rdg 8311 df-er 8569 df-pm 8689 df-en 8805 df-dom 8806 df-sdom 8807 df-sup 9299 df-pnf 11112 df-mnf 11113 df-xr 11114 df-ltxr 11115 df-le 11116 df-sub 11308 df-neg 11309 df-div 11734 df-nn 12075 df-2 12137 df-3 12138 df-n0 12335 df-z 12421 df-uz 12684 df-rp 12832 df-ico 13186 df-seq 13823 df-exp 13884 df-cj 14909 df-re 14910 df-im 14911 df-sqrt 15045 df-abs 15046 df-o1 15298 df-lo1 15299 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |