| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cau3 | Structured version Visualization version GIF version | ||
| Description: Convert between three-quantifier and four-quantifier versions of the Cauchy criterion. (In particular, the four-quantifier version has no occurrence of 𝑗 in the assertion, so it can be used with rexanuz 15353 and friends.) (Contributed by Mario Carneiro, 15-Feb-2014.) |
| Ref | Expression |
|---|---|
| cau3.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| Ref | Expression |
|---|---|
| cau3 | ⊢ (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ ∀𝑚 ∈ (ℤ≥‘𝑘)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cau3.1 | . . . 4 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 2 | uzssz 12866 | . . . 4 ⊢ (ℤ≥‘𝑀) ⊆ ℤ | |
| 3 | 1, 2 | eqsstri 4003 | . . 3 ⊢ 𝑍 ⊆ ℤ |
| 4 | id 22 | . . 3 ⊢ ((𝐹‘𝑘) ∈ ℂ → (𝐹‘𝑘) ∈ ℂ) | |
| 5 | eleq1 2821 | . . 3 ⊢ ((𝐹‘𝑘) = (𝐹‘𝑗) → ((𝐹‘𝑘) ∈ ℂ ↔ (𝐹‘𝑗) ∈ ℂ)) | |
| 6 | eleq1 2821 | . . 3 ⊢ ((𝐹‘𝑘) = (𝐹‘𝑚) → ((𝐹‘𝑘) ∈ ℂ ↔ (𝐹‘𝑚) ∈ ℂ)) | |
| 7 | abssub 15334 | . . . 4 ⊢ (((𝐹‘𝑗) ∈ ℂ ∧ (𝐹‘𝑘) ∈ ℂ) → (abs‘((𝐹‘𝑗) − (𝐹‘𝑘))) = (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) | |
| 8 | 7 | 3adant1 1130 | . . 3 ⊢ ((⊤ ∧ (𝐹‘𝑗) ∈ ℂ ∧ (𝐹‘𝑘) ∈ ℂ) → (abs‘((𝐹‘𝑗) − (𝐹‘𝑘))) = (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) |
| 9 | abssub 15334 | . . . 4 ⊢ (((𝐹‘𝑚) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) = (abs‘((𝐹‘𝑗) − (𝐹‘𝑚)))) | |
| 10 | 9 | 3adant1 1130 | . . 3 ⊢ ((⊤ ∧ (𝐹‘𝑚) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘((𝐹‘𝑚) − (𝐹‘𝑗))) = (abs‘((𝐹‘𝑗) − (𝐹‘𝑚)))) |
| 11 | abs3lem 15346 | . . . 4 ⊢ ((((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑚) ∈ ℂ) ∧ ((𝐹‘𝑗) ∈ ℂ ∧ 𝑥 ∈ ℝ)) → (((abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < (𝑥 / 2) ∧ (abs‘((𝐹‘𝑗) − (𝐹‘𝑚))) < (𝑥 / 2)) → (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥)) | |
| 12 | 11 | 3adant1 1130 | . . 3 ⊢ ((⊤ ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑚) ∈ ℂ) ∧ ((𝐹‘𝑗) ∈ ℂ ∧ 𝑥 ∈ ℝ)) → (((abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < (𝑥 / 2) ∧ (abs‘((𝐹‘𝑗) − (𝐹‘𝑚))) < (𝑥 / 2)) → (abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥)) |
| 13 | 3, 4, 5, 6, 8, 10, 12 | cau3lem 15362 | . 2 ⊢ (⊤ → (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ ∀𝑚 ∈ (ℤ≥‘𝑘)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥))) |
| 14 | 13 | mptru 1546 | 1 ⊢ (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ ∀𝑚 ∈ (ℤ≥‘𝑘)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1539 ⊤wtru 1540 ∈ wcel 2107 ∀wral 3050 ∃wrex 3059 class class class wbr 5117 ‘cfv 6528 (class class class)co 7400 ℂcc 11120 ℝcr 11121 < clt 11262 − cmin 11459 / cdiv 11887 2c2 12288 ℤcz 12581 ℤ≥cuz 12845 ℝ+crp 13001 abscabs 15242 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-sep 5264 ax-nul 5274 ax-pow 5333 ax-pr 5400 ax-un 7724 ax-cnex 11178 ax-resscn 11179 ax-1cn 11180 ax-icn 11181 ax-addcl 11182 ax-addrcl 11183 ax-mulcl 11184 ax-mulrcl 11185 ax-mulcom 11186 ax-addass 11187 ax-mulass 11188 ax-distr 11189 ax-i2m1 11190 ax-1ne0 11191 ax-1rid 11192 ax-rnegex 11193 ax-rrecex 11194 ax-cnre 11195 ax-pre-lttri 11196 ax-pre-lttrn 11197 ax-pre-ltadd 11198 ax-pre-mulgt0 11199 ax-pre-sup 11200 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3357 df-reu 3358 df-rab 3414 df-v 3459 df-sbc 3764 df-csb 3873 df-dif 3927 df-un 3929 df-in 3931 df-ss 3941 df-pss 3944 df-nul 4307 df-if 4499 df-pw 4575 df-sn 4600 df-pr 4602 df-op 4606 df-uni 4882 df-iun 4967 df-br 5118 df-opab 5180 df-mpt 5200 df-tr 5228 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6288 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7857 df-2nd 7984 df-frecs 8275 df-wrecs 8306 df-recs 8380 df-rdg 8419 df-er 8714 df-en 8955 df-dom 8956 df-sdom 8957 df-sup 9449 df-pnf 11264 df-mnf 11265 df-xr 11266 df-ltxr 11267 df-le 11268 df-sub 11461 df-neg 11462 df-div 11888 df-nn 12234 df-2 12296 df-3 12297 df-n0 12495 df-z 12582 df-uz 12846 df-rp 13002 df-seq 14010 df-exp 14070 df-cj 15107 df-re 15108 df-im 15109 df-sqrt 15243 df-abs 15244 |
| This theorem is referenced by: cau4 15364 serf0 15686 |
| Copyright terms: Public domain | W3C validator |