cmetcaulem - Metamath Proof Explorer

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

Theorem cmetcaulem 24796

Description: Lemma for cmetcau 24797. (Contributed by Mario Carneiro, 14-Oct-2015.)

**Hypotheses**
Ref	Expression
cmetcau.1	⊢ 𝐽 = (MetOpen‘𝐷)
cmetcau.3	⊢ (𝜑 → 𝐷 ∈ (CMet‘𝑋))
cmetcau.4	⊢ (𝜑 → 𝑃 ∈ 𝑋)
cmetcau.5	⊢ (𝜑 → 𝐹 ∈ (Cau‘𝐷))
cmetcau.6	⊢ 𝐺 = (𝑥 ∈ ℕ ↦ if(𝑥 ∈ dom 𝐹, (𝐹‘𝑥), 𝑃))

**Assertion**
Ref	Expression
cmetcaulem	⊢ (𝜑 → 𝐹 ∈ dom (⇝_𝑡‘𝐽))

Distinct variable groups: 𝑥,𝐷 𝑥,𝐹 𝑥,𝑃 𝑥,𝐽 𝜑,𝑥 𝑥,𝑋 Allowed substitution hint: 𝐺(𝑥)

Proof of Theorem cmetcaulem Dummy variables 𝑗 𝑘 𝑚 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cmetcau.3	. . . . . . . . 9 ⊢ (𝜑 → 𝐷 ∈ (CMet‘𝑋))
2		cmetmet 24794	. . . . . . . . 9 ⊢ (𝐷 ∈ (CMet‘𝑋) → 𝐷 ∈ (Met‘𝑋))
3	1, 2	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐷 ∈ (Met‘𝑋))
4		metxmet 23831	. . . . . . . 8 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋))
5	3, 4	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋))
6		cmetcau.1	. . . . . . . 8 ⊢ 𝐽 = (MetOpen‘𝐷)
7	6	mopntopon 23936	. . . . . . 7 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ (TopOn‘𝑋))
8	5, 7	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
9		1z 12588	. . . . . . . 8 ⊢ 1 ∈ ℤ
10		nnuz 12861	. . . . . . . . 9 ⊢ ℕ = (ℤ_≥‘1)
11	10	uzfbas 23393	. . . . . . . 8 ⊢ (1 ∈ ℤ → (ℤ_≥ “ ℕ) ∈ (fBas‘ℕ))
12	9, 11	mp1i 13	. . . . . . 7 ⊢ (𝜑 → (ℤ_≥ “ ℕ) ∈ (fBas‘ℕ))
13		fgcl 23373	. . . . . . 7 ⊢ ((ℤ_≥ “ ℕ) ∈ (fBas‘ℕ) → (ℕfilGen(ℤ_≥ “ ℕ)) ∈ (Fil‘ℕ))
14	12, 13	syl 17	. . . . . 6 ⊢ (𝜑 → (ℕfilGen(ℤ_≥ “ ℕ)) ∈ (Fil‘ℕ))
15		elfvdm 6925	. . . . . . . . . . . 12 ⊢ (𝐷 ∈ (CMet‘𝑋) → 𝑋 ∈ dom CMet)
16	1, 15	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ dom CMet)
17		cnex 11187	. . . . . . . . . . . 12 ⊢ ℂ ∈ V
18	17	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → ℂ ∈ V)
19		cmetcau.5	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹 ∈ (Cau‘𝐷))
20		caufpm 24790	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (Cau‘𝐷)) → 𝐹 ∈ (𝑋 ↑_pm ℂ))
21	5, 19, 20	syl2anc 584	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 ∈ (𝑋 ↑_pm ℂ))
22		elpm2g 8834	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ dom CMet ∧ ℂ ∈ V) → (𝐹 ∈ (𝑋 ↑_pm ℂ) ↔ (𝐹:dom 𝐹⟶𝑋 ∧ dom 𝐹 ⊆ ℂ)))
23	22	simprbda 499	. . . . . . . . . . 11 ⊢ (((𝑋 ∈ dom CMet ∧ ℂ ∈ V) ∧ 𝐹 ∈ (𝑋 ↑_pm ℂ)) → 𝐹:dom 𝐹⟶𝑋)
24	16, 18, 21, 23	syl21anc 836	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:dom 𝐹⟶𝑋)
25	24	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℕ) → 𝐹:dom 𝐹⟶𝑋)
26	25	ffvelcdmda 7083	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ 𝑋)
27		cmetcau.4	. . . . . . . . 9 ⊢ (𝜑 → 𝑃 ∈ 𝑋)
28	27	ad2antrr 724	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℕ) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑃 ∈ 𝑋)
29	26, 28	ifclda 4562	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℕ) → if(𝑥 ∈ dom 𝐹, (𝐹‘𝑥), 𝑃) ∈ 𝑋)
30		cmetcau.6	. . . . . . 7 ⊢ 𝐺 = (𝑥 ∈ ℕ ↦ if(𝑥 ∈ dom 𝐹, (𝐹‘𝑥), 𝑃))
31	29, 30	fmptd 7110	. . . . . 6 ⊢ (𝜑 → 𝐺:ℕ⟶𝑋)
32		flfval 23485	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (ℕfilGen(ℤ_≥ “ ℕ)) ∈ (Fil‘ℕ) ∧ 𝐺:ℕ⟶𝑋) → ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) = (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℕfilGen(ℤ_≥ “ ℕ)))))
33	8, 14, 31, 32	syl3anc 1371	. . . . 5 ⊢ (𝜑 → ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) = (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℕfilGen(ℤ_≥ “ ℕ)))))
34		eqid 2732	. . . . . . . 8 ⊢ (ℕfilGen(ℤ_≥ “ ℕ)) = (ℕfilGen(ℤ_≥ “ ℕ))
35	34	fmfg 23444	. . . . . . 7 ⊢ ((𝑋 ∈ dom CMet ∧ (ℤ_≥ “ ℕ) ∈ (fBas‘ℕ) ∧ 𝐺:ℕ⟶𝑋) → ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) = ((𝑋 FilMap 𝐺)‘(ℕfilGen(ℤ_≥ “ ℕ))))
36	16, 12, 31, 35	syl3anc 1371	. . . . . 6 ⊢ (𝜑 → ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) = ((𝑋 FilMap 𝐺)‘(ℕfilGen(ℤ_≥ “ ℕ))))
37	36	oveq2d 7421	. . . . 5 ⊢ (𝜑 → (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ))) = (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℕfilGen(ℤ_≥ “ ℕ)))))
38	33, 37	eqtr4d 2775	. . . 4 ⊢ (𝜑 → ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) = (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ))))
39		biidd 261	. . . . . . . 8 ⊢ (𝑧 = 1 → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ↔ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹))
40		1zzd 12589	. . . . . . . . . . . 12 ⊢ (𝜑 → 1 ∈ ℤ)
41	10, 5, 40	iscau3 24786	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐹 ∈ (Cau‘𝐷) ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧))))
42	41	simplbda 500	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (Cau‘𝐷)) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧))
43	19, 42	mpdan 685	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧))
44		simp1 1136	. . . . . . . . . . . 12 ⊢ ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧) → 𝑘 ∈ dom 𝐹)
45	44	ralimi 3083	. . . . . . . . . . 11 ⊢ (∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧) → ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
46	45	reximi 3084	. . . . . . . . . 10 ⊢ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
47	46	ralimi 3083	. . . . . . . . 9 ⊢ (∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
48	43, 47	syl 17	. . . . . . . 8 ⊢ (𝜑 → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
49		1rp 12974	. . . . . . . . 9 ⊢ 1 ∈ ℝ⁺
50	49	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 1 ∈ ℝ⁺)
51	39, 48, 50	rspcdva 3613	. . . . . . 7 ⊢ (𝜑 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
52		dfss3 3969	. . . . . . . . 9 ⊢ ((ℤ_≥‘𝑗) ⊆ dom 𝐹 ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
53		nnsscn 12213	. . . . . . . . . . . . . 14 ⊢ ℕ ⊆ ℂ
54	31, 53	jctir 521	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐺:ℕ⟶𝑋 ∧ ℕ ⊆ ℂ))
55		elpm2r 8835	. . . . . . . . . . . . 13 ⊢ (((𝑋 ∈ dom CMet ∧ ℂ ∈ V) ∧ (𝐺:ℕ⟶𝑋 ∧ ℕ ⊆ ℂ)) → 𝐺 ∈ (𝑋 ↑_pm ℂ))
56	16, 18, 54, 55	syl21anc 836	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐺 ∈ (𝑋 ↑_pm ℂ))
57	56	adantr 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → 𝐺 ∈ (𝑋 ↑_pm ℂ))
58		eqid 2732	. . . . . . . . . . . . . . 15 ⊢ (ℤ_≥‘𝑗) = (ℤ_≥‘𝑗)
59	5	adantr 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → 𝐷 ∈ (∞Met‘𝑋))
60		nnz 12575	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 ∈ ℕ → 𝑗 ∈ ℤ)
61	60	ad2antrl 726	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → 𝑗 ∈ ℤ)
62		eqidd 2733	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) = (𝐹‘𝑘))
63		eqidd 2733	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑚) = (𝐹‘𝑚))
64	58, 59, 61, 62, 63	iscau4 24787	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (𝐹 ∈ (Cau‘𝐷) ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧))))
65	64	simplbda 500	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝐹 ∈ (Cau‘𝐷)) → ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧))
66	19, 65	mpidan 687	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧))
67		simprl 769	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → 𝑗 ∈ ℕ)
68		eluznn 12898	. . . . . . . . . . . . . . . 16 ⊢ ((𝑗 ∈ ℕ ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → 𝑚 ∈ ℕ)
69	67, 68	sylan 580	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → 𝑚 ∈ ℕ)
70		eluznn 12898	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑚 ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘𝑚)) → 𝑘 ∈ ℕ)
71	30, 29	dmmptd 6692	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → dom 𝐺 = ℕ)
72	71	adantr 481	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → dom 𝐺 = ℕ)
73	72	eleq2d 2819	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (𝑘 ∈ dom 𝐺 ↔ 𝑘 ∈ ℕ))
74	73	biimpar 478	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ dom 𝐺)
75	74	a1d 25	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ ℕ) → (𝑘 ∈ dom 𝐹 → 𝑘 ∈ dom 𝐺))
76		idd 24	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝑘) ∈ 𝑋 → (𝐹‘𝑘) ∈ 𝑋))
77		idd 24	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ ℕ) → (((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧 → ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧))
78	75, 76, 77	3anim123d 1443	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ ℕ) → ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → (𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
79	70, 78	sylan2 593	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ (𝑚 ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘𝑚))) → ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → (𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
80	79	anassrs 468	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑚)) → ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → (𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
81	80	ralimdva 3167	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ ℕ) → (∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → ∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
82	69, 81	syldan 591	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → (∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → ∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
83	82	reximdva 3168	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
84	83	ralimdv 3169	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
85	66, 84	mpd 15	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧))
86		eluznn 12898	. . . . . . . . . . . . . 14 ⊢ ((𝑗 ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ ℕ)
87	67, 86	sylan 580	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ ℕ)
88		simprr 771	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (ℤ_≥‘𝑗) ⊆ dom 𝐹)
89	88	sselda 3981	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ dom 𝐹)
90		iftrue 4533	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ dom 𝐹 → if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃) = (𝐹‘𝑘))
91	90	adantl 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘 ∈ ℕ ∧ 𝑘 ∈ dom 𝐹) → if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃) = (𝐹‘𝑘))
92		fvex 6901	. . . . . . . . . . . . . . . 16 ⊢ (𝐹‘𝑘) ∈ V
93	91, 92	eqeltrdi 2841	. . . . . . . . . . . . . . 15 ⊢ ((𝑘 ∈ ℕ ∧ 𝑘 ∈ dom 𝐹) → if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃) ∈ V)
94		eleq1w 2816	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑘 → (𝑥 ∈ dom 𝐹 ↔ 𝑘 ∈ dom 𝐹))
95		fveq2 6888	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑘 → (𝐹‘𝑥) = (𝐹‘𝑘))
96	94, 95	ifbieq1d 4551	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑘 → if(𝑥 ∈ dom 𝐹, (𝐹‘𝑥), 𝑃) = if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃))
97	96, 30	fvmptg 6993	. . . . . . . . . . . . . . 15 ⊢ ((𝑘 ∈ ℕ ∧ if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃) ∈ V) → (𝐺‘𝑘) = if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃))
98	93, 97	syldan 591	. . . . . . . . . . . . . 14 ⊢ ((𝑘 ∈ ℕ ∧ 𝑘 ∈ dom 𝐹) → (𝐺‘𝑘) = if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃))
99	98, 91	eqtrd 2772	. . . . . . . . . . . . 13 ⊢ ((𝑘 ∈ ℕ ∧ 𝑘 ∈ dom 𝐹) → (𝐺‘𝑘) = (𝐹‘𝑘))
100	87, 89, 99	syl2anc 584	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐺‘𝑘) = (𝐹‘𝑘))
101	88	sselda 3981	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → 𝑚 ∈ dom 𝐹)
102	69, 101	elind 4193	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → 𝑚 ∈ (ℕ ∩ dom 𝐹))
103		fveq2 6888	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑚 → (𝐺‘𝑘) = (𝐺‘𝑚))
104		fveq2 6888	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑚 → (𝐹‘𝑘) = (𝐹‘𝑚))
105	103, 104	eqeq12d 2748	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑚 → ((𝐺‘𝑘) = (𝐹‘𝑘) ↔ (𝐺‘𝑚) = (𝐹‘𝑚)))
106		elin 3963	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (ℕ ∩ dom 𝐹) ↔ (𝑘 ∈ ℕ ∧ 𝑘 ∈ dom 𝐹))
107	106, 99	sylbi 216	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ (ℕ ∩ dom 𝐹) → (𝐺‘𝑘) = (𝐹‘𝑘))
108	105, 107	vtoclga 3565	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ (ℕ ∩ dom 𝐹) → (𝐺‘𝑚) = (𝐹‘𝑚))
109	102, 108	syl 17	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → (𝐺‘𝑚) = (𝐹‘𝑚))
110	58, 59, 61, 100, 109	iscau4 24787	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (𝐺 ∈ (Cau‘𝐷) ↔ (𝐺 ∈ (𝑋 ↑_pm ℂ) ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧))))
111	57, 85, 110	mpbir2and 711	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → 𝐺 ∈ (Cau‘𝐷))
112	111	expr 457	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((ℤ_≥‘𝑗) ⊆ dom 𝐹 → 𝐺 ∈ (Cau‘𝐷)))
113	52, 112	biimtrrid 242	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 → 𝐺 ∈ (Cau‘𝐷)))
114	113	rexlimdva 3155	. . . . . . 7 ⊢ (𝜑 → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 → 𝐺 ∈ (Cau‘𝐷)))
115	51, 114	mpd 15	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ (Cau‘𝐷))
116		eqid 2732	. . . . . . . 8 ⊢ ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) = ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ))
117	10, 116	caucfil 24791	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 1 ∈ ℤ ∧ 𝐺:ℕ⟶𝑋) → (𝐺 ∈ (Cau‘𝐷) ↔ ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) ∈ (CauFil‘𝐷)))
118	5, 40, 31, 117	syl3anc 1371	. . . . . 6 ⊢ (𝜑 → (𝐺 ∈ (Cau‘𝐷) ↔ ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) ∈ (CauFil‘𝐷)))
119	115, 118	mpbid 231	. . . . 5 ⊢ (𝜑 → ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) ∈ (CauFil‘𝐷))
120	6	cmetcvg 24793	. . . . 5 ⊢ ((𝐷 ∈ (CMet‘𝑋) ∧ ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) ∈ (CauFil‘𝐷)) → (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ))) ≠ ∅)
121	1, 119, 120	syl2anc 584	. . . 4 ⊢ (𝜑 → (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ))) ≠ ∅)
122	38, 121	eqnetrd 3008	. . 3 ⊢ (𝜑 → ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) ≠ ∅)
123		n0 4345	. . 3 ⊢ (((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) ≠ ∅ ↔ ∃𝑦 𝑦 ∈ ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺))
124	122, 123	sylib 217	. 2 ⊢ (𝜑 → ∃𝑦 𝑦 ∈ ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺))
125	10, 34	lmflf 23500	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 1 ∈ ℤ ∧ 𝐺:ℕ⟶𝑋) → (𝐺(⇝_𝑡‘𝐽)𝑦 ↔ 𝑦 ∈ ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺)))
126	8, 40, 31, 125	syl3anc 1371	. . . 4 ⊢ (𝜑 → (𝐺(⇝_𝑡‘𝐽)𝑦 ↔ 𝑦 ∈ ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺)))
127	21	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝐹 ∈ (𝑋 ↑_pm ℂ))
128		lmcl 22792	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝑦 ∈ 𝑋)
129	8, 128	sylan 580	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝑦 ∈ 𝑋)
130	6, 5, 10, 40	lmmbr3 24768	. . . . . . . . . 10 ⊢ (𝜑 → (𝐺(⇝_𝑡‘𝐽)𝑦 ↔ (𝐺 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑦 ∈ 𝑋 ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))))
131	130	biimpa 477	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → (𝐺 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑦 ∈ 𝑋 ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)))
132	131	simp3d 1144	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))
133		r19.26 3111	. . . . . . . . . . 11 ⊢ (∀𝑧 ∈ ℝ⁺ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) ↔ (∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)))
134	10	rexanuz2 15292	. . . . . . . . . . . . 13 ⊢ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) ↔ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)))
135		simprl 769	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → 𝑘 ∈ dom 𝐹)
136	99	ad2ant2lr 746	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → (𝐺‘𝑘) = (𝐹‘𝑘))
137		simprr2 1222	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → (𝐺‘𝑘) ∈ 𝑋)
138	136, 137	eqeltrrd 2834	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → (𝐹‘𝑘) ∈ 𝑋)
139	136	oveq1d 7420	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → ((𝐺‘𝑘)𝐷𝑦) = ((𝐹‘𝑘)𝐷𝑦))
140		simprr3 1223	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → ((𝐺‘𝑘)𝐷𝑦) < 𝑧)
141	139, 140	eqbrtrrd 5171	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → ((𝐹‘𝑘)𝐷𝑦) < 𝑧)
142	135, 138, 141	3jca 1128	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧))
143	142	ex 413	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
144	86, 143	sylan2 593	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
145	144	anassrs 468	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
146	145	ralimdva 3167	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
147	146	reximdva 3168	. . . . . . . . . . . . 13 ⊢ (𝜑 → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
148	134, 147	biimtrrid 242	. . . . . . . . . . . 12 ⊢ (𝜑 → ((∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
149	148	ralimdv 3169	. . . . . . . . . . 11 ⊢ (𝜑 → (∀𝑧 ∈ ℝ⁺ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
150	133, 149	biimtrrid 242	. . . . . . . . . 10 ⊢ (𝜑 → ((∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
151	48, 150	mpand 693	. . . . . . . . 9 ⊢ (𝜑 → (∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
152	151	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → (∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
153	132, 152	mpd 15	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧))
154	5	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝐷 ∈ (∞Met‘𝑋))
155		1zzd 12589	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 1 ∈ ℤ)
156	6, 154, 10, 155	lmmbr3 24768	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → (𝐹(⇝_𝑡‘𝐽)𝑦 ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑦 ∈ 𝑋 ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧))))
157	127, 129, 153, 156	mpbir3and 1342	. . . . . 6 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝐹(⇝_𝑡‘𝐽)𝑦)
158		lmrel 22725	. . . . . . 7 ⊢ Rel (⇝_𝑡‘𝐽)
159	158	releldmi 5945	. . . . . 6 ⊢ (𝐹(⇝_𝑡‘𝐽)𝑦 → 𝐹 ∈ dom (⇝_𝑡‘𝐽))
160	157, 159	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝐹 ∈ dom (⇝_𝑡‘𝐽))
161	160	ex 413	. . . 4 ⊢ (𝜑 → (𝐺(⇝_𝑡‘𝐽)𝑦 → 𝐹 ∈ dom (⇝_𝑡‘𝐽)))
162	126, 161	sylbird 259	. . 3 ⊢ (𝜑 → (𝑦 ∈ ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) → 𝐹 ∈ dom (⇝_𝑡‘𝐽)))
163	162	exlimdv 1936	. 2 ⊢ (𝜑 → (∃𝑦 𝑦 ∈ ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) → 𝐹 ∈ dom (⇝_𝑡‘𝐽)))
164	124, 163	mpd 15	1 ⊢ (𝜑 → 𝐹 ∈ dom (⇝_𝑡‘𝐽))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∃wex 1781 ∈ wcel 2106 ≠ wne 2940 ∀wral 3061 ∃wrex 3070 Vcvv 3474 ∩ cin 3946 ⊆ wss 3947 ∅c0 4321 ifcif 4527 class class class wbr 5147 ↦ cmpt 5230 dom cdm 5675 “ cima 5678 ⟶wf 6536 ‘cfv 6540 (class class class)co 7405 ↑_pm cpm 8817 ℂcc 11104 1c1 11107 < clt 11244 ℕcn 12208 ℤcz 12554 ℤ_≥cuz 12818 ℝ⁺crp 12970 ∞Metcxmet 20921 Metcmet 20922 fBascfbas 20924 filGencfg 20925 MetOpencmopn 20926 TopOnctopon 22403 ⇝_𝑡clm 22721 Filcfil 23340 FilMap cfm 23428 fLim cflim 23429 fLimf cflf 23430 CauFilccfil 24760 Cauccau 24761 CMetccmet 24762

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-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 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 ax-pre-sup 11184

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 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-er 8699 df-map 8818 df-pm 8819 df-en 8936 df-dom 8937 df-sdom 8938 df-sup 9433 df-inf 9434 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-div 11868 df-nn 12209 df-2 12271 df-n0 12469 df-z 12555 df-uz 12819 df-q 12929 df-rp 12971 df-xneg 13088 df-xadd 13089 df-xmul 13090 df-ico 13326 df-rest 17364 df-topgen 17385 df-psmet 20928 df-xmet 20929 df-met 20930 df-bl 20931 df-mopn 20932 df-fbas 20933 df-fg 20934 df-top 22387 df-topon 22404 df-bases 22440 df-ntr 22515 df-nei 22593 df-lm 22724 df-fil 23341 df-fm 23433 df-flim 23434 df-flf 23435 df-cfil 24763 df-cau 24764 df-cmet 24765

This theorem is referenced by: cmetcau 24797

W3C validator