Theorem lmtopcnp 14932

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 14874	. . . . . . . 8 ⊢ (𝐹(⇝𝑡‘𝐽)𝑃 → 𝐽 ∈ Top)
3	1, 2	syl 14	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ Top)
4		toptopon2 14701	. . . . . . 7 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
5	3, 4	sylib 122	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘∪ 𝐽))
6		lmcnp.k	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ Top)
7		toptopon2 14701	. . . . . . 7 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
8	6, 7	sylib 122	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘∪ 𝐾))
9		lmcnp.4	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝑃))
10		cnpf2 14889	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐺:∪ 𝐽⟶∪ 𝐾)
11	5, 8, 9, 10	syl3anc 1271	. . . . 5 ⊢ (𝜑 → 𝐺:∪ 𝐽⟶∪ 𝐾)
12		nnuz 9766	. . . . . . . . . 10 ⊢ ℕ = (ℤ≥‘1)
13		1zzd 9481	. . . . . . . . . 10 ⊢ (𝜑 → 1 ∈ ℤ)
14	5, 12, 13	lmbr2 14896	. . . . . . . . 9 ⊢ (𝜑 → (𝐹(⇝𝑡‘𝐽)𝑃 ↔ (𝐹 ∈ (∪ 𝐽 ↑pm ℂ) ∧ 𝑃 ∈ ∪ 𝐽 ∧ ∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)))))
15	1, 14	mpbid 147	. . . . . . . 8 ⊢ (𝜑 → (𝐹 ∈ (∪ 𝐽 ↑pm ℂ) ∧ 𝑃 ∈ ∪ 𝐽 ∧ ∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣))))
16	15	simp1d 1033	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (∪ 𝐽 ↑pm ℂ))
17		uniexg 4530	. . . . . . . . 9 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ V)
18	3, 17	syl 14	. . . . . . . 8 ⊢ (𝜑 → ∪ 𝐽 ∈ V)
19		cnex 8131	. . . . . . . 8 ⊢ ℂ ∈ V
20		elpm2g 6820	. . . . . . . 8 ⊢ ((∪ 𝐽 ∈ V ∧ ℂ ∈ V) → (𝐹 ∈ (∪ 𝐽 ↑pm ℂ) ↔ (𝐹:dom 𝐹⟶∪ 𝐽 ∧ dom 𝐹 ⊆ ℂ)))
21	18, 19, 20	sylancl 413	. . . . . . 7 ⊢ (𝜑 → (𝐹 ∈ (∪ 𝐽 ↑pm ℂ) ↔ (𝐹:dom 𝐹⟶∪ 𝐽 ∧ dom 𝐹 ⊆ ℂ)))
22	16, 21	mpbid 147	. . . . . 6 ⊢ (𝜑 → (𝐹:dom 𝐹⟶∪ 𝐽 ∧ dom 𝐹 ⊆ ℂ))
23	22	simpld 112	. . . . 5 ⊢ (𝜑 → 𝐹:dom 𝐹⟶∪ 𝐽)
24		fco 5491	. . . . 5 ⊢ ((𝐺:∪ 𝐽⟶∪ 𝐾 ∧ 𝐹:dom 𝐹⟶∪ 𝐽) → (𝐺 ∘ 𝐹):dom 𝐹⟶∪ 𝐾)
25	11, 23, 24	syl2anc 411	. . . 4 ⊢ (𝜑 → (𝐺 ∘ 𝐹):dom 𝐹⟶∪ 𝐾)
26	25	fdmd 5480	. . . . 5 ⊢ (𝜑 → dom (𝐺 ∘ 𝐹) = dom 𝐹)
27	26	feq2d 5461	. . . 4 ⊢ (𝜑 → ((𝐺 ∘ 𝐹):dom (𝐺 ∘ 𝐹)⟶∪ 𝐾 ↔ (𝐺 ∘ 𝐹):dom 𝐹⟶∪ 𝐾))
28	25, 27	mpbird 167	. . 3 ⊢ (𝜑 → (𝐺 ∘ 𝐹):dom (𝐺 ∘ 𝐹)⟶∪ 𝐾)
29	22	simprd 114	. . . 4 ⊢ (𝜑 → dom 𝐹 ⊆ ℂ)
30	26, 29	eqsstrd 3260	. . 3 ⊢ (𝜑 → dom (𝐺 ∘ 𝐹) ⊆ ℂ)
31		uniexg 4530	. . . . 5 ⊢ (𝐾 ∈ Top → ∪ 𝐾 ∈ V)
32	6, 31	syl 14	. . . 4 ⊢ (𝜑 → ∪ 𝐾 ∈ V)
33		elpm2g 6820	. . . 4 ⊢ ((∪ 𝐾 ∈ V ∧ ℂ ∈ V) → ((𝐺 ∘ 𝐹) ∈ (∪ 𝐾 ↑pm ℂ) ↔ ((𝐺 ∘ 𝐹):dom (𝐺 ∘ 𝐹)⟶∪ 𝐾 ∧ dom (𝐺 ∘ 𝐹) ⊆ ℂ)))
34	32, 19, 33	sylancl 413	. . 3 ⊢ (𝜑 → ((𝐺 ∘ 𝐹) ∈ (∪ 𝐾 ↑pm ℂ) ↔ ((𝐺 ∘ 𝐹):dom (𝐺 ∘ 𝐹)⟶∪ 𝐾 ∧ dom (𝐺 ∘ 𝐹) ⊆ ℂ)))
35	28, 30, 34	mpbir2and 950	. 2 ⊢ (𝜑 → (𝐺 ∘ 𝐹) ∈ (∪ 𝐾 ↑pm ℂ))
36	15	simp2d 1034	. . 3 ⊢ (𝜑 → 𝑃 ∈ ∪ 𝐽)
37	11, 36	ffvelcdmd 5773	. 2 ⊢ (𝜑 → (𝐺‘𝑃) ∈ ∪ 𝐾)
38	15	simp3d 1035	. . . . . 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 529	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → 𝑢 ∈ 𝐾)
45		simprr 531	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → (𝐺‘𝑃) ∈ 𝑢)
46		icnpimaex 14893	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝑃 ∈ ∪ 𝐽) ∧ (𝐺 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
47	40, 41, 42, 43, 44, 45, 46	syl33anc 1286	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
48		r19.29 2668	. . . . . . 7 ⊢ ((∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ∃𝑣 ∈ 𝐽 ((𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)))
49		pm3.45 599	. . . . . . . . 9 ⊢ ((𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) → ((𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢) → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢)))
50	49	imp 124	. . . . . . . 8 ⊢ (((𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
51	50	reximi 2627	. . . . . . 7 ⊢ (∃𝑣 ∈ 𝐽 ((𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ∃𝑣 ∈ 𝐽 (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
52	48, 51	syl 14	. . . . . 6 ⊢ ((∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ∃𝑣 ∈ 𝐽 (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
53	11	ad3antrrr 492	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝐺:∪ 𝐽⟶∪ 𝐾)
54	53	ffnd 5474	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝐺 Fn ∪ 𝐽)
55		simplrl 535	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝑣 ∈ 𝐽)
56		elssuni 3916	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑣 ∈ 𝐽 → 𝑣 ⊆ ∪ 𝐽)
57	55, 56	syl 14	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝑣 ⊆ ∪ 𝐽)
58		fnfvima 5878	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐺 Fn ∪ 𝐽 ∧ 𝑣 ⊆ ∪ 𝐽 ∧ (𝐹‘𝑘) ∈ 𝑣) → (𝐺‘(𝐹‘𝑘)) ∈ (𝐺 “ 𝑣))
59	58	3expia 1229	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐺 Fn ∪ 𝐽 ∧ 𝑣 ⊆ ∪ 𝐽) → ((𝐹‘𝑘) ∈ 𝑣 → (𝐺‘(𝐹‘𝑘)) ∈ (𝐺 “ 𝑣)))
60	54, 57, 59	syl2anc 411	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ∈ 𝑣 → (𝐺‘(𝐹‘𝑘)) ∈ (𝐺 “ 𝑣)))
61	23	ad2antrr 488	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → 𝐹:dom 𝐹⟶∪ 𝐽)
62		fvco3 5707	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹:dom 𝐹⟶∪ 𝐽 ∧ 𝑘 ∈ dom 𝐹) → ((𝐺 ∘ 𝐹)‘𝑘) = (𝐺‘(𝐹‘𝑘)))
63	61, 62	sylan 283	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐺 ∘ 𝐹)‘𝑘) = (𝐺‘(𝐹‘𝑘)))
64	63	eleq1d 2298	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → (((𝐺 ∘ 𝐹)‘𝑘) ∈ (𝐺 “ 𝑣) ↔ (𝐺‘(𝐹‘𝑘)) ∈ (𝐺 “ 𝑣)))
65	60, 64	sylibrd 169	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ∈ 𝑣 → ((𝐺 ∘ 𝐹)‘𝑘) ∈ (𝐺 “ 𝑣)))
66		simplrr 536	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → (𝐺 “ 𝑣) ⊆ 𝑢)
67	66	sseld 3223	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → (((𝐺 ∘ 𝐹)‘𝑘) ∈ (𝐺 “ 𝑣) → ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢))
68	65, 67	syld 45	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ∈ 𝑣 → ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢))
69		simpr 110	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝑘 ∈ dom 𝐹)
70	26	ad3antrrr 492	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → dom (𝐺 ∘ 𝐹) = dom 𝐹)
71	69, 70	eleqtrrd 2309	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝑘 ∈ dom (𝐺 ∘ 𝐹))
72	68, 71	jctild 316	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ∈ 𝑣 → (𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
73	72	expimpd 363	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) → (𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
74	73	ralimdv 2598	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → (∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) → ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
75	74	reximdv 2631	. . . . . . . . . 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 2648	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → (∃𝑣 ∈ 𝐽 (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
80	52, 79	syl5 32	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ((∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
81	39, 47, 80	mp2and 433	. . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢))
82	81	expr 375	. . 3 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐾) → ((𝐺‘𝑃) ∈ 𝑢 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
83	82	ralrimiva 2603	. 2 ⊢ (𝜑 → ∀𝑢 ∈ 𝐾 ((𝐺‘𝑃) ∈ 𝑢 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
84	8, 12, 13	lmbr2 14896	. 2 ⊢ (𝜑 → ((𝐺 ∘ 𝐹)(⇝𝑡‘𝐾)(𝐺‘𝑃) ↔ ((𝐺 ∘ 𝐹) ∈ (∪ 𝐾 ↑pm ℂ) ∧ (𝐺‘𝑃) ∈ ∪ 𝐾 ∧ ∀𝑢 ∈ 𝐾 ((𝐺‘𝑃) ∈ 𝑢 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))))
85	35, 37, 83, 84	mpbir3and 1204	1 ⊢ (𝜑 → (𝐺 ∘ 𝐹)(⇝𝑡‘𝐾)(𝐺‘𝑃))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1002   = wceq 1395   ∈ wcel 2200  ∀wral 2508  ∃wrex 2509  Vcvv 2799   ⊆ wss 3197  ∪ cuni 3888   class class class wbr 4083  dom cdm 4719   “ cima 4722   ∘ ccom 4723   Fn wfn 5313  ⟶wf 5314  ‘cfv 5318  (class class class)co 6007   ↑_pm cpm 6804  ℂcc 8005  1c1 8008  ℕcn 9118  ℤ_≥cuz 9730  Topctop 14679  TopOnctopon 14692   CnP ccnp 14868  ⇝_𝑡clm 14869

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8098  ax-resscn 8099  ax-1cn 8100  ax-1re 8101  ax-icn 8102  ax-addcl 8103  ax-addrcl 8104  ax-mulcl 8105  ax-addcom 8107  ax-addass 8109  ax-distr 8111  ax-i2m1 8112  ax-0lt1 8113  ax-0id 8115  ax-rnegex 8116  ax-cnre 8118  ax-pre-ltirr 8119  ax-pre-ltwlin 8120  ax-pre-lttrn 8121  ax-pre-apti 8122  ax-pre-ltadd 8123

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1st 6292  df-2nd 6293  df-map 6805  df-pm 6806  df-pnf 8191  df-mnf 8192  df-xr 8193  df-ltxr 8194  df-le 8195  df-sub 8327  df-neg 8328  df-inn 9119  df-n0 9378  df-z 9455  df-uz 9731  df-top 14680  df-topon 14693  df-cnp 14871  df-lm 14872

This theorem is referenced by:  lmcn  14933