![]() |
Mathbox for Paul Chapman |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > climuzcnv | Structured version Visualization version GIF version |
Description: Utility lemma to convert between 𝑚 ≤ 𝑘 and 𝑘 ∈ (ℤ≥‘𝑚) in limit theorems. (Contributed by Paul Chapman, 10-Nov-2012.) |
Ref | Expression |
---|---|
climuzcnv | ⊢ (𝑚 ∈ ℕ → ((𝑘 ∈ (ℤ≥‘𝑚) → 𝜑) ↔ (𝑘 ∈ ℕ → (𝑚 ≤ 𝑘 → 𝜑)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elnnuz 12761 | . . . . . . . 8 ⊢ (𝑚 ∈ ℕ ↔ 𝑚 ∈ (ℤ≥‘1)) | |
2 | uztrn 12739 | . . . . . . . 8 ⊢ ((𝑘 ∈ (ℤ≥‘𝑚) ∧ 𝑚 ∈ (ℤ≥‘1)) → 𝑘 ∈ (ℤ≥‘1)) | |
3 | 1, 2 | sylan2b 594 | . . . . . . 7 ⊢ ((𝑘 ∈ (ℤ≥‘𝑚) ∧ 𝑚 ∈ ℕ) → 𝑘 ∈ (ℤ≥‘1)) |
4 | elnnuz 12761 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ ↔ 𝑘 ∈ (ℤ≥‘1)) | |
5 | 3, 4 | sylibr 233 | . . . . . 6 ⊢ ((𝑘 ∈ (ℤ≥‘𝑚) ∧ 𝑚 ∈ ℕ) → 𝑘 ∈ ℕ) |
6 | 5 | expcom 414 | . . . . 5 ⊢ (𝑚 ∈ ℕ → (𝑘 ∈ (ℤ≥‘𝑚) → 𝑘 ∈ ℕ)) |
7 | eluzle 12734 | . . . . . 6 ⊢ (𝑘 ∈ (ℤ≥‘𝑚) → 𝑚 ≤ 𝑘) | |
8 | 7 | a1i 11 | . . . . 5 ⊢ (𝑚 ∈ ℕ → (𝑘 ∈ (ℤ≥‘𝑚) → 𝑚 ≤ 𝑘)) |
9 | 6, 8 | jcad 513 | . . . 4 ⊢ (𝑚 ∈ ℕ → (𝑘 ∈ (ℤ≥‘𝑚) → (𝑘 ∈ ℕ ∧ 𝑚 ≤ 𝑘))) |
10 | nnz 12478 | . . . . . 6 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℤ) | |
11 | nnz 12478 | . . . . . . 7 ⊢ (𝑚 ∈ ℕ → 𝑚 ∈ ℤ) | |
12 | eluz2 12727 | . . . . . . . 8 ⊢ (𝑘 ∈ (ℤ≥‘𝑚) ↔ (𝑚 ∈ ℤ ∧ 𝑘 ∈ ℤ ∧ 𝑚 ≤ 𝑘)) | |
13 | 12 | biimpri 227 | . . . . . . 7 ⊢ ((𝑚 ∈ ℤ ∧ 𝑘 ∈ ℤ ∧ 𝑚 ≤ 𝑘) → 𝑘 ∈ (ℤ≥‘𝑚)) |
14 | 11, 13 | syl3an1 1163 | . . . . . 6 ⊢ ((𝑚 ∈ ℕ ∧ 𝑘 ∈ ℤ ∧ 𝑚 ≤ 𝑘) → 𝑘 ∈ (ℤ≥‘𝑚)) |
15 | 10, 14 | syl3an2 1164 | . . . . 5 ⊢ ((𝑚 ∈ ℕ ∧ 𝑘 ∈ ℕ ∧ 𝑚 ≤ 𝑘) → 𝑘 ∈ (ℤ≥‘𝑚)) |
16 | 15 | 3expib 1122 | . . . 4 ⊢ (𝑚 ∈ ℕ → ((𝑘 ∈ ℕ ∧ 𝑚 ≤ 𝑘) → 𝑘 ∈ (ℤ≥‘𝑚))) |
17 | 9, 16 | impbid 211 | . . 3 ⊢ (𝑚 ∈ ℕ → (𝑘 ∈ (ℤ≥‘𝑚) ↔ (𝑘 ∈ ℕ ∧ 𝑚 ≤ 𝑘))) |
18 | 17 | imbi1d 341 | . 2 ⊢ (𝑚 ∈ ℕ → ((𝑘 ∈ (ℤ≥‘𝑚) → 𝜑) ↔ ((𝑘 ∈ ℕ ∧ 𝑚 ≤ 𝑘) → 𝜑))) |
19 | impexp 451 | . 2 ⊢ (((𝑘 ∈ ℕ ∧ 𝑚 ≤ 𝑘) → 𝜑) ↔ (𝑘 ∈ ℕ → (𝑚 ≤ 𝑘 → 𝜑))) | |
20 | 18, 19 | bitrdi 286 | 1 ⊢ (𝑚 ∈ ℕ → ((𝑘 ∈ (ℤ≥‘𝑚) → 𝜑) ↔ (𝑘 ∈ ℕ → (𝑚 ≤ 𝑘 → 𝜑)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 ∈ wcel 2106 class class class wbr 5103 ‘cfv 6493 1c1 11010 ≤ cle 11148 ℕcn 12111 ℤcz 12457 ℤ≥cuz 12721 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2708 ax-sep 5254 ax-nul 5261 ax-pow 5318 ax-pr 5382 ax-un 7664 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3352 df-rab 3406 df-v 3445 df-sbc 3738 df-csb 3854 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3927 df-nul 4281 df-if 4485 df-pw 4560 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4864 df-iun 4954 df-br 5104 df-opab 5166 df-mpt 5187 df-tr 5221 df-id 5529 df-eprel 5535 df-po 5543 df-so 5544 df-fr 5586 df-we 5588 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6251 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6445 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7307 df-ov 7354 df-oprab 7355 df-mpo 7356 df-om 7795 df-2nd 7914 df-frecs 8204 df-wrecs 8235 df-recs 8309 df-rdg 8348 df-er 8606 df-en 8842 df-dom 8843 df-sdom 8844 df-pnf 11149 df-mnf 11150 df-xr 11151 df-ltxr 11152 df-le 11153 df-sub 11345 df-neg 11346 df-nn 12112 df-z 12458 df-uz 12722 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |