![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > xlimpnfmpt | Structured version Visualization version GIF version |
Description: A function converges to plus infinity if it eventually becomes (and stays) larger than any given real number. (Contributed by Glauco Siliprandi, 5-Feb-2022.) |
Ref | Expression |
---|---|
xlimpnfmpt.k | ⊢ Ⅎ𝑘𝜑 |
xlimpnfmpt.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
xlimpnfmpt.z | ⊢ 𝑍 = (ℤ≥‘𝑀) |
xlimpnfmpt.b | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℝ*) |
xlimpnfmpt.f | ⊢ 𝐹 = (𝑘 ∈ 𝑍 ↦ 𝐵) |
Ref | Expression |
---|---|
xlimpnfmpt | ⊢ (𝜑 → (𝐹~~>*+∞ ↔ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝑥 ≤ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xlimpnfmpt.f | . . . 4 ⊢ 𝐹 = (𝑘 ∈ 𝑍 ↦ 𝐵) | |
2 | nfmpt1 5128 | . . . 4 ⊢ Ⅎ𝑘(𝑘 ∈ 𝑍 ↦ 𝐵) | |
3 | 1, 2 | nfcxfr 2953 | . . 3 ⊢ Ⅎ𝑘𝐹 |
4 | xlimpnfmpt.m | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
5 | xlimpnfmpt.z | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
6 | xlimpnfmpt.k | . . . 4 ⊢ Ⅎ𝑘𝜑 | |
7 | xlimpnfmpt.b | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℝ*) | |
8 | 6, 7, 1 | fmptdf 6858 | . . 3 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ*) |
9 | 3, 4, 5, 8 | xlimpnf 42484 | . 2 ⊢ (𝜑 → (𝐹~~>*+∞ ↔ ∀𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑖)𝑦 ≤ (𝐹‘𝑘))) |
10 | nfv 1915 | . . . . . 6 ⊢ Ⅎ𝑘 𝑖 ∈ 𝑍 | |
11 | 6, 10 | nfan 1900 | . . . . 5 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑖 ∈ 𝑍) |
12 | 5 | uztrn2 12250 | . . . . . . . 8 ⊢ ((𝑖 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ≥‘𝑖)) → 𝑘 ∈ 𝑍) |
13 | 12 | adantll 713 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑖 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ≥‘𝑖)) → 𝑘 ∈ 𝑍) |
14 | simpll 766 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑖 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ≥‘𝑖)) → 𝜑) | |
15 | 14, 13, 7 | syl2anc 587 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑖 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ≥‘𝑖)) → 𝐵 ∈ ℝ*) |
16 | 1 | fvmpt2 6756 | . . . . . . 7 ⊢ ((𝑘 ∈ 𝑍 ∧ 𝐵 ∈ ℝ*) → (𝐹‘𝑘) = 𝐵) |
17 | 13, 15, 16 | syl2anc 587 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑖 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ≥‘𝑖)) → (𝐹‘𝑘) = 𝐵) |
18 | 17 | breq2d 5042 | . . . . 5 ⊢ (((𝜑 ∧ 𝑖 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ≥‘𝑖)) → (𝑦 ≤ (𝐹‘𝑘) ↔ 𝑦 ≤ 𝐵)) |
19 | 11, 18 | ralbida 3194 | . . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍) → (∀𝑘 ∈ (ℤ≥‘𝑖)𝑦 ≤ (𝐹‘𝑘) ↔ ∀𝑘 ∈ (ℤ≥‘𝑖)𝑦 ≤ 𝐵)) |
20 | 19 | rexbidva 3255 | . . 3 ⊢ (𝜑 → (∃𝑖 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑖)𝑦 ≤ (𝐹‘𝑘) ↔ ∃𝑖 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑖)𝑦 ≤ 𝐵)) |
21 | 20 | ralbidv 3162 | . 2 ⊢ (𝜑 → (∀𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑖)𝑦 ≤ (𝐹‘𝑘) ↔ ∀𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑖)𝑦 ≤ 𝐵)) |
22 | breq1 5033 | . . . . . 6 ⊢ (𝑦 = 𝑥 → (𝑦 ≤ 𝐵 ↔ 𝑥 ≤ 𝐵)) | |
23 | 22 | rexralbidv 3260 | . . . . 5 ⊢ (𝑦 = 𝑥 → (∃𝑖 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑖)𝑦 ≤ 𝐵 ↔ ∃𝑖 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑖)𝑥 ≤ 𝐵)) |
24 | fveq2 6645 | . . . . . . 7 ⊢ (𝑖 = 𝑗 → (ℤ≥‘𝑖) = (ℤ≥‘𝑗)) | |
25 | 24 | raleqdv 3364 | . . . . . 6 ⊢ (𝑖 = 𝑗 → (∀𝑘 ∈ (ℤ≥‘𝑖)𝑥 ≤ 𝐵 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)𝑥 ≤ 𝐵)) |
26 | 25 | cbvrexvw 3397 | . . . . 5 ⊢ (∃𝑖 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑖)𝑥 ≤ 𝐵 ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝑥 ≤ 𝐵) |
27 | 23, 26 | syl6bb 290 | . . . 4 ⊢ (𝑦 = 𝑥 → (∃𝑖 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑖)𝑦 ≤ 𝐵 ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝑥 ≤ 𝐵)) |
28 | 27 | cbvralvw 3396 | . . 3 ⊢ (∀𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑖)𝑦 ≤ 𝐵 ↔ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝑥 ≤ 𝐵) |
29 | 28 | a1i 11 | . 2 ⊢ (𝜑 → (∀𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑖)𝑦 ≤ 𝐵 ↔ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝑥 ≤ 𝐵)) |
30 | 9, 21, 29 | 3bitrd 308 | 1 ⊢ (𝜑 → (𝐹~~>*+∞ ↔ ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝑥 ≤ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 Ⅎwnf 1785 ∈ wcel 2111 ∀wral 3106 ∃wrex 3107 class class class wbr 5030 ↦ cmpt 5110 ‘cfv 6324 ℝcr 10525 +∞cpnf 10661 ℝ*cxr 10663 ≤ cle 10665 ℤcz 11969 ℤ≥cuz 12231 ~~>*clsxlim 42460 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-pm 8392 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-fi 8859 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-z 11970 df-uz 12232 df-ioo 12730 df-ioc 12731 df-ico 12732 df-icc 12733 df-topgen 16709 df-ordt 16766 df-ps 17802 df-tsr 17803 df-top 21499 df-topon 21516 df-bases 21551 df-lm 21834 df-xlim 42461 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |