| 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 | 3 | fmpttd 7060 | . 2 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ 𝐶):𝐵⟶𝐴) |
| 5 | o1compt.4 | . 2 ⊢ (𝜑 → 𝐵 ⊆ ℝ) | |
| 6 | o1compt.5 | . . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ ℝ) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 → 𝑚 ≤ 𝐶)) | |
| 7 | nfv 1915 | . . . . . . . 8 ⊢ Ⅎ𝑦 𝑥 ≤ 𝑧 | |
| 8 | nfcv 2898 | . . . . . . . . 9 ⊢ Ⅎ𝑦𝑚 | |
| 9 | nfcv 2898 | . . . . . . . . 9 ⊢ Ⅎ𝑦 ≤ | |
| 10 | nffvmpt1 6845 | . . . . . . . . 9 ⊢ Ⅎ𝑦((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧) | |
| 11 | 8, 9, 10 | nfbr 5145 | . . . . . . . 8 ⊢ Ⅎ𝑦 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧) |
| 12 | 7, 11 | nfim 1897 | . . . . . . 7 ⊢ Ⅎ𝑦(𝑥 ≤ 𝑧 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧)) |
| 13 | nfv 1915 | . . . . . . 7 ⊢ Ⅎ𝑧(𝑥 ≤ 𝑦 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦)) | |
| 14 | breq2 5102 | . . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝑥 ≤ 𝑧 ↔ 𝑥 ≤ 𝑦)) | |
| 15 | fveq2 6834 | . . . . . . . . 9 ⊢ (𝑧 = 𝑦 → ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧) = ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦)) | |
| 16 | 15 | breq2d 5110 | . . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧) ↔ 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦))) |
| 17 | 14, 16 | imbi12d 344 | . . . . . . 7 ⊢ (𝑧 = 𝑦 → ((𝑥 ≤ 𝑧 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧)) ↔ (𝑥 ≤ 𝑦 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦)))) |
| 18 | 12, 13, 17 | cbvralw 3278 | . . . . . 6 ⊢ (∀𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧)) ↔ ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦))) |
| 19 | simpr 484 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵) | |
| 20 | eqid 2736 | . . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑦 ∈ 𝐵 ↦ 𝐶) | |
| 21 | 20 | fvmpt2 6952 | . . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝐶 ∈ 𝐴) → ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦) = 𝐶) |
| 22 | 19, 3, 21 | syl2anc 584 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦) = 𝐶) |
| 23 | 22 | breq2d 5110 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦) ↔ 𝑚 ≤ 𝐶)) |
| 24 | 23 | imbi2d 340 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ((𝑥 ≤ 𝑦 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦)) ↔ (𝑥 ≤ 𝑦 → 𝑚 ≤ 𝐶))) |
| 25 | 24 | ralbidva 3157 | . . . . . 6 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑦)) ↔ ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 → 𝑚 ≤ 𝐶))) |
| 26 | 18, 25 | bitrid 283 | . . . . 5 ⊢ (𝜑 → (∀𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧)) ↔ ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 → 𝑚 ≤ 𝐶))) |
| 27 | 26 | rexbidv 3160 | . . . 4 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧)) ↔ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 → 𝑚 ≤ 𝐶))) |
| 28 | 27 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ ℝ) → (∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧)) ↔ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 → 𝑚 ≤ 𝐶))) |
| 29 | 6, 28 | mpbird 257 | . 2 ⊢ ((𝜑 ∧ 𝑚 ∈ ℝ) → ∃𝑥 ∈ ℝ ∀𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 → 𝑚 ≤ ((𝑦 ∈ 𝐵 ↦ 𝐶)‘𝑧))) |
| 30 | 1, 2, 4, 5, 29 | o1co 15509 | 1 ⊢ (𝜑 → (𝐹 ∘ (𝑦 ∈ 𝐵 ↦ 𝐶)) ∈ 𝑂(1)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3051 ∃wrex 3060 ⊆ wss 3901 class class class wbr 5098 ↦ cmpt 5179 ∘ ccom 5628 ⟶wf 6488 ‘cfv 6492 ℂcc 11024 ℝcr 11025 ≤ cle 11167 𝑂(1)co1 15409 |
| 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 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-pre-lttri 11100 ax-pre-lttrn 11101 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-po 5532 df-so 5533 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-er 8635 df-pm 8766 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-ico 13267 df-o1 15413 |
| This theorem is referenced by: dchrisum0 27487 |
| Copyright terms: Public domain | W3C validator |