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 24805

Description: Lemma for cmetcau 24806. (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 24803	. . . . . . . . 9 ⊢ (𝐷 ∈ (CMet‘𝑋) → 𝐷 ∈ (Met‘𝑋))
3	1, 2	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐷 ∈ (Met‘𝑋))
4		metxmet 23840	. . . . . . . 8 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋))
5	3, 4	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋))
6		cmetcau.1	. . . . . . . 8 ⊢ 𝐽 = (MetOpen‘𝐷)
7	6	mopntopon 23945	. . . . . . 7 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ (TopOn‘𝑋))
8	5, 7	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
9		1z 12592	. . . . . . . 8 ⊢ 1 ∈ ℤ
10		nnuz 12865	. . . . . . . . 9 ⊢ ℕ = (ℤ_≥‘1)
11	10	uzfbas 23402	. . . . . . . 8 ⊢ (1 ∈ ℤ → (ℤ_≥ “ ℕ) ∈ (fBas‘ℕ))
12	9, 11	mp1i 13	. . . . . . 7 ⊢ (𝜑 → (ℤ_≥ “ ℕ) ∈ (fBas‘ℕ))
13		fgcl 23382	. . . . . . 7 ⊢ ((ℤ_≥ “ ℕ) ∈ (fBas‘ℕ) → (ℕfilGen(ℤ_≥ “ ℕ)) ∈ (Fil‘ℕ))
14	12, 13	syl 17	. . . . . 6 ⊢ (𝜑 → (ℕfilGen(ℤ_≥ “ ℕ)) ∈ (Fil‘ℕ))
15		elfvdm 6929	. . . . . . . . . . . 12 ⊢ (𝐷 ∈ (CMet‘𝑋) → 𝑋 ∈ dom CMet)
16	1, 15	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ dom CMet)
17		cnex 11191	. . . . . . . . . . . 12 ⊢ ℂ ∈ V
18	17	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → ℂ ∈ V)
19		cmetcau.5	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹 ∈ (Cau‘𝐷))
20		caufpm 24799	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (Cau‘𝐷)) → 𝐹 ∈ (𝑋 ↑_pm ℂ))
21	5, 19, 20	syl2anc 585	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 ∈ (𝑋 ↑_pm ℂ))
22		elpm2g 8838	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ dom CMet ∧ ℂ ∈ V) → (𝐹 ∈ (𝑋 ↑_pm ℂ) ↔ (𝐹:dom 𝐹⟶𝑋 ∧ dom 𝐹 ⊆ ℂ)))
23	22	simprbda 500	. . . . . . . . . . 11 ⊢ (((𝑋 ∈ dom CMet ∧ ℂ ∈ V) ∧ 𝐹 ∈ (𝑋 ↑_pm ℂ)) → 𝐹:dom 𝐹⟶𝑋)
24	16, 18, 21, 23	syl21anc 837	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:dom 𝐹⟶𝑋)
25	24	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℕ) → 𝐹:dom 𝐹⟶𝑋)
26	25	ffvelcdmda 7087	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ 𝑋)
27		cmetcau.4	. . . . . . . . 9 ⊢ (𝜑 → 𝑃 ∈ 𝑋)
28	27	ad2antrr 725	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℕ) ∧ ¬ 𝑥 ∈ dom 𝐹) → 𝑃 ∈ 𝑋)
29	26, 28	ifclda 4564	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℕ) → if(𝑥 ∈ dom 𝐹, (𝐹‘𝑥), 𝑃) ∈ 𝑋)
30		cmetcau.6	. . . . . . 7 ⊢ 𝐺 = (𝑥 ∈ ℕ ↦ if(𝑥 ∈ dom 𝐹, (𝐹‘𝑥), 𝑃))
31	29, 30	fmptd 7114	. . . . . 6 ⊢ (𝜑 → 𝐺:ℕ⟶𝑋)
32		flfval 23494	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (ℕfilGen(ℤ_≥ “ ℕ)) ∈ (Fil‘ℕ) ∧ 𝐺:ℕ⟶𝑋) → ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) = (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℕfilGen(ℤ_≥ “ ℕ)))))
33	8, 14, 31, 32	syl3anc 1372	. . . . 5 ⊢ (𝜑 → ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) = (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℕfilGen(ℤ_≥ “ ℕ)))))
34		eqid 2733	. . . . . . . 8 ⊢ (ℕfilGen(ℤ_≥ “ ℕ)) = (ℕfilGen(ℤ_≥ “ ℕ))
35	34	fmfg 23453	. . . . . . 7 ⊢ ((𝑋 ∈ dom CMet ∧ (ℤ_≥ “ ℕ) ∈ (fBas‘ℕ) ∧ 𝐺:ℕ⟶𝑋) → ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) = ((𝑋 FilMap 𝐺)‘(ℕfilGen(ℤ_≥ “ ℕ))))
36	16, 12, 31, 35	syl3anc 1372	. . . . . 6 ⊢ (𝜑 → ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) = ((𝑋 FilMap 𝐺)‘(ℕfilGen(ℤ_≥ “ ℕ))))
37	36	oveq2d 7425	. . . . 5 ⊢ (𝜑 → (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ))) = (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℕfilGen(ℤ_≥ “ ℕ)))))
38	33, 37	eqtr4d 2776	. . . 4 ⊢ (𝜑 → ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) = (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ))))
39		biidd 262	. . . . . . . 8 ⊢ (𝑧 = 1 → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ↔ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹))
40		1zzd 12593	. . . . . . . . . . . 12 ⊢ (𝜑 → 1 ∈ ℤ)
41	10, 5, 40	iscau3 24795	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐹 ∈ (Cau‘𝐷) ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧))))
42	41	simplbda 501	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (Cau‘𝐷)) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧))
43	19, 42	mpdan 686	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧))
44		simp1 1137	. . . . . . . . . . . 12 ⊢ ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧) → 𝑘 ∈ dom 𝐹)
45	44	ralimi 3084	. . . . . . . . . . 11 ⊢ (∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧) → ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
46	45	reximi 3085	. . . . . . . . . 10 ⊢ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
47	46	ralimi 3084	. . . . . . . . 9 ⊢ (∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ∀𝑤 ∈ (ℤ_≥‘𝑘)((𝐹‘𝑘)𝐷(𝐹‘𝑤)) < 𝑧) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
48	43, 47	syl 17	. . . . . . . 8 ⊢ (𝜑 → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
49		1rp 12978	. . . . . . . . 9 ⊢ 1 ∈ ℝ⁺
50	49	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 1 ∈ ℝ⁺)
51	39, 48, 50	rspcdva 3614	. . . . . . 7 ⊢ (𝜑 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
52		dfss3 3971	. . . . . . . . 9 ⊢ ((ℤ_≥‘𝑗) ⊆ dom 𝐹 ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹)
53		nnsscn 12217	. . . . . . . . . . . . . 14 ⊢ ℕ ⊆ ℂ
54	31, 53	jctir 522	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐺:ℕ⟶𝑋 ∧ ℕ ⊆ ℂ))
55		elpm2r 8839	. . . . . . . . . . . . 13 ⊢ (((𝑋 ∈ dom CMet ∧ ℂ ∈ V) ∧ (𝐺:ℕ⟶𝑋 ∧ ℕ ⊆ ℂ)) → 𝐺 ∈ (𝑋 ↑_pm ℂ))
56	16, 18, 54, 55	syl21anc 837	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐺 ∈ (𝑋 ↑_pm ℂ))
57	56	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → 𝐺 ∈ (𝑋 ↑_pm ℂ))
58		eqid 2733	. . . . . . . . . . . . . . 15 ⊢ (ℤ_≥‘𝑗) = (ℤ_≥‘𝑗)
59	5	adantr 482	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → 𝐷 ∈ (∞Met‘𝑋))
60		nnz 12579	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 ∈ ℕ → 𝑗 ∈ ℤ)
61	60	ad2antrl 727	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → 𝑗 ∈ ℤ)
62		eqidd 2734	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) = (𝐹‘𝑘))
63		eqidd 2734	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑚) = (𝐹‘𝑚))
64	58, 59, 61, 62, 63	iscau4 24796	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (𝐹 ∈ (Cau‘𝐷) ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧))))
65	64	simplbda 501	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝐹 ∈ (Cau‘𝐷)) → ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧))
66	19, 65	mpidan 688	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧))
67		simprl 770	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → 𝑗 ∈ ℕ)
68		eluznn 12902	. . . . . . . . . . . . . . . 16 ⊢ ((𝑗 ∈ ℕ ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → 𝑚 ∈ ℕ)
69	67, 68	sylan 581	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → 𝑚 ∈ ℕ)
70		eluznn 12902	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑚 ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘𝑚)) → 𝑘 ∈ ℕ)
71	30, 29	dmmptd 6696	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → dom 𝐺 = ℕ)
72	71	adantr 482	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → dom 𝐺 = ℕ)
73	72	eleq2d 2820	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (𝑘 ∈ dom 𝐺 ↔ 𝑘 ∈ ℕ))
74	73	biimpar 479	. . . . . . . . . . . . . . . . . . . 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 1444	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ ℕ) → ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → (𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
79	70, 78	sylan2 594	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ (𝑚 ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘𝑚))) → ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → (𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
80	79	anassrs 469	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑚)) → ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → (𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
81	80	ralimdva 3168	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ ℕ) → (∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → ∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
82	69, 81	syldan 592	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → (∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → ∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
83	82	reximdva 3169	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
84	83	ralimdv 3170	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧) → ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧)))
85	66, 84	mpd 15	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧))
86		eluznn 12902	. . . . . . . . . . . . . 14 ⊢ ((𝑗 ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ ℕ)
87	67, 86	sylan 581	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ ℕ)
88		simprr 772	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (ℤ_≥‘𝑗) ⊆ dom 𝐹)
89	88	sselda 3983	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ dom 𝐹)
90		iftrue 4535	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ dom 𝐹 → if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃) = (𝐹‘𝑘))
91	90	adantl 483	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘 ∈ ℕ ∧ 𝑘 ∈ dom 𝐹) → if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃) = (𝐹‘𝑘))
92		fvex 6905	. . . . . . . . . . . . . . . 16 ⊢ (𝐹‘𝑘) ∈ V
93	91, 92	eqeltrdi 2842	. . . . . . . . . . . . . . 15 ⊢ ((𝑘 ∈ ℕ ∧ 𝑘 ∈ dom 𝐹) → if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃) ∈ V)
94		eleq1w 2817	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑘 → (𝑥 ∈ dom 𝐹 ↔ 𝑘 ∈ dom 𝐹))
95		fveq2 6892	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑘 → (𝐹‘𝑥) = (𝐹‘𝑘))
96	94, 95	ifbieq1d 4553	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑘 → if(𝑥 ∈ dom 𝐹, (𝐹‘𝑥), 𝑃) = if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃))
97	96, 30	fvmptg 6997	. . . . . . . . . . . . . . 15 ⊢ ((𝑘 ∈ ℕ ∧ if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃) ∈ V) → (𝐺‘𝑘) = if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃))
98	93, 97	syldan 592	. . . . . . . . . . . . . 14 ⊢ ((𝑘 ∈ ℕ ∧ 𝑘 ∈ dom 𝐹) → (𝐺‘𝑘) = if(𝑘 ∈ dom 𝐹, (𝐹‘𝑘), 𝑃))
99	98, 91	eqtrd 2773	. . . . . . . . . . . . 13 ⊢ ((𝑘 ∈ ℕ ∧ 𝑘 ∈ dom 𝐹) → (𝐺‘𝑘) = (𝐹‘𝑘))
100	87, 89, 99	syl2anc 585	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐺‘𝑘) = (𝐹‘𝑘))
101	88	sselda 3983	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → 𝑚 ∈ dom 𝐹)
102	69, 101	elind 4195	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → 𝑚 ∈ (ℕ ∩ dom 𝐹))
103		fveq2 6892	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑚 → (𝐺‘𝑘) = (𝐺‘𝑚))
104		fveq2 6892	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑚 → (𝐹‘𝑘) = (𝐹‘𝑚))
105	103, 104	eqeq12d 2749	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑚 → ((𝐺‘𝑘) = (𝐹‘𝑘) ↔ (𝐺‘𝑚) = (𝐹‘𝑚)))
106		elin 3965	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (ℕ ∩ dom 𝐹) ↔ (𝑘 ∈ ℕ ∧ 𝑘 ∈ dom 𝐹))
107	106, 99	sylbi 216	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ (ℕ ∩ dom 𝐹) → (𝐺‘𝑘) = (𝐹‘𝑘))
108	105, 107	vtoclga 3566	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ (ℕ ∩ dom 𝐹) → (𝐺‘𝑚) = (𝐹‘𝑚))
109	102, 108	syl 17	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) ∧ 𝑚 ∈ (ℤ_≥‘𝑗)) → (𝐺‘𝑚) = (𝐹‘𝑚))
110	58, 59, 61, 100, 109	iscau4 24796	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → (𝐺 ∈ (Cau‘𝐷) ↔ (𝐺 ∈ (𝑋 ↑_pm ℂ) ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑗)∀𝑘 ∈ (ℤ_≥‘𝑚)(𝑘 ∈ dom 𝐺 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷(𝐹‘𝑚)) < 𝑧))))
111	57, 85, 110	mpbir2and 712	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ (ℤ_≥‘𝑗) ⊆ dom 𝐹)) → 𝐺 ∈ (Cau‘𝐷))
112	111	expr 458	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((ℤ_≥‘𝑗) ⊆ dom 𝐹 → 𝐺 ∈ (Cau‘𝐷)))
113	52, 112	biimtrrid 242	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 → 𝐺 ∈ (Cau‘𝐷)))
114	113	rexlimdva 3156	. . . . . . 7 ⊢ (𝜑 → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 → 𝐺 ∈ (Cau‘𝐷)))
115	51, 114	mpd 15	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ (Cau‘𝐷))
116		eqid 2733	. . . . . . . 8 ⊢ ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) = ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ))
117	10, 116	caucfil 24800	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 1 ∈ ℤ ∧ 𝐺:ℕ⟶𝑋) → (𝐺 ∈ (Cau‘𝐷) ↔ ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) ∈ (CauFil‘𝐷)))
118	5, 40, 31, 117	syl3anc 1372	. . . . . 6 ⊢ (𝜑 → (𝐺 ∈ (Cau‘𝐷) ↔ ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) ∈ (CauFil‘𝐷)))
119	115, 118	mpbid 231	. . . . 5 ⊢ (𝜑 → ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) ∈ (CauFil‘𝐷))
120	6	cmetcvg 24802	. . . . 5 ⊢ ((𝐷 ∈ (CMet‘𝑋) ∧ ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ)) ∈ (CauFil‘𝐷)) → (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ))) ≠ ∅)
121	1, 119, 120	syl2anc 585	. . . 4 ⊢ (𝜑 → (𝐽 fLim ((𝑋 FilMap 𝐺)‘(ℤ_≥ “ ℕ))) ≠ ∅)
122	38, 121	eqnetrd 3009	. . 3 ⊢ (𝜑 → ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) ≠ ∅)
123		n0 4347	. . 3 ⊢ (((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) ≠ ∅ ↔ ∃𝑦 𝑦 ∈ ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺))
124	122, 123	sylib 217	. 2 ⊢ (𝜑 → ∃𝑦 𝑦 ∈ ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺))
125	10, 34	lmflf 23509	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 1 ∈ ℤ ∧ 𝐺:ℕ⟶𝑋) → (𝐺(⇝_𝑡‘𝐽)𝑦 ↔ 𝑦 ∈ ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺)))
126	8, 40, 31, 125	syl3anc 1372	. . . 4 ⊢ (𝜑 → (𝐺(⇝_𝑡‘𝐽)𝑦 ↔ 𝑦 ∈ ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺)))
127	21	adantr 482	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝐹 ∈ (𝑋 ↑_pm ℂ))
128		lmcl 22801	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝑦 ∈ 𝑋)
129	8, 128	sylan 581	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝑦 ∈ 𝑋)
130	6, 5, 10, 40	lmmbr3 24777	. . . . . . . . . 10 ⊢ (𝜑 → (𝐺(⇝_𝑡‘𝐽)𝑦 ↔ (𝐺 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑦 ∈ 𝑋 ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))))
131	130	biimpa 478	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → (𝐺 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑦 ∈ 𝑋 ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)))
132	131	simp3d 1145	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))
133		r19.26 3112	. . . . . . . . . . 11 ⊢ (∀𝑧 ∈ ℝ⁺ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) ↔ (∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)))
134	10	rexanuz2 15296	. . . . . . . . . . . . 13 ⊢ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) ↔ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)))
135		simprl 770	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → 𝑘 ∈ dom 𝐹)
136	99	ad2ant2lr 747	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → (𝐺‘𝑘) = (𝐹‘𝑘))
137		simprr2 1223	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → (𝐺‘𝑘) ∈ 𝑋)
138	136, 137	eqeltrrd 2835	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → (𝐹‘𝑘) ∈ 𝑋)
139	136	oveq1d 7424	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → ((𝐺‘𝑘)𝐷𝑦) = ((𝐹‘𝑘)𝐷𝑦))
140		simprr3 1224	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → ((𝐺‘𝑘)𝐷𝑦) < 𝑧)
141	139, 140	eqbrtrrd 5173	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → ((𝐹‘𝑘)𝐷𝑦) < 𝑧)
142	135, 138, 141	3jca 1129	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧))) → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧))
143	142	ex 414	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
144	86, 143	sylan2 594	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘𝑗))) → ((𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
145	144	anassrs 469	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
146	145	ralimdva 3168	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
147	146	reximdva 3169	. . . . . . . . . . . . 13 ⊢ (𝜑 → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
148	134, 147	biimtrrid 242	. . . . . . . . . . . 12 ⊢ (𝜑 → ((∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
149	148	ralimdv 3170	. . . . . . . . . . 11 ⊢ (𝜑 → (∀𝑧 ∈ ℝ⁺ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
150	133, 149	biimtrrid 242	. . . . . . . . . 10 ⊢ (𝜑 → ((∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑘 ∈ dom 𝐹 ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧)) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
151	48, 150	mpand 694	. . . . . . . . 9 ⊢ (𝜑 → (∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
152	151	adantr 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → (∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ ((𝐺‘𝑘)𝐷𝑦) < 𝑧) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧)))
153	132, 152	mpd 15	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧))
154	5	adantr 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝐷 ∈ (∞Met‘𝑋))
155		1zzd 12593	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 1 ∈ ℤ)
156	6, 154, 10, 155	lmmbr3 24777	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → (𝐹(⇝_𝑡‘𝐽)𝑦 ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑦 ∈ 𝑋 ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑦) < 𝑧))))
157	127, 129, 153, 156	mpbir3and 1343	. . . . . 6 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝐹(⇝_𝑡‘𝐽)𝑦)
158		lmrel 22734	. . . . . . 7 ⊢ Rel (⇝_𝑡‘𝐽)
159	158	releldmi 5948	. . . . . 6 ⊢ (𝐹(⇝_𝑡‘𝐽)𝑦 → 𝐹 ∈ dom (⇝_𝑡‘𝐽))
160	157, 159	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝐺(⇝_𝑡‘𝐽)𝑦) → 𝐹 ∈ dom (⇝_𝑡‘𝐽))
161	160	ex 414	. . . 4 ⊢ (𝜑 → (𝐺(⇝_𝑡‘𝐽)𝑦 → 𝐹 ∈ dom (⇝_𝑡‘𝐽)))
162	126, 161	sylbird 260	. . 3 ⊢ (𝜑 → (𝑦 ∈ ((𝐽 fLimf (ℕfilGen(ℤ_≥ “ ℕ)))‘𝐺) → 𝐹 ∈ dom (⇝_𝑡‘𝐽)))
163	162	exlimdv 1937	. 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 397 ∧ w3a 1088 = wceq 1542 ∃wex 1782 ∈ wcel 2107 ≠ wne 2941 ∀wral 3062 ∃wrex 3071 Vcvv 3475 ∩ cin 3948 ⊆ wss 3949 ∅c0 4323 ifcif 4529 class class class wbr 5149 ↦ cmpt 5232 dom cdm 5677 “ cima 5680 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 ↑_pm cpm 8821 ℂcc 11108 1c1 11111 < clt 11248 ℕcn 12212 ℤcz 12558 ℤ_≥cuz 12822 ℝ⁺crp 12974 ∞Metcxmet 20929 Metcmet 20930 fBascfbas 20932 filGencfg 20933 MetOpencmopn 20934 TopOnctopon 22412 ⇝_𝑡clm 22730 Filcfil 23349 FilMap cfm 23437 fLim cflim 23438 fLimf cflf 23439 CauFilccfil 24769 Cauccau 24770 CMetccmet 24771

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-er 8703 df-map 8822 df-pm 8823 df-en 8940 df-dom 8941 df-sdom 8942 df-sup 9437 df-inf 9438 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-n0 12473 df-z 12559 df-uz 12823 df-q 12933 df-rp 12975 df-xneg 13092 df-xadd 13093 df-xmul 13094 df-ico 13330 df-rest 17368 df-topgen 17389 df-psmet 20936 df-xmet 20937 df-met 20938 df-bl 20939 df-mopn 20940 df-fbas 20941 df-fg 20942 df-top 22396 df-topon 22413 df-bases 22449 df-ntr 22524 df-nei 22602 df-lm 22733 df-fil 23350 df-fm 23442 df-flim 23443 df-flf 23444 df-cfil 24772 df-cau 24773 df-cmet 24774

This theorem is referenced by: cmetcau 24806

W3C validator