Theorem lmtopcnp 15353

Description: The image of a convergent sequence under a continuous map is convergent to the image of the original point. (Contributed by Mario Carneiro, 3-May-2014.) (Revised by Jim Kingdon, 6-Apr-2023.)

Hypotheses

Ref	Expression
lmcnp.3	⊢ (𝜑 → 𝐹(⇝𝑡‘𝐽)𝑃)
lmcnp.k	⊢ (𝜑 → 𝐾 ∈ Top)
lmcnp.4	⊢ (𝜑 → 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝑃))

Assertion

Ref	Expression
lmtopcnp	⊢ (𝜑 → (𝐺 ∘ 𝐹)(⇝𝑡‘𝐾)(𝐺‘𝑃))

Proof of Theorem lmtopcnp

Dummy variables 𝑗 𝑘 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lmcnp.3	. . . . . . . 8 ⊢ (𝜑 → 𝐹(⇝𝑡‘𝐽)𝑃)
2		lmrcl 15295	. . . . . . . 8 ⊢ (𝐹(⇝𝑡‘𝐽)𝑃 → 𝐽 ∈ Top)
3	1, 2	syl 14	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ Top)
4		toptopon2 15122	. . . . . . 7 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
5	3, 4	sylib 122	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘∪ 𝐽))
6		lmcnp.k	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ Top)
7		toptopon2 15122	. . . . . . 7 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
8	6, 7	sylib 122	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘∪ 𝐾))
9		lmcnp.4	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝑃))
10		cnpf2 15310	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐺:∪ 𝐽⟶∪ 𝐾)
11	5, 8, 9, 10	syl3anc 1278	. . . . 5 ⊢ (𝜑 → 𝐺:∪ 𝐽⟶∪ 𝐾)
12		nnuz 9960	. . . . . . . . . 10 ⊢ ℕ = (ℤ≥‘1)
13		1zzd 9673	. . . . . . . . . 10 ⊢ (𝜑 → 1 ∈ ℤ)
14	5, 12, 13	lmbr2 15317	. . . . . . . . 9 ⊢ (𝜑 → (𝐹(⇝𝑡‘𝐽)𝑃 ↔ (𝐹 ∈ (∪ 𝐽 ↑pm ℂ) ∧ 𝑃 ∈ ∪ 𝐽 ∧ ∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)))))
15	1, 14	mpbid 147	. . . . . . . 8 ⊢ (𝜑 → (𝐹 ∈ (∪ 𝐽 ↑pm ℂ) ∧ 𝑃 ∈ ∪ 𝐽 ∧ ∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣))))
16	15	simp1d 1040	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (∪ 𝐽 ↑pm ℂ))
17		uniexg 4585	. . . . . . . . 9 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ V)
18	3, 17	syl 14	. . . . . . . 8 ⊢ (𝜑 → ∪ 𝐽 ∈ V)
19		cnex 8303	. . . . . . . 8 ⊢ ℂ ∈ V
20		elpm2g 6939	. . . . . . . 8 ⊢ ((∪ 𝐽 ∈ V ∧ ℂ ∈ V) → (𝐹 ∈ (∪ 𝐽 ↑pm ℂ) ↔ (𝐹:dom 𝐹⟶∪ 𝐽 ∧ dom 𝐹 ⊆ ℂ)))
21	18, 19, 20	sylancl 417	. . . . . . 7 ⊢ (𝜑 → (𝐹 ∈ (∪ 𝐽 ↑pm ℂ) ↔ (𝐹:dom 𝐹⟶∪ 𝐽 ∧ dom 𝐹 ⊆ ℂ)))
22	16, 21	mpbid 147	. . . . . 6 ⊢ (𝜑 → (𝐹:dom 𝐹⟶∪ 𝐽 ∧ dom 𝐹 ⊆ ℂ))
23	22	simpld 112	. . . . 5 ⊢ (𝜑 → 𝐹:dom 𝐹⟶∪ 𝐽)
24		fco 5552	. . . . 5 ⊢ ((𝐺:∪ 𝐽⟶∪ 𝐾 ∧ 𝐹:dom 𝐹⟶∪ 𝐽) → (𝐺 ∘ 𝐹):dom 𝐹⟶∪ 𝐾)
25	11, 23, 24	syl2anc 415	. . . 4 ⊢ (𝜑 → (𝐺 ∘ 𝐹):dom 𝐹⟶∪ 𝐾)
26	25	fdmd 5540	. . . . 5 ⊢ (𝜑 → dom (𝐺 ∘ 𝐹) = dom 𝐹)
27	26	feq2d 5521	. . . 4 ⊢ (𝜑 → ((𝐺 ∘ 𝐹):dom (𝐺 ∘ 𝐹)⟶∪ 𝐾 ↔ (𝐺 ∘ 𝐹):dom 𝐹⟶∪ 𝐾))
28	25, 27	mpbird 167	. . 3 ⊢ (𝜑 → (𝐺 ∘ 𝐹):dom (𝐺 ∘ 𝐹)⟶∪ 𝐾)
29	22	simprd 114	. . . 4 ⊢ (𝜑 → dom 𝐹 ⊆ ℂ)
30	26, 29	eqsstrd 3284	. . 3 ⊢ (𝜑 → dom (𝐺 ∘ 𝐹) ⊆ ℂ)
31		uniexg 4585	. . . . 5 ⊢ (𝐾 ∈ Top → ∪ 𝐾 ∈ V)
32	6, 31	syl 14	. . . 4 ⊢ (𝜑 → ∪ 𝐾 ∈ V)
33		elpm2g 6939	. . . 4 ⊢ ((∪ 𝐾 ∈ V ∧ ℂ ∈ V) → ((𝐺 ∘ 𝐹) ∈ (∪ 𝐾 ↑pm ℂ) ↔ ((𝐺 ∘ 𝐹):dom (𝐺 ∘ 𝐹)⟶∪ 𝐾 ∧ dom (𝐺 ∘ 𝐹) ⊆ ℂ)))
34	32, 19, 33	sylancl 417	. . 3 ⊢ (𝜑 → ((𝐺 ∘ 𝐹) ∈ (∪ 𝐾 ↑pm ℂ) ↔ ((𝐺 ∘ 𝐹):dom (𝐺 ∘ 𝐹)⟶∪ 𝐾 ∧ dom (𝐺 ∘ 𝐹) ⊆ ℂ)))
35	28, 30, 34	mpbir2and 957	. 2 ⊢ (𝜑 → (𝐺 ∘ 𝐹) ∈ (∪ 𝐾 ↑pm ℂ))
36	15	simp2d 1041	. . 3 ⊢ (𝜑 → 𝑃 ∈ ∪ 𝐽)
37	11, 36	ffvelcdmd 5844	. 2 ⊢ (𝜑 → (𝐺‘𝑃) ∈ ∪ 𝐾)
38	15	simp3d 1042	. . . . . 6 ⊢ (𝜑 → ∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)))
39	38	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)))
40	5	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → 𝐽 ∈ (TopOn‘∪ 𝐽))
41	8	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → 𝐾 ∈ (TopOn‘∪ 𝐾))
42	36	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → 𝑃 ∈ ∪ 𝐽)
43	9	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝑃))
44		simprl 535	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → 𝑢 ∈ 𝐾)
45		simprr 537	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → (𝐺‘𝑃) ∈ 𝑢)
46		icnpimaex 15314	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝑃 ∈ ∪ 𝐽) ∧ (𝐺 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
47	40, 41, 42, 43, 44, 45, 46	syl33anc 1293	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
48		r19.29 2688	. . . . . . 7 ⊢ ((∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ∃𝑣 ∈ 𝐽 ((𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)))
49		pm3.45 605	. . . . . . . . 9 ⊢ ((𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) → ((𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢) → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢)))
50	49	imp 124	. . . . . . . 8 ⊢ (((𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
51	50	reximi 2647	. . . . . . 7 ⊢ (∃𝑣 ∈ 𝐽 ((𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ∃𝑣 ∈ 𝐽 (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
52	48, 51	syl 14	. . . . . 6 ⊢ ((∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ∃𝑣 ∈ 𝐽 (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
53	11	ad3antrrr 496	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝐺:∪ 𝐽⟶∪ 𝐾)
54	53	ffnd 5534	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝐺 Fn ∪ 𝐽)
55		simplrl 541	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝑣 ∈ 𝐽)
56		elssuni 3963	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑣 ∈ 𝐽 → 𝑣 ⊆ ∪ 𝐽)
57	55, 56	syl 14	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝑣 ⊆ ∪ 𝐽)
58		fnfvima 5953	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐺 Fn ∪ 𝐽 ∧ 𝑣 ⊆ ∪ 𝐽 ∧ (𝐹‘𝑘) ∈ 𝑣) → (𝐺‘(𝐹‘𝑘)) ∈ (𝐺 “ 𝑣))
59	58	3expia 1236	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐺 Fn ∪ 𝐽 ∧ 𝑣 ⊆ ∪ 𝐽) → ((𝐹‘𝑘) ∈ 𝑣 → (𝐺‘(𝐹‘𝑘)) ∈ (𝐺 “ 𝑣)))
60	54, 57, 59	syl2anc 415	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ∈ 𝑣 → (𝐺‘(𝐹‘𝑘)) ∈ (𝐺 “ 𝑣)))
61	23	ad2antrr 492	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → 𝐹:dom 𝐹⟶∪ 𝐽)
62		fvco3 5776	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹:dom 𝐹⟶∪ 𝐽 ∧ 𝑘 ∈ dom 𝐹) → ((𝐺 ∘ 𝐹)‘𝑘) = (𝐺‘(𝐹‘𝑘)))
63	61, 62	sylan 283	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐺 ∘ 𝐹)‘𝑘) = (𝐺‘(𝐹‘𝑘)))
64	63	eleq1d 2307	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → (((𝐺 ∘ 𝐹)‘𝑘) ∈ (𝐺 “ 𝑣) ↔ (𝐺‘(𝐹‘𝑘)) ∈ (𝐺 “ 𝑣)))
65	60, 64	sylibrd 169	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ∈ 𝑣 → ((𝐺 ∘ 𝐹)‘𝑘) ∈ (𝐺 “ 𝑣)))
66		simplrr 542	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → (𝐺 “ 𝑣) ⊆ 𝑢)
67	66	sseld 3247	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → (((𝐺 ∘ 𝐹)‘𝑘) ∈ (𝐺 “ 𝑣) → ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢))
68	65, 67	syld 45	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ∈ 𝑣 → ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢))
69		simpr 110	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝑘 ∈ dom 𝐹)
70	26	ad3antrrr 496	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → dom (𝐺 ∘ 𝐹) = dom 𝐹)
71	69, 70	eleqtrrd 2318	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝑘 ∈ dom (𝐺 ∘ 𝐹))
72	68, 71	jctild 316	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ∈ 𝑣 → (𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
73	72	expimpd 363	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) → (𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
74	73	ralimdv 2618	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → (∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) → ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
75	74	reximdv 2651	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
76	75	expr 375	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ 𝑣 ∈ 𝐽) → ((𝐺 “ 𝑣) ⊆ 𝑢 → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢))))
77	76	com23 78	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ 𝑣 ∈ 𝐽) → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) → ((𝐺 “ 𝑣) ⊆ 𝑢 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢))))
78	77	impd 254	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ 𝑣 ∈ 𝐽) → ((∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
79	78	rexlimdva 2668	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → (∃𝑣 ∈ 𝐽 (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
80	52, 79	syl5 32	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ((∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
81	39, 47, 80	mp2and 437	. . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢))
82	81	expr 375	. . 3 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐾) → ((𝐺‘𝑃) ∈ 𝑢 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
83	82	ralrimiva 2623	. 2 ⊢ (𝜑 → ∀𝑢 ∈ 𝐾 ((𝐺‘𝑃) ∈ 𝑢 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
84	8, 12, 13	lmbr2 15317	. 2 ⊢ (𝜑 → ((𝐺 ∘ 𝐹)(⇝𝑡‘𝐾)(𝐺‘𝑃) ↔ ((𝐺 ∘ 𝐹) ∈ (∪ 𝐾 ↑pm ℂ) ∧ (𝐺‘𝑃) ∈ ∪ 𝐾 ∧ ∀𝑢 ∈ 𝐾 ((𝐺‘𝑃) ∈ 𝑢 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))))
85	35, 37, 83, 84	mpbir3and 1211	1 ⊢ (𝜑 → (𝐺 ∘ 𝐹)(⇝𝑡‘𝐾)(𝐺‘𝑃))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  Vcvv 2821   ⊆ wss 3220  ∪ cuni 3935   class class class wbr 4130  dom cdm 4774   “ cima 4777   ∘ ccom 4778   Fn wfn 5372  ⟶wf 5373  ‘cfv 5377  (class class class)co 6085   ↑_pm cpm 6923  ℂcc 8177  1c1 8180  ℕcn 9305  ℤ_≥cuz 9923  Topctop 15100  TopOnctopon 15113   CnP ccnp 15289  ⇝_𝑡clm 15290

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-map 6924  df-pm 6925  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9306  df-n0 9566  df-z 9647  df-uz 9924  df-top 15101  df-topon 15114  df-cnp 15292  df-lm 15293

This theorem is used by:  lmcn  15354