Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > o1compt | Structured version Visualization version GIF version |
Description: Sufficient condition for transforming the index set of an eventually bounded function. (Contributed by Mario Carneiro, 12-May-2016.) |
Ref | Expression |
---|---|
o1compt.1 | ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) |
o1compt.2 | ⊢ (𝜑 → 𝐹 ∈ 𝑂(1)) |
o1compt.3 | ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝐶 ∈ 𝐴) |
o1compt.4 | ⊢ (𝜑 → 𝐵 ⊆ ℝ) |
o1compt.5 | ⊢ ((𝜑 ∧ 𝑚 ∈ ℝ) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 → 𝑚 ≤ 𝐶)) |
Ref | Expression |
---|---|
o1compt | ⊢ (𝜑 → (𝐹 ∘ (𝑦 ∈ 𝐵 ↦ 𝐶)) ∈ 𝑂(1)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | o1compt.1 | . 2 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) | |
2 | o1compt.2 | . 2 ⊢ (𝜑 → 𝐹 ∈ 𝑂(1)) | |
3 | o1compt.3 | . . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝐶 ∈ 𝐴) | |
4 | eqid 2622 | . . 3 ⊢ (𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑦 ∈ 𝐵 ↦ 𝐶) | |
5 | 3, 4 | fmptd 6385 | . 2 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ 𝐶):𝐵⟶𝐴) |
6 | o1compt.4 | . 2 ⊢ (𝜑 → 𝐵 ⊆ ℝ) | |
7 | o1compt.5 | . . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ ℝ) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 → 𝑚 ≤ 𝐶)) | |
8 | nfv 1843 | . . . . . . . 8 ⊢ Ⅎ𝑦 𝑥 ≤ 𝑧 | |
9 | nfcv 2764 | . . . . . . . . 9 ⊢ Ⅎ𝑦𝑚 | |
10 | nfcv 2764 | . . . . . . . . 9 ⊢ Ⅎ𝑦 ≤ | |
11 | nffvmpt1 6199 | . . . . . . . . 9 ⊢ Ⅎ𝑦((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧) | |
12 | 9, 10, 11 | nfbr 4699 | . . . . . . . 8 ⊢ Ⅎ𝑦 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧) |
13 | 8, 12 | nfim 1825 | . . . . . . 7 ⊢ Ⅎ𝑦(𝑥 ≤ 𝑧 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧)) |
14 | nfv 1843 | . . . . . . 7 ⊢ Ⅎ𝑧(𝑥 ≤ 𝑦 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦)) | |
15 | breq2 4657 | . . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝑥 ≤ 𝑧 ↔ 𝑥 ≤ 𝑦)) | |
16 | fveq2 6191 | . . . . . . . . 9 ⊢ (𝑧 = 𝑦 → ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧) = ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦)) | |
17 | 16 | breq2d 4665 | . . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧) ↔ 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦))) |
18 | 15, 17 | imbi12d 334 | . . . . . . 7 ⊢ (𝑧 = 𝑦 → ((𝑥 ≤ 𝑧 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧)) ↔ (𝑥 ≤ 𝑦 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦)))) |
19 | 13, 14, 18 | cbvral 3167 | . . . . . 6 ⊢ (∀𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧)) ↔ ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦))) |
20 | simpr 477 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵) | |
21 | 4 | fvmpt2 6291 | . . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝐶 ∈ 𝐴) → ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦) = 𝐶) |
22 | 20, 3, 21 | syl2anc 693 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦) = 𝐶) |
23 | 22 | breq2d 4665 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦) ↔ 𝑚 ≤ 𝐶)) |
24 | 23 | imbi2d 330 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ((𝑥 ≤ 𝑦 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦)) ↔ (𝑥 ≤ 𝑦 → 𝑚 ≤ 𝐶))) |
25 | 24 | ralbidva 2985 | . . . . . 6 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦)) ↔ ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 → 𝑚 ≤ 𝐶))) |
26 | 19, 25 | syl5bb 272 | . . . . 5 ⊢ (𝜑 → (∀𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧)) ↔ ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 → 𝑚 ≤ 𝐶))) |
27 | 26 | rexbidv 3052 | . . . 4 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧)) ↔ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 → 𝑚 ≤ 𝐶))) |
28 | 27 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ ℝ) → (∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧)) ↔ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 → 𝑚 ≤ 𝐶))) |
29 | 7, 28 | mpbird 247 | . 2 ⊢ ((𝜑 ∧ 𝑚 ∈ ℝ) → ∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧))) |
30 | 1, 2, 5, 6, 29 | o1co 14317 | 1 ⊢ (𝜑 → (𝐹 ∘ (𝑦 ∈ 𝐵 ↦ 𝐶)) ∈ 𝑂(1)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∀wral 2912 ∃wrex 2913 ⊆ wss 3574 class class class wbr 4653 ↦ cmpt 4729 ∘ ccom 5118 ⟶wf 5884 ‘cfv 5888 ℂcc 9934 ℝcr 9935 ≤ cle 10075 𝑂(1)co1 14217 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-pre-lttri 10010 ax-pre-lttrn 10011 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-po 5035 df-so 5036 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-er 7742 df-pm 7860 df-en 7956 df-dom 7957 df-sdom 7958 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-ico 12181 df-o1 14221 |
This theorem is referenced by: dchrisum0 25209 |
Copyright terms: Public domain | W3C validator |