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 24796

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 11190	. . . . 5 ⊢ ℂ ∈ V
5	3, 4	jctir 521	. . . 4 ⊢ (𝜑 → (𝑋 ∈ dom ∞Met ∧ ℂ ∈ V))
6		iscauf.7	. . . . 5 ⊢ (𝜑 → 𝐹:𝑍⟶𝑋)
7		iscau3.2	. . . . . 6 ⊢ 𝑍 = (ℤ_≥‘𝑀)
8		uzssz 12842	. . . . . . 7 ⊢ (ℤ_≥‘𝑀) ⊆ ℤ
9		zsscn 12565	. . . . . . 7 ⊢ ℤ ⊆ ℂ
10	8, 9	sstri 3991	. . . . . 6 ⊢ (ℤ_≥‘𝑀) ⊆ ℂ
11	7, 10	eqsstri 4016	. . . . 5 ⊢ 𝑍 ⊆ ℂ
12	6, 11	jctir 521	. . . 4 ⊢ (𝜑 → (𝐹:𝑍⟶𝑋 ∧ 𝑍 ⊆ ℂ))
13		elpm2r 8838	. . . 4 ⊢ (((𝑋 ∈ dom ∞Met ∧ ℂ ∈ V) ∧ (𝐹:𝑍⟶𝑋 ∧ 𝑍 ⊆ ℂ)) → 𝐹 ∈ (𝑋 ↑_pm ℂ))
14	5, 12, 13	syl2anc 584	. . 3 ⊢ (𝜑 → 𝐹 ∈ (𝑋 ↑_pm ℂ))
15	14	biantrurd 533	. 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥) ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥))))
16	1	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝐷 ∈ (∞Met‘𝑋))
17		iscau4.6	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) = 𝐵)
18	17	adantrr 715	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑗) = 𝐵)
19	6	adantr 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝐹:𝑍⟶𝑋)
20		simprl 769	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝑗 ∈ 𝑍)
21	19, 20	ffvelcdmd 7087	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑗) ∈ 𝑋)
22	18, 21	eqeltrrd 2834	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝐵 ∈ 𝑋)
23	7	uztrn2 12840	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
24		iscau4.5	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴)
25	23, 24	sylan2 593	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑘) = 𝐴)
26		ffvelcdm 7083	. . . . . . . . . . 11 ⊢ ((𝐹:𝑍⟶𝑋 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ 𝑋)
27	6, 23, 26	syl2an 596	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑘) ∈ 𝑋)
28	25, 27	eqeltrrd 2834	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝐴 ∈ 𝑋)
29		xmetsym 23852	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐵𝐷𝐴) = (𝐴𝐷𝐵))
30	16, 22, 28, 29	syl3anc 1371	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝐵𝐷𝐴) = (𝐴𝐷𝐵))
31	30	breq1d 5158	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((𝐵𝐷𝐴) < 𝑥 ↔ (𝐴𝐷𝐵) < 𝑥))
32		fdm 6726	. . . . . . . . . . . . 13 ⊢ (𝐹:𝑍⟶𝑋 → dom 𝐹 = 𝑍)
33	32	eleq2d 2819	. . . . . . . . . . . 12 ⊢ (𝐹:𝑍⟶𝑋 → (𝑘 ∈ dom 𝐹 ↔ 𝑘 ∈ 𝑍))
34	33	biimpar 478	. . . . . . . . . . 11 ⊢ ((𝐹:𝑍⟶𝑋 ∧ 𝑘 ∈ 𝑍) → 𝑘 ∈ dom 𝐹)
35	6, 23, 34	syl2an 596	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → 𝑘 ∈ dom 𝐹)
36	35, 28	jca 512	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → (𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋))
37	36	biantrurd 533	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((𝐴𝐷𝐵) < 𝑥 ↔ ((𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋) ∧ (𝐴𝐷𝐵) < 𝑥)))
38		df-3an 1089	. . . . . . . 8 ⊢ ((𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥) ↔ ((𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋) ∧ (𝐴𝐷𝐵) < 𝑥))
39	37, 38	bitr4di 288	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((𝐴𝐷𝐵) < 𝑥 ↔ (𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥)))
40	31, 39	bitrd 278	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((𝐵𝐷𝐴) < 𝑥 ↔ (𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥)))
41	40	anassrs 468	. . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((𝐵𝐷𝐴) < 𝑥 ↔ (𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥)))
42	41	ralbidva 3175	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐵𝐷𝐴) < 𝑥 ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥)))
43	42	rexbidva 3176	. . 3 ⊢ (𝜑 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐵𝐷𝐴) < 𝑥 ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥)))
44	43	ralbidv 3177	. 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐵𝐷𝐴) < 𝑥 ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥)))
45		iscau3.4	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ)
46	7, 1, 45, 24, 17	iscau4 24795	. 2 ⊢ (𝜑 → (𝐹 ∈ (Cau‘𝐷) ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴𝐷𝐵) < 𝑥))))
47	15, 44, 46	3bitr4rd 311	1 ⊢ (𝜑 → (𝐹 ∈ (Cau‘𝐷) ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐵𝐷𝐴) < 𝑥))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ∀wral 3061 ∃wrex 3070 Vcvv 3474 ⊆ wss 3948 class class class wbr 5148 dom cdm 5676 ⟶wf 6539 ‘cfv 6543 (class class class)co 7408 ↑_pm cpm 8820 ℂcc 11107 < clt 11247 ℤcz 12557 ℤ_≥cuz 12821 ℝ⁺crp 12973 ∞Metcxmet 20928 Cauccau 24769

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 2703 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186

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 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-po 5588 df-so 5589 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7364 df-ov 7411 df-oprab 7412 df-mpo 7413 df-1st 7974 df-2nd 7975 df-er 8702 df-map 8821 df-pm 8822 df-en 8939 df-dom 8940 df-sdom 8941 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11445 df-neg 11446 df-div 11871 df-2 12274 df-z 12558 df-uz 12822 df-rp 12974 df-xneg 13091 df-xadd 13092 df-psmet 20935 df-xmet 20936 df-bl 20938 df-cau 24772

This theorem is referenced by: iscmet3lem1 24807 causs 24814 caubl 24824 minvecolem3 30124 h2hcau 30227 geomcau 36622 caushft 36624 rrncmslem 36695

W3C validator