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 25130

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 6918	. . . . . 6 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 ∈ dom ∞Met)
3	1, 2	syl 17	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ dom ∞Met)
4		cnex 11187	. . . . 5 ⊢ ℂ ∈ V
5	3, 4	jctir 520	. . . 4 ⊢ (𝜑 → (𝑋 ∈ dom ∞Met ∧ ℂ ∈ V))
6		iscauf.7	. . . . 5 ⊢ (𝜑 → 𝐹:𝑍⟶𝑋)
7		iscau3.2	. . . . . 6 ⊢ 𝑍 = (ℤ_≥‘𝑀)
8		uzssz 12840	. . . . . . 7 ⊢ (ℤ_≥‘𝑀) ⊆ ℤ
9		zsscn 12563	. . . . . . 7 ⊢ ℤ ⊆ ℂ
10	8, 9	sstri 3983	. . . . . 6 ⊢ (ℤ_≥‘𝑀) ⊆ ℂ
11	7, 10	eqsstri 4008	. . . . 5 ⊢ 𝑍 ⊆ ℂ
12	6, 11	jctir 520	. . . 4 ⊢ (𝜑 → (𝐹:𝑍⟶𝑋 ∧ 𝑍 ⊆ ℂ))
13		elpm2r 8835	. . . 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 714	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑗) = 𝐵)
19	6	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝐹:𝑍⟶𝑋)
20		simprl 768	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝑗 ∈ 𝑍)
21	19, 20	ffvelcdmd 7077	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑗) ∈ 𝑋)
22	18, 21	eqeltrrd 2826	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝐵 ∈ 𝑋)
23	7	uztrn2 12838	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
24		iscau4.5	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴)
25	23, 24	sylan2 592	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑘) = 𝐴)
26		ffvelcdm 7073	. . . . . . . . . . 11 ⊢ ((𝐹:𝑍⟶𝑋 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ 𝑋)
27	6, 23, 26	syl2an 595	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑘) ∈ 𝑋)
28	25, 27	eqeltrrd 2826	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝐴 ∈ 𝑋)
29		xmetsym 24175	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐵𝐷𝐴) = (𝐴𝐷𝐵))
30	16, 22, 28, 29	syl3anc 1368	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐵𝐷𝐴) = (𝐴𝐷𝐵))
31	30	breq1d 5148	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((𝐵𝐷𝐴) < 𝑥 ↔ (𝐴𝐷𝐵) < 𝑥))
32		fdm 6716	. . . . . . . . . . . . 13 ⊢ (𝐹:𝑍⟶𝑋 → dom 𝐹 = 𝑍)
33	32	eleq2d 2811	. . . . . . . . . . . 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 1086	. . . . . . . 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 3167	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐵𝐷𝐴) < 𝑥 ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥)))
43	42	rexbidva 3168	. . 3 ⊢ (𝜑 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐵𝐷𝐴) < 𝑥 ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥)))
44	43	ralbidv 3169	. 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐵𝐷𝐴) < 𝑥 ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥)))
45		iscau3.4	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ)
46	7, 1, 45, 24, 17	iscau4 25129	. 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 1084 = wceq 1533 ∈ wcel 2098 ∀wral 3053 ∃wrex 3062 Vcvv 3466 ⊆ wss 3940 class class class wbr 5138 dom cdm 5666 ⟶wf 6529 ‘cfv 6533 (class class class)co 7401 ↑_pm cpm 8817 ℂcc 11104 < clt 11245 ℤcz 12555 ℤ_≥cuz 12819 ℝ⁺crp 12971 ∞Metcxmet 21213 Cauccau 25103

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-sep 5289 ax-nul 5296 ax-pow 5353 ax-pr 5417 ax-un 7718 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-rmo 3368 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-nul 4315 df-if 4521 df-pw 4596 df-sn 4621 df-pr 4623 df-op 4627 df-uni 4900 df-iun 4989 df-br 5139 df-opab 5201 df-mpt 5222 df-id 5564 df-po 5578 df-so 5579 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6485 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7357 df-ov 7404 df-oprab 7405 df-mpo 7406 df-1st 7968 df-2nd 7969 df-er 8699 df-map 8818 df-pm 8819 df-en 8936 df-dom 8937 df-sdom 8938 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-div 11869 df-2 12272 df-z 12556 df-uz 12820 df-rp 12972 df-xneg 13089 df-xadd 13090 df-psmet 21220 df-xmet 21221 df-bl 21223 df-cau 25106

This theorem is referenced by: iscmet3lem1 25141 causs 25148 caubl 25158 minvecolem3 30598 h2hcau 30701 geomcau 37117 caushft 37119 rrncmslem 37190

W3C validator