iscauf - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > iscauf		Structured version Visualization version GIF version

Theorem iscauf 25201

Description: Express the property "𝐹 is a Cauchy sequence of metric 𝐷 " presupposing 𝐹 is a function. (Contributed by NM, 24-Jul-2007.) (Revised by Mario Carneiro, 23-Dec-2013.)

**Hypotheses**
Ref	Expression
iscau3.2	⊢ 𝑍 = (ℤ_≥‘𝑀)
iscau3.3	⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋))
iscau3.4	⊢ (𝜑 → 𝑀 ∈ ℤ)
iscau4.5	⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴)
iscau4.6	⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) = 𝐵)
iscauf.7	⊢ (𝜑 → 𝐹:𝑍⟶𝑋)

**Assertion**
Ref	Expression
iscauf	⊢ (𝜑 → (𝐹 ∈ (Cau‘𝐷) ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐵𝐷𝐴) < 𝑥))

Distinct variable groups: 𝑗,𝑘,𝑥,𝐷 𝑗,𝐹,𝑘,𝑥 𝜑,𝑗,𝑘,𝑥 𝑗,𝑋,𝑘,𝑥 𝑗,𝑀 𝑗,𝑍,𝑘,𝑥 Allowed substitution hints: 𝐴(𝑥,𝑗,𝑘) 𝐵(𝑥,𝑗,𝑘) 𝑀(𝑥,𝑘)

