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 25036

Description: Lemma for cmetcau 25037. (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 25034	. . . . . . . . 9 ⊢ (𝐷 ∈ (CMet‘𝑋) → 𝐷 ∈ (Met‘𝑋))
3	1, 2	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐷 ∈ (Met‘𝑋))
4		metxmet 24060	. . . . . . . 8 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋))
5	3, 4	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋))
6		cmetcau.1	. . . . . . . 8 ⊢ 𝐽 = (MetOpen‘𝐷)
7	6	mopntopon 24165	. . . . . . 7 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ (TopOn‘𝑋))
8	5, 7	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
9		1z 12596	. . . . . . . 8 ⊢ 1 ∈ ℤ
10		nnuz 12869	. . . . . . . . 9 ⊢ ℕ = (ℤ_≥‘1)
11	10	uzfbas 23622	. . . . . . . 8 ⊢ (1 ∈ ℤ → (ℤ_≥ “ ℕ) ∈ (fBas‘ℕ))
12	9, 11	mp1i 13	. . . . . . 7 ⊢ (𝜑 → (ℤ_≥ “ ℕ) ∈ (fBas‘ℕ))
13		fgcl 23602	. . . . . . 7 ⊢ ((ℤ_≥ “ ℕ) ∈ (fBas‘ℕ) → (ℕfilGen(ℤ_≥ “ ℕ)) ∈ (Fil‘ℕ))
14	12, 13	syl 17	. . . . . 6 ⊢ (𝜑 → (ℕfilGen(ℤ_≥ “ ℕ)) ∈ (Fil‘ℕ))
15		elfvdm 6927	. . . . . . . . . . . 12 ⊢ (𝐷 ∈ (CMet‘𝑋) → 𝑋 ∈ dom CMet)
16	1, 15	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ dom CMet)
17		cnex 11193	. . . . . . . . . . . 12 ⊢ ℂ ∈ V
18	17	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → ℂ ∈ V)
19		cmetcau.5	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹 ∈ (Cau‘𝐷))
20		caufpm 25030	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (Cau‘𝐷)) → 𝐹 ∈ (𝑋 ↑_pm ℂ))
21	5, 19, 20	syl2anc 582	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 ∈ (𝑋 ↑_pm ℂ))
22		elpm2g 8840	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ dom CMet ∧ ℂ ∈ V) → (𝐹 ∈ (𝑋 ↑_pm ℂ) ↔ (𝐹:dom 𝐹⟶𝑋 ∧ dom 𝐹 ⊆ ℂ)))
23	22	simprbda 497	. . . . . . . . . . 11 ⊢ (((𝑋 ∈ dom CMet ∧ ℂ ∈ V) ∧ 𝐹 ∈ (𝑋 ↑_pm ℂ)) → 𝐹:dom 𝐹⟶𝑋)
24	16, 18, 21, 23	syl21anc 834	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:dom 𝐹⟶𝑋)
25	24	adantr 479	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℕ) → 𝐹:dom 𝐹⟶𝑋)
26	25	ffvelcdmda 7085	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ 𝑋)
27		cmetcau.4	. . . . . . . . 9 ⊢ (𝜑 → 𝑃 ∈ 𝑋)
28	27	ad2antrr 722	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℕ) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑃 ∈ 𝑋)
29	26, 28	ifclda 4562	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℕ) → if(𝑥 ∈ dom 𝐹, (𝐹‘𝑥), 𝑃) ∈ 𝑋)
30		cmetcau.6	. . . . . . 7 ⊢ 𝐺 = (𝑥 ∈ ℕ ↦ if(𝑥 ∈ dom 𝐹, (𝐹‘𝑥), 𝑃))
31	29, 30	fmptd 7114	. . . . . 6 ⊢ (𝜑 → 𝐺:ℕ⟶𝑋)
32		flfval 23714	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (ℕfilGen(ℤ_≥ “ ℕ)) ∈ (Fil‘ℕ) ∧ 𝐺:ℕ⟶𝑋) → ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) = (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℕfilGen(ℤ_≥ “ ℕ)))))
33	8, 14, 31, 32	syl3anc 1369	. . . . 5 ⊢ (𝜑 → ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) = (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℕfilGen(ℤ_≥ “ ℕ)))))
34		eqid 2730	. . . . . . . 8 ⊢ (ℕfilGen(ℤ_≥ “ ℕ)) = (ℕfilGen(ℤ_≥ “ ℕ))
35	34	fmfg 23673	. . . . . . 7 ⊢ ((𝑋 ∈ dom CMet ∧ (ℤ_≥ “ ℕ) ∈ (fBas‘ℕ) ∧ 𝐺:ℕ⟶𝑋) → ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) = ((𝑋 FilMap 𝐺)‘(ℕfilGen(ℤ_≥ “ ℕ))))
36	16, 12, 31, 35	syl3anc 1369	. . . . . 6 ⊢ (𝜑 → ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) = ((𝑋 FilMap 𝐺)‘(ℕfilGen(ℤ_≥ “ ℕ))))
37	36	oveq2d 7427	. . . . 5 ⊢ (𝜑 → (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ))) = (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℕfilGen(ℤ_≥ “ ℕ)))))
38	33, 37	eqtr4d 2773	. . . 4 ⊢ (𝜑 → ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) = (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ))))
39		biidd 261	. . . . . . . 8 ⊢ (𝑧 = 1 → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ↔ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹))
40		1zzd 12597	. . . . . . . . . . . 12 ⊢ (𝜑 → 1 ∈ ℤ)
41	10, 5, 40	iscau3 25026	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐹 ∈ (Cau‘𝐷) ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧))))
42	41	simplbda 498	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (Cau‘𝐷)) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧))
43	19, 42	mpdan 683	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧))
44		simp1 1134	. . . . . . . . . . . 12 ⊢ ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧) → 𝑘 ∈ dom 𝐹)
45	44	ralimi 3081	. . . . . . . . . . 11 ⊢ (∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧) → ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
46	45	reximi 3082	. . . . . . . . . 10 ⊢ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
47	46	ralimi 3081	. . . . . . . . 9 ⊢ (∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
48	43, 47	syl 17	. . . . . . . 8 ⊢ (𝜑 → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
49		1rp 12982	. . . . . . . . 9 ⊢ 1 ∈ ℝ⁺
50	49	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 1 ∈ ℝ⁺)
51	39, 48, 50	rspcdva 3612	. . . . . . 7 ⊢ (𝜑 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
52		dfss3 3969	. . . . . . . . 9 ⊢ ((ℤ_≥‘𝑗) ⊆ dom 𝐹 ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
53		nnsscn 12221	. . . . . . . . . . . . . 14 ⊢ ℕ ⊆ ℂ
54	31, 53	jctir 519	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐺:ℕ⟶𝑋 ∧ ℕ ⊆ ℂ))
55		elpm2r 8841	. . . . . . . . . . . . 13 ⊢ (((𝑋 ∈ dom CMet ∧ ℂ ∈ V) ∧ (𝐺:ℕ⟶𝑋 ∧ ℕ ⊆ ℂ)) → 𝐺 ∈ (𝑋 ↑_pm ℂ))
56	16, 18, 54, 55	syl21anc 834	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐺 ∈ (𝑋 ↑_pm ℂ))
57	56	adantr 479	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → 𝐺 ∈ (𝑋 ↑_pm ℂ))
58		eqid 2730	. . . . . . . . . . . . . . 15 ⊢ (ℤ_≥‘𝑗) = (ℤ_≥‘𝑗)
59	5	adantr 479	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → 𝐷 ∈ (∞Met‘𝑋))
60		nnz 12583	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 ∈ ℕ → 𝑗 ∈ ℤ)
61	60	ad2antrl 724	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → 𝑗 ∈ ℤ)
62		eqidd 2731	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) = (𝐹‘𝑘))
63		eqidd 2731	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑚) = (𝐹‘𝑚))
64	58, 59, 61, 62, 63	iscau4 25027	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (𝐹 ∈ (Cau‘𝐷) ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧))))
65	64	simplbda 498	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝐹 ∈ (Cau‘𝐷)) → ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧))
66	19, 65	mpidan 685	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧))
67		simprl 767	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → 𝑗 ∈ ℕ)
68		eluznn 12906	. . . . . . . . . . . . . . . 16 ⊢ ((𝑗 ∈ ℕ ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → 𝑚 ∈ ℕ)
69	67, 68	sylan 578	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → 𝑚 ∈ ℕ)
70		eluznn 12906	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑚 ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘𝑚)) → 𝑘 ∈ ℕ)
71	30, 29	dmmptd 6694	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → dom 𝐺 = ℕ)
72	71	adantr 479	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → dom 𝐺 = ℕ)
73	72	eleq2d 2817	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (𝑘 ∈ dom 𝐺 ↔ 𝑘 ∈ ℕ))
74	73	biimpar 476	. . . . . . . . . . . . . . . . . . . 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 1441	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ ℕ) → ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → (𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
79	70, 78	sylan2 591	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ (𝑚 ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘𝑚))) → ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → (𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
80	79	anassrs 466	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑚)) → ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → (𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
81	80	ralimdva 3165	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ ℕ) → (∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → ∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
82	69, 81	syldan 589	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → (∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → ∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
83	82	reximdva 3166	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
84	83	ralimdv 3167	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
85	66, 84	mpd 15	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧))
86		eluznn 12906	. . . . . . . . . . . . . 14 ⊢ ((𝑗 ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ ℕ)
87	67, 86	sylan 578	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ ℕ)
88		simprr 769	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (ℤ_≥‘𝑗) ⊆ dom 𝐹)
89	88	sselda 3981	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ dom 𝐹)
90		iftrue 4533	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ dom 𝐹 → if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃) = (𝐹‘𝑘))
91	90	adantl 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘 ∈ ℕ ∧ 𝑘 ∈ dom 𝐹) → if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃) = (𝐹‘𝑘))
92		fvex 6903	. . . . . . . . . . . . . . . 16 ⊢ (𝐹‘𝑘) ∈ V
93	91, 92	eqeltrdi 2839	. . . . . . . . . . . . . . 15 ⊢ ((𝑘 ∈ ℕ ∧ 𝑘 ∈ dom 𝐹) → if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃) ∈ V)
94		eleq1w 2814	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑘 → (𝑥 ∈ dom 𝐹 ↔ 𝑘 ∈ dom 𝐹))
95		fveq2 6890	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑘 → (𝐹‘𝑥) = (𝐹‘𝑘))
96	94, 95	ifbieq1d 4551	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑘 → if(𝑥 ∈ dom 𝐹, (𝐹‘𝑥), 𝑃) = if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃))
97	96, 30	fvmptg 6995	. . . . . . . . . . . . . . 15 ⊢ ((𝑘 ∈ ℕ ∧ if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃) ∈ V) → (𝐺‘𝑘) = if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃))
98	93, 97	syldan 589	. . . . . . . . . . . . . 14 ⊢ ((𝑘 ∈ ℕ ∧ 𝑘 ∈ dom 𝐹) → (𝐺‘𝑘) = if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃))
99	98, 91	eqtrd 2770	. . . . . . . . . . . . 13 ⊢ ((𝑘 ∈ ℕ ∧ 𝑘 ∈ dom 𝐹) → (𝐺‘𝑘) = (𝐹‘𝑘))
100	87, 89, 99	syl2anc 582	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐺‘𝑘) = (𝐹‘𝑘))
101	88	sselda 3981	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → 𝑚 ∈ dom 𝐹)
102	69, 101	elind 4193	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → 𝑚 ∈ (ℕ ∩ dom 𝐹))
103		fveq2 6890	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑚 → (𝐺‘𝑘) = (𝐺‘𝑚))
104		fveq2 6890	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑚 → (𝐹‘𝑘) = (𝐹‘𝑚))
105	103, 104	eqeq12d 2746	. . . . . . . . . . . . . 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 25027	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (𝐺 ∈ (Cau‘𝐷) ↔ (𝐺 ∈ (𝑋 ↑_pm ℂ) ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧))))
111	57, 85, 110	mpbir2and 709	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → 𝐺 ∈ (Cau‘𝐷))
112	111	expr 455	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((ℤ_≥‘𝑗) ⊆ dom 𝐹 → 𝐺 ∈ (Cau‘𝐷)))
113	52, 112	biimtrrid 242	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 → 𝐺 ∈ (Cau‘𝐷)))
114	113	rexlimdva 3153	. . . . . . 7 ⊢ (𝜑 → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 → 𝐺 ∈ (Cau‘𝐷)))
115	51, 114	mpd 15	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ (Cau‘𝐷))
116		eqid 2730	. . . . . . . 8 ⊢ ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) = ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ))
117	10, 116	caucfil 25031	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 1 ∈ ℤ ∧ 𝐺:ℕ⟶𝑋) → (𝐺 ∈ (Cau‘𝐷) ↔ ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) ∈ (CauFil‘𝐷)))
118	5, 40, 31, 117	syl3anc 1369	. . . . . 6 ⊢ (𝜑 → (𝐺 ∈ (Cau‘𝐷) ↔ ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) ∈ (CauFil‘𝐷)))
119	115, 118	mpbid 231	. . . . 5 ⊢ (𝜑 → ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) ∈ (CauFil‘𝐷))
120	6	cmetcvg 25033	. . . . 5 ⊢ ((𝐷 ∈ (CMet‘𝑋) ∧ ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) ∈ (CauFil‘𝐷)) → (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ))) ≠ ∅)
121	1, 119, 120	syl2anc 582	. . . 4 ⊢ (𝜑 → (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ))) ≠ ∅)
122	38, 121	eqnetrd 3006	. . 3 ⊢ (𝜑 → ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) ≠ ∅)
123		n0 4345	. . 3 ⊢ (((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) ≠ ∅ ↔ ∃𝑦 𝑦 ∈ ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺))
124	122, 123	sylib 217	. 2 ⊢ (𝜑 → ∃𝑦 𝑦 ∈ ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺))
125	10, 34	lmflf 23729	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 1 ∈ ℤ ∧ 𝐺:ℕ⟶𝑋) → (𝐺(⇝_𝑡‘𝐽)𝑦 ↔ 𝑦 ∈ ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺)))
126	8, 40, 31, 125	syl3anc 1369	. . . 4 ⊢ (𝜑 → (𝐺(⇝_𝑡‘𝐽)𝑦 ↔ 𝑦 ∈ ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺)))
127	21	adantr 479	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝐹 ∈ (𝑋 ↑_pm ℂ))
128		lmcl 23021	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝑦 ∈ 𝑋)
129	8, 128	sylan 578	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝑦 ∈ 𝑋)
130	6, 5, 10, 40	lmmbr3 25008	. . . . . . . . . 10 ⊢ (𝜑 → (𝐺(⇝_𝑡‘𝐽)𝑦 ↔ (𝐺 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑦 ∈ 𝑋 ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))))
131	130	biimpa 475	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → (𝐺 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑦 ∈ 𝑋 ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)))
132	131	simp3d 1142	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))
133		r19.26 3109	. . . . . . . . . . 11 ⊢ (∀𝑧 ∈ ℝ⁺ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) ↔ (∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)))
134	10	rexanuz2 15300	. . . . . . . . . . . . 13 ⊢ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) ↔ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)))
135		simprl 767	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → 𝑘 ∈ dom 𝐹)
136	99	ad2ant2lr 744	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → (𝐺‘𝑘) = (𝐹‘𝑘))
137		simprr2 1220	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → (𝐺‘𝑘) ∈ 𝑋)
138	136, 137	eqeltrrd 2832	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → (𝐹‘𝑘) ∈ 𝑋)
139	136	oveq1d 7426	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → ((𝐺‘𝑘)𝐷𝑦) = ((𝐹‘𝑘)𝐷𝑦))
140		simprr3 1221	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → ((𝐺‘𝑘)𝐷𝑦) < 𝑧)
141	139, 140	eqbrtrrd 5171	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → ((𝐹‘𝑘)𝐷𝑦) < 𝑧)
142	135, 138, 141	3jca 1126	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧))
143	142	ex 411	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
144	86, 143	sylan2 591	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
145	144	anassrs 466	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
146	145	ralimdva 3165	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
147	146	reximdva 3166	. . . . . . . . . . . . 13 ⊢ (𝜑 → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
148	134, 147	biimtrrid 242	. . . . . . . . . . . 12 ⊢ (𝜑 → ((∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
149	148	ralimdv 3167	. . . . . . . . . . 11 ⊢ (𝜑 → (∀𝑧 ∈ ℝ⁺ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
150	133, 149	biimtrrid 242	. . . . . . . . . 10 ⊢ (𝜑 → ((∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
151	48, 150	mpand 691	. . . . . . . . 9 ⊢ (𝜑 → (∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
152	151	adantr 479	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → (∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
153	132, 152	mpd 15	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧))
154	5	adantr 479	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝐷 ∈ (∞Met‘𝑋))
155		1zzd 12597	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 1 ∈ ℤ)
156	6, 154, 10, 155	lmmbr3 25008	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → (𝐹(⇝_𝑡‘𝐽)𝑦 ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑦 ∈ 𝑋 ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧))))
157	127, 129, 153, 156	mpbir3and 1340	. . . . . 6 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝐹(⇝_𝑡‘𝐽)𝑦)
158		lmrel 22954	. . . . . . 7 ⊢ Rel (⇝_𝑡‘𝐽)
159	158	releldmi 5946	. . . . . 6 ⊢ (𝐹(⇝_𝑡‘𝐽)𝑦 → 𝐹 ∈ dom (⇝_𝑡‘𝐽))
160	157, 159	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝐹 ∈ dom (⇝_𝑡‘𝐽))
161	160	ex 411	. . . 4 ⊢ (𝜑 → (𝐺(⇝_𝑡‘𝐽)𝑦 → 𝐹 ∈ dom (⇝_𝑡‘𝐽)))
162	126, 161	sylbird 259	. . 3 ⊢ (𝜑 → (𝑦 ∈ ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) → 𝐹 ∈ dom (⇝_𝑡‘𝐽)))
163	162	exlimdv 1934	. 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 394 ∧ w3a 1085 = wceq 1539 ∃wex 1779 ∈ wcel 2104 ≠ wne 2938 ∀wral 3059 ∃wrex 3068 Vcvv 3472 ∩ cin 3946 ⊆ wss 3947 ∅c0 4321 ifcif 4527 class class class wbr 5147 ↦ cmpt 5230 dom cdm 5675 “ cima 5678 ⟶wf 6538 ‘cfv 6542 (class class class)co 7411 ↑_pm cpm 8823 ℂcc 11110 1c1 11113 < clt 11252 ℕcn 12216 ℤcz 12562 ℤ_≥cuz 12826 ℝ⁺crp 12978 ∞Metcxmet 21129 Metcmet 21130 fBascfbas 21132 filGencfg 21133 MetOpencmopn 21134 TopOnctopon 22632 ⇝_𝑡clm 22950 Filcfil 23569 FilMap cfm 23657 fLim cflim 23658 fLimf cflf 23659 CauFilccfil 25000 Cauccau 25001 CMetccmet 25002

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 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 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 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 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-er 8705 df-map 8824 df-pm 8825 df-en 8942 df-dom 8943 df-sdom 8944 df-sup 9439 df-inf 9440 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-div 11876 df-nn 12217 df-2 12279 df-n0 12477 df-z 12563 df-uz 12827 df-q 12937 df-rp 12979 df-xneg 13096 df-xadd 13097 df-xmul 13098 df-ico 13334 df-rest 17372 df-topgen 17393 df-psmet 21136 df-xmet 21137 df-met 21138 df-bl 21139 df-mopn 21140 df-fbas 21141 df-fg 21142 df-top 22616 df-topon 22633 df-bases 22669 df-ntr 22744 df-nei 22822 df-lm 22953 df-fil 23570 df-fm 23662 df-flim 23663 df-flf 23664 df-cfil 25003 df-cau 25004 df-cmet 25005

This theorem is referenced by: cmetcau 25037

W3C validator