Theorem lmtopcnp 13044

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 12985	. . . . . . . 8 ⊢ (𝐹(⇝𝑡‘𝐽)𝑃 → 𝐽 ∈ Top)
3	1, 2	syl 14	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ Top)
4		toptopon2 12811	. . . . . . 7 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
5	3, 4	sylib 121	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘∪ 𝐽))
6		lmcnp.k	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ Top)
7		toptopon2 12811	. . . . . . 7 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
8	6, 7	sylib 121	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘∪ 𝐾))
9		lmcnp.4	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝑃))
10		cnpf2 13001	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐺:∪ 𝐽⟶∪ 𝐾)
11	5, 8, 9, 10	syl3anc 1233	. . . . 5 ⊢ (𝜑 → 𝐺:∪ 𝐽⟶∪ 𝐾)
12		nnuz 9522	. . . . . . . . . 10 ⊢ ℕ = (ℤ≥‘1)
13		1zzd 9239	. . . . . . . . . 10 ⊢ (𝜑 → 1 ∈ ℤ)
14	5, 12, 13	lmbr2 13008	. . . . . . . . 9 ⊢ (𝜑 → (𝐹(⇝𝑡‘𝐽)𝑃 ↔ (𝐹 ∈ (∪ 𝐽 ↑pm ℂ) ∧ 𝑃 ∈ ∪ 𝐽 ∧ ∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)))))
15	1, 14	mpbid 146	. . . . . . . 8 ⊢ (𝜑 → (𝐹 ∈ (∪ 𝐽 ↑pm ℂ) ∧ 𝑃 ∈ ∪ 𝐽 ∧ ∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣))))
16	15	simp1d 1004	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (∪ 𝐽 ↑pm ℂ))
17		uniexg 4424	. . . . . . . . 9 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ V)
18	3, 17	syl 14	. . . . . . . 8 ⊢ (𝜑 → ∪ 𝐽 ∈ V)
19		cnex 7898	. . . . . . . 8 ⊢ ℂ ∈ V
20		elpm2g 6643	. . . . . . . 8 ⊢ ((∪ 𝐽 ∈ V ∧ ℂ ∈ V) → (𝐹 ∈ (∪ 𝐽 ↑pm ℂ) ↔ (𝐹:dom 𝐹⟶∪ 𝐽 ∧ dom 𝐹 ⊆ ℂ)))
21	18, 19, 20	sylancl 411	. . . . . . 7 ⊢ (𝜑 → (𝐹 ∈ (∪ 𝐽 ↑pm ℂ) ↔ (𝐹:dom 𝐹⟶∪ 𝐽 ∧ dom 𝐹 ⊆ ℂ)))
22	16, 21	mpbid 146	. . . . . 6 ⊢ (𝜑 → (𝐹:dom 𝐹⟶∪ 𝐽 ∧ dom 𝐹 ⊆ ℂ))
23	22	simpld 111	. . . . 5 ⊢ (𝜑 → 𝐹:dom 𝐹⟶∪ 𝐽)
24		fco 5363	. . . . 5 ⊢ ((𝐺:∪ 𝐽⟶∪ 𝐾 ∧ 𝐹:dom 𝐹⟶∪ 𝐽) → (𝐺 ∘ 𝐹):dom 𝐹⟶∪ 𝐾)
25	11, 23, 24	syl2anc 409	. . . 4 ⊢ (𝜑 → (𝐺 ∘ 𝐹):dom 𝐹⟶∪ 𝐾)
26	25	fdmd 5354	. . . . 5 ⊢ (𝜑 → dom (𝐺 ∘ 𝐹) = dom 𝐹)
27	26	feq2d 5335	. . . 4 ⊢ (𝜑 → ((𝐺 ∘ 𝐹):dom (𝐺 ∘ 𝐹)⟶∪ 𝐾 ↔ (𝐺 ∘ 𝐹):dom 𝐹⟶∪ 𝐾))
28	25, 27	mpbird 166	. . 3 ⊢ (𝜑 → (𝐺 ∘ 𝐹):dom (𝐺 ∘ 𝐹)⟶∪ 𝐾)
29	22	simprd 113	. . . 4 ⊢ (𝜑 → dom 𝐹 ⊆ ℂ)
30	26, 29	eqsstrd 3183	. . 3 ⊢ (𝜑 → dom (𝐺 ∘ 𝐹) ⊆ ℂ)
31		uniexg 4424	. . . . 5 ⊢ (𝐾 ∈ Top → ∪ 𝐾 ∈ V)
32	6, 31	syl 14	. . . 4 ⊢ (𝜑 → ∪ 𝐾 ∈ V)
33		elpm2g 6643	. . . 4 ⊢ ((∪ 𝐾 ∈ V ∧ ℂ ∈ V) → ((𝐺 ∘ 𝐹) ∈ (∪ 𝐾 ↑pm ℂ) ↔ ((𝐺 ∘ 𝐹):dom (𝐺 ∘ 𝐹)⟶∪ 𝐾 ∧ dom (𝐺 ∘ 𝐹) ⊆ ℂ)))
34	32, 19, 33	sylancl 411	. . 3 ⊢ (𝜑 → ((𝐺 ∘ 𝐹) ∈ (∪ 𝐾 ↑pm ℂ) ↔ ((𝐺 ∘ 𝐹):dom (𝐺 ∘ 𝐹)⟶∪ 𝐾 ∧ dom (𝐺 ∘ 𝐹) ⊆ ℂ)))
35	28, 30, 34	mpbir2and 939	. 2 ⊢ (𝜑 → (𝐺 ∘ 𝐹) ∈ (∪ 𝐾 ↑pm ℂ))
36	15	simp2d 1005	. . 3 ⊢ (𝜑 → 𝑃 ∈ ∪ 𝐽)
37	11, 36	ffvelrnd 5632	. 2 ⊢ (𝜑 → (𝐺‘𝑃) ∈ ∪ 𝐾)
38	15	simp3d 1006	. . . . . 6 ⊢ (𝜑 → ∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)))
39	38	adantr 274	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)))
40	5	adantr 274	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → 𝐽 ∈ (TopOn‘∪ 𝐽))
41	8	adantr 274	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → 𝐾 ∈ (TopOn‘∪ 𝐾))
42	36	adantr 274	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → 𝑃 ∈ ∪ 𝐽)
43	9	adantr 274	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝑃))
44		simprl 526	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → 𝑢 ∈ 𝐾)
45		simprr 527	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → (𝐺‘𝑃) ∈ 𝑢)
46		icnpimaex 13005	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝑃 ∈ ∪ 𝐽) ∧ (𝐺 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
47	40, 41, 42, 43, 44, 45, 46	syl33anc 1248	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
48		r19.29 2607	. . . . . . 7 ⊢ ((∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ∃𝑣 ∈ 𝐽 ((𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)))
49		pm3.45 592	. . . . . . . . 9 ⊢ ((𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) → ((𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢) → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢)))
50	49	imp 123	. . . . . . . 8 ⊢ (((𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
51	50	reximi 2567	. . . . . . 7 ⊢ (∃𝑣 ∈ 𝐽 ((𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ∃𝑣 ∈ 𝐽 (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
52	48, 51	syl 14	. . . . . 6 ⊢ ((∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ∃𝑣 ∈ 𝐽 (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
53	11	ad3antrrr 489	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝐺:∪ 𝐽⟶∪ 𝐾)
54	53	ffnd 5348	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝐺 Fn ∪ 𝐽)
55		simplrl 530	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝑣 ∈ 𝐽)
56		elssuni 3824	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑣 ∈ 𝐽 → 𝑣 ⊆ ∪ 𝐽)
57	55, 56	syl 14	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝑣 ⊆ ∪ 𝐽)
58		fnfvima 5730	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐺 Fn ∪ 𝐽 ∧ 𝑣 ⊆ ∪ 𝐽 ∧ (𝐹‘𝑘) ∈ 𝑣) → (𝐺‘(𝐹‘𝑘)) ∈ (𝐺 “ 𝑣))
59	58	3expia 1200	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐺 Fn ∪ 𝐽 ∧ 𝑣 ⊆ ∪ 𝐽) → ((𝐹‘𝑘) ∈ 𝑣 → (𝐺‘(𝐹‘𝑘)) ∈ (𝐺 “ 𝑣)))
60	54, 57, 59	syl2anc 409	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ∈ 𝑣 → (𝐺‘(𝐹‘𝑘)) ∈ (𝐺 “ 𝑣)))
61	23	ad2antrr 485	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → 𝐹:dom 𝐹⟶∪ 𝐽)
62		fvco3 5567	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹:dom 𝐹⟶∪ 𝐽 ∧ 𝑘 ∈ dom 𝐹) → ((𝐺 ∘ 𝐹)‘𝑘) = (𝐺‘(𝐹‘𝑘)))
63	61, 62	sylan 281	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐺 ∘ 𝐹)‘𝑘) = (𝐺‘(𝐹‘𝑘)))
64	63	eleq1d 2239	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → (((𝐺 ∘ 𝐹)‘𝑘) ∈ (𝐺 “ 𝑣) ↔ (𝐺‘(𝐹‘𝑘)) ∈ (𝐺 “ 𝑣)))
65	60, 64	sylibrd 168	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ∈ 𝑣 → ((𝐺 ∘ 𝐹)‘𝑘) ∈ (𝐺 “ 𝑣)))
66		simplrr 531	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → (𝐺 “ 𝑣) ⊆ 𝑢)
67	66	sseld 3146	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → (((𝐺 ∘ 𝐹)‘𝑘) ∈ (𝐺 “ 𝑣) → ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢))
68	65, 67	syld 45	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ∈ 𝑣 → ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢))
69		simpr 109	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝑘 ∈ dom 𝐹)
70	26	ad3antrrr 489	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → dom (𝐺 ∘ 𝐹) = dom 𝐹)
71	69, 70	eleqtrrd 2250	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝑘 ∈ dom (𝐺 ∘ 𝐹))
72	68, 71	jctild 314	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ∈ 𝑣 → (𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
73	72	expimpd 361	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) → (𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
74	73	ralimdv 2538	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → (∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) → ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
75	74	reximdv 2571	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
76	75	expr 373	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ 𝑣 ∈ 𝐽) → ((𝐺 “ 𝑣) ⊆ 𝑢 → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢))))
77	76	com23 78	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ 𝑣 ∈ 𝐽) → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) → ((𝐺 “ 𝑣) ⊆ 𝑢 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢))))
78	77	impd 252	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ 𝑣 ∈ 𝐽) → ((∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
79	78	rexlimdva 2587	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → (∃𝑣 ∈ 𝐽 (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
80	52, 79	syl5 32	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ((∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
81	39, 47, 80	mp2and 431	. . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢))
82	81	expr 373	. . 3 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐾) → ((𝐺‘𝑃) ∈ 𝑢 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
83	82	ralrimiva 2543	. 2 ⊢ (𝜑 → ∀𝑢 ∈ 𝐾 ((𝐺‘𝑃) ∈ 𝑢 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
84	8, 12, 13	lmbr2 13008	. 2 ⊢ (𝜑 → ((𝐺 ∘ 𝐹)(⇝𝑡‘𝐾)(𝐺‘𝑃) ↔ ((𝐺 ∘ 𝐹) ∈ (∪ 𝐾 ↑pm ℂ) ∧ (𝐺‘𝑃) ∈ ∪ 𝐾 ∧ ∀𝑢 ∈ 𝐾 ((𝐺‘𝑃) ∈ 𝑢 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))))
85	35, 37, 83, 84	mpbir3and 1175	1 ⊢ (𝜑 → (𝐺 ∘ 𝐹)(⇝𝑡‘𝐾)(𝐺‘𝑃))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   ∧ w3a 973   = wceq 1348   ∈ wcel 2141  ∀wral 2448  ∃wrex 2449  Vcvv 2730   ⊆ wss 3121  ∪ cuni 3796   class class class wbr 3989  dom cdm 4611   “ cima 4614   ∘ ccom 4615   Fn wfn 5193  ⟶wf 5194  ‘cfv 5198  (class class class)co 5853   ↑_pm cpm 6627  ℂcc 7772  1c1 7775  ℕcn 8878  ℤ_≥cuz 9487  Topctop 12789  TopOnctopon 12802   CnP ccnp 12980  ⇝_𝑡clm 12981

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-addcom 7874  ax-addass 7876  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-0id 7882  ax-rnegex 7883  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-apti 7889  ax-pre-ltadd 7890

This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-if 3527  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-map 6628  df-pm 6629  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093  df-inn 8879  df-n0 9136  df-z 9213  df-uz 9488  df-top 12790  df-topon 12803  df-cnp 12983  df-lm 12984

This theorem is referenced by:  lmcn  13045