**Proof of Theorem iscauf**
Step	Hyp	Ref	Expression
1		iscau3.3	. . . . . 6 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋))
2		elfvdm 6928	. . . . . 6 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 ∈ dom ∞Met)
3	1, 2	syl 17	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ dom ∞Met)
4		cnex 11213	. . . . 5 ⊢ ℂ ∈ V
5	3, 4	jctir 520	. . . 4 ⊢ (𝜑 → (𝑋 ∈ dom ∞Met ∧ ℂ ∈ V))
6		iscauf.7	. . . . 5 ⊢ (𝜑 → 𝐹:𝑍⟶𝑋)
7		iscau3.2	. . . . . 6 ⊢ 𝑍 = (ℤ_≥‘𝑀)
8		uzssz 12867	. . . . . . 7 ⊢ (ℤ_≥‘𝑀) ⊆ ℤ
9		zsscn 12590	. . . . . . 7 ⊢ ℤ ⊆ ℂ
10	8, 9	sstri 3987	. . . . . 6 ⊢ (ℤ_≥‘𝑀) ⊆ ℂ
11	7, 10	eqsstri 4012	. . . . 5 ⊢ 𝑍 ⊆ ℂ
12	6, 11	jctir 520	. . . 4 ⊢ (𝜑 → (𝐹:𝑍⟶𝑋 ∧ 𝑍 ⊆ ℂ))
13		elpm2r 8857	. . . 4 ⊢ (((𝑋 ∈ dom ∞Met ∧ ℂ ∈ V) ∧ (𝐹:𝑍⟶𝑋 ∧ 𝑍 ⊆ ℂ)) → 𝐹 ∈ (𝑋 ↑_pm ℂ))
14	5, 12, 13	syl2anc 583	. . 3 ⊢ (𝜑 → 𝐹 ∈ (𝑋 ↑_pm ℂ))
15	14	biantrurd 532	. 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥) ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥))))
16	1	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝐷 ∈ (∞Met‘𝑋))
17		iscau4.6	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) = 𝐵)
18	17	adantrr 716	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑗) = 𝐵)
19	6	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝐹:𝑍⟶𝑋)
20		simprl 770	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝑗 ∈ 𝑍)
21	19, 20	ffvelcdmd 7089	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑗) ∈ 𝑋)
22	18, 21	eqeltrrd 2829	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝐵 ∈ 𝑋)
23	7	uztrn2 12865	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
24		iscau4.5	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴)
25	23, 24	sylan2 592	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑘) = 𝐴)
26		ffvelcdm 7085	. . . . . . . . . . 11 ⊢ ((𝐹:𝑍⟶𝑋 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ 𝑋)
27	6, 23, 26	syl2an 595	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑘) ∈ 𝑋)
28	25, 27	eqeltrrd 2829	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝐴 ∈ 𝑋)
29		xmetsym 24246	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐵𝐷𝐴) = (𝐴𝐷𝐵))
30	16, 22, 28, 29	syl3anc 1369	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐵𝐷𝐴) = (𝐴𝐷𝐵))
31	30	breq1d 5152	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((𝐵𝐷𝐴) < 𝑥 ↔ (𝐴𝐷𝐵) < 𝑥))
32		fdm 6725	. . . . . . . . . . . . 13 ⊢ (𝐹:𝑍⟶𝑋 → dom 𝐹 = 𝑍)
33	32	eleq2d 2814	. . . . . . . . . . . 12 ⊢ (𝐹:𝑍⟶𝑋 → (𝑘 ∈ dom 𝐹 ↔ 𝑘 ∈ 𝑍))
34	33	biimpar 477	. . . . . . . . . . 11 ⊢ ((𝐹:𝑍⟶𝑋 ∧ 𝑘 ∈ 𝑍) → 𝑘 ∈ dom 𝐹)
35	6, 23, 34	syl2an 595	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝑘 ∈ dom 𝐹)
36	35, 28	jca 511	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋))
37	36	biantrurd 532	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((𝐴𝐷𝐵) < 𝑥 ↔ ((𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋) ∧ (𝐴𝐷𝐵) < 𝑥)))
38		df-3an 1087	. . . . . . . 8 ⊢ ((𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥) ↔ ((𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋) ∧ (𝐴𝐷𝐵) < 𝑥))
39	37, 38	bitr4di 289	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((𝐴𝐷𝐵) < 𝑥 ↔ (𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥)))
40	31, 39	bitrd 279	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((𝐵𝐷𝐴) < 𝑥 ↔ (𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥)))
41	40	anassrs 467	. . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((𝐵𝐷𝐴) < 𝑥 ↔ (𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥)))
42	41	ralbidva 3170	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐵𝐷𝐴) < 𝑥 ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥)))
43	42	rexbidva 3171	. . 3 ⊢ (𝜑 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐵𝐷𝐴) < 𝑥 ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥)))
44	43	ralbidv 3172	. 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐵𝐷𝐴) < 𝑥 ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥)))
45		iscau3.4	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ)
46	7, 1, 45, 24, 17	iscau4 25200	. 2 ⊢ (𝜑 → (𝐹 ∈ (Cau‘𝐷) ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥))))
47	15, 44, 46	3bitr4rd 312	1 ⊢ (𝜑 → (𝐹 ∈ (Cau‘𝐷) ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐵𝐷𝐴) < 𝑥))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1085 = wceq 1534 ∈ wcel 2099 ∀wral 3056 ∃wrex 3065 Vcvv 3469 ⊆ wss 3944 class class class wbr 5142 dom cdm 5672 ⟶wf 6538 ‘cfv 6542 (class class class)co 7414 ↑_pm cpm 8839 ℂcc 11130 < clt 11272 ℤcz 12582 ℤ_≥cuz 12846 ℝ⁺crp 13000 ∞Metcxmet 21257 Cauccau 25174

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7734 ax-cnex 11188 ax-resscn 11189 ax-1cn 11190 ax-icn 11191 ax-addcl 11192 ax-addrcl 11193 ax-mulcl 11194 ax-mulrcl 11195 ax-mulcom 11196 ax-addass 11197 ax-mulass 11198 ax-distr 11199 ax-i2m1 11200 ax-1ne0 11201 ax-1rid 11202 ax-rnegex 11203 ax-rrecex 11204 ax-cnre 11205 ax-pre-lttri 11206 ax-pre-lttrn 11207 ax-pre-ltadd 11208 ax-pre-mulgt0 11209

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-id 5570 df-po 5584 df-so 5585 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-1st 7987 df-2nd 7988 df-er 8718 df-map 8840 df-pm 8841 df-en 8958 df-dom 8959 df-sdom 8960 df-pnf 11274 df-mnf 11275 df-xr 11276 df-ltxr 11277 df-le 11278 df-sub 11470 df-neg 11471 df-div 11896 df-2 12299 df-z 12583 df-uz 12847 df-rp 13001 df-xneg 13118 df-xadd 13119 df-psmet 21264 df-xmet 21265 df-bl 21267 df-cau 25177

This theorem is referenced by: iscmet3lem1 25212 causs 25219 caubl 25229 minvecolem3 30679 h2hcau 30782 geomcau 37221 caushft 37223 rrncmslem 37294

W3C validator