Theorem lmtopcnp 12458

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 12399	. . . . . . . 8 ⊢ (𝐹(⇝𝑡‘𝐽)𝑃 → 𝐽 ∈ Top)
3	1, 2	syl 14	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ Top)
4		toptopon2 12225	. . . . . . 7 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
5	3, 4	sylib 121	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘∪ 𝐽))
6		lmcnp.k	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ Top)
7		toptopon2 12225	. . . . . . 7 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
8	6, 7	sylib 121	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘∪ 𝐾))
9		lmcnp.4	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝑃))
10		cnpf2 12415	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝐺 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐺:∪ 𝐽⟶∪ 𝐾)
11	5, 8, 9, 10	syl3anc 1217	. . . . 5 ⊢ (𝜑 → 𝐺:∪ 𝐽⟶∪ 𝐾)
12		nnuz 9385	. . . . . . . . . 10 ⊢ ℕ = (ℤ≥‘1)
13		1zzd 9105	. . . . . . . . . 10 ⊢ (𝜑 → 1 ∈ ℤ)
14	5, 12, 13	lmbr2 12422	. . . . . . . . 9 ⊢ (𝜑 → (𝐹(⇝𝑡‘𝐽)𝑃 ↔ (𝐹 ∈ (∪ 𝐽 ↑pm ℂ) ∧ 𝑃 ∈ ∪ 𝐽 ∧ ∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)))))
15	1, 14	mpbid 146	. . . . . . . 8 ⊢ (𝜑 → (𝐹 ∈ (∪ 𝐽 ↑pm ℂ) ∧ 𝑃 ∈ ∪ 𝐽 ∧ ∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣))))
16	15	simp1d 994	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (∪ 𝐽 ↑pm ℂ))
17		uniexg 4369	. . . . . . . . 9 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ V)
18	3, 17	syl 14	. . . . . . . 8 ⊢ (𝜑 → ∪ 𝐽 ∈ V)
19		cnex 7768	. . . . . . . 8 ⊢ ℂ ∈ V
20		elpm2g 6567	. . . . . . . 8 ⊢ ((∪ 𝐽 ∈ V ∧ ℂ ∈ V) → (𝐹 ∈ (∪ 𝐽 ↑pm ℂ) ↔ (𝐹:dom 𝐹⟶∪ 𝐽 ∧ dom 𝐹 ⊆ ℂ)))
21	18, 19, 20	sylancl 410	. . . . . . 7 ⊢ (𝜑 → (𝐹 ∈ (∪ 𝐽 ↑pm ℂ) ↔ (𝐹:dom 𝐹⟶∪ 𝐽 ∧ dom 𝐹 ⊆ ℂ)))
22	16, 21	mpbid 146	. . . . . 6 ⊢ (𝜑 → (𝐹:dom 𝐹⟶∪ 𝐽 ∧ dom 𝐹 ⊆ ℂ))
23	22	simpld 111	. . . . 5 ⊢ (𝜑 → 𝐹:dom 𝐹⟶∪ 𝐽)
24		fco 5296	. . . . 5 ⊢ ((𝐺:∪ 𝐽⟶∪ 𝐾 ∧ 𝐹:dom 𝐹⟶∪ 𝐽) → (𝐺 ∘ 𝐹):dom 𝐹⟶∪ 𝐾)
25	11, 23, 24	syl2anc 409	. . . 4 ⊢ (𝜑 → (𝐺 ∘ 𝐹):dom 𝐹⟶∪ 𝐾)
26	25	fdmd 5287	. . . . 5 ⊢ (𝜑 → dom (𝐺 ∘ 𝐹) = dom 𝐹)
27	26	feq2d 5268	. . . 4 ⊢ (𝜑 → ((𝐺 ∘ 𝐹):dom (𝐺 ∘ 𝐹)⟶∪ 𝐾 ↔ (𝐺 ∘ 𝐹):dom 𝐹⟶∪ 𝐾))
28	25, 27	mpbird 166	. . 3 ⊢ (𝜑 → (𝐺 ∘ 𝐹):dom (𝐺 ∘ 𝐹)⟶∪ 𝐾)
29	22	simprd 113	. . . 4 ⊢ (𝜑 → dom 𝐹 ⊆ ℂ)
30	26, 29	eqsstrd 3138	. . 3 ⊢ (𝜑 → dom (𝐺 ∘ 𝐹) ⊆ ℂ)
31		uniexg 4369	. . . . 5 ⊢ (𝐾 ∈ Top → ∪ 𝐾 ∈ V)
32	6, 31	syl 14	. . . 4 ⊢ (𝜑 → ∪ 𝐾 ∈ V)
33		elpm2g 6567	. . . 4 ⊢ ((∪ 𝐾 ∈ V ∧ ℂ ∈ V) → ((𝐺 ∘ 𝐹) ∈ (∪ 𝐾 ↑pm ℂ) ↔ ((𝐺 ∘ 𝐹):dom (𝐺 ∘ 𝐹)⟶∪ 𝐾 ∧ dom (𝐺 ∘ 𝐹) ⊆ ℂ)))
34	32, 19, 33	sylancl 410	. . 3 ⊢ (𝜑 → ((𝐺 ∘ 𝐹) ∈ (∪ 𝐾 ↑pm ℂ) ↔ ((𝐺 ∘ 𝐹):dom (𝐺 ∘ 𝐹)⟶∪ 𝐾 ∧ dom (𝐺 ∘ 𝐹) ⊆ ℂ)))
35	28, 30, 34	mpbir2and 929	. 2 ⊢ (𝜑 → (𝐺 ∘ 𝐹) ∈ (∪ 𝐾 ↑pm ℂ))
36	15	simp2d 995	. . 3 ⊢ (𝜑 → 𝑃 ∈ ∪ 𝐽)
37	11, 36	ffvelrnd 5564	. 2 ⊢ (𝜑 → (𝐺‘𝑃) ∈ ∪ 𝐾)
38	15	simp3d 996	. . . . . 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 521	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → 𝑢 ∈ 𝐾)
45		simprr 522	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → (𝐺‘𝑃) ∈ 𝑢)
46		icnpimaex 12419	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝑃 ∈ ∪ 𝐽) ∧ (𝐺 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
47	40, 41, 42, 43, 44, 45, 46	syl33anc 1232	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
48		r19.29 2572	. . . . . . 7 ⊢ ((∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ∃𝑣 ∈ 𝐽 ((𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)))
49		pm3.45 587	. . . . . . . . 9 ⊢ ((𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) → ((𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢) → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢)))
50	49	imp 123	. . . . . . . 8 ⊢ (((𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
51	50	reximi 2532	. . . . . . 7 ⊢ (∃𝑣 ∈ 𝐽 ((𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ∃𝑣 ∈ 𝐽 (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
52	48, 51	syl 14	. . . . . 6 ⊢ ((∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ∃𝑣 ∈ 𝐽 (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢))
53	11	ad3antrrr 484	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝐺:∪ 𝐽⟶∪ 𝐾)
54	53	ffnd 5281	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝐺 Fn ∪ 𝐽)
55		simplrl 525	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝑣 ∈ 𝐽)
56		elssuni 3772	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑣 ∈ 𝐽 → 𝑣 ⊆ ∪ 𝐽)
57	55, 56	syl 14	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝑣 ⊆ ∪ 𝐽)
58		fnfvima 5660	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐺 Fn ∪ 𝐽 ∧ 𝑣 ⊆ ∪ 𝐽 ∧ (𝐹‘𝑘) ∈ 𝑣) → (𝐺‘(𝐹‘𝑘)) ∈ (𝐺 “ 𝑣))
59	58	3expia 1184	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐺 Fn ∪ 𝐽 ∧ 𝑣 ⊆ ∪ 𝐽) → ((𝐹‘𝑘) ∈ 𝑣 → (𝐺‘(𝐹‘𝑘)) ∈ (𝐺 “ 𝑣)))
60	54, 57, 59	syl2anc 409	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ∈ 𝑣 → (𝐺‘(𝐹‘𝑘)) ∈ (𝐺 “ 𝑣)))
61	23	ad2antrr 480	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → 𝐹:dom 𝐹⟶∪ 𝐽)
62		fvco3 5500	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹:dom 𝐹⟶∪ 𝐽 ∧ 𝑘 ∈ dom 𝐹) → ((𝐺 ∘ 𝐹)‘𝑘) = (𝐺‘(𝐹‘𝑘)))
63	61, 62	sylan 281	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐺 ∘ 𝐹)‘𝑘) = (𝐺‘(𝐹‘𝑘)))
64	63	eleq1d 2209	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → (((𝐺 ∘ 𝐹)‘𝑘) ∈ (𝐺 “ 𝑣) ↔ (𝐺‘(𝐹‘𝑘)) ∈ (𝐺 “ 𝑣)))
65	60, 64	sylibrd 168	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ∈ 𝑣 → ((𝐺 ∘ 𝐹)‘𝑘) ∈ (𝐺 “ 𝑣)))
66		simplrr 526	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → (𝐺 “ 𝑣) ⊆ 𝑢)
67	66	sseld 3101	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → (((𝐺 ∘ 𝐹)‘𝑘) ∈ (𝐺 “ 𝑣) → ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢))
68	65, 67	syld 45	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ∈ 𝑣 → ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢))
69		simpr 109	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝑘 ∈ dom 𝐹)
70	26	ad3antrrr 484	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → dom (𝐺 ∘ 𝐹) = dom 𝐹)
71	69, 70	eleqtrrd 2220	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → 𝑘 ∈ dom (𝐺 ∘ 𝐹))
72	68, 71	jctild 314	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ∈ 𝑣 → (𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
73	72	expimpd 361	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) → (𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
74	73	ralimdv 2503	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) ∧ (𝑣 ∈ 𝐽 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → (∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) → ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
75	74	reximdv 2536	. . . . . . . . . 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 2552	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → (∃𝑣 ∈ 𝐽 (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣) ∧ (𝐺 “ 𝑣) ⊆ 𝑢) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
80	52, 79	syl5 32	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ((∀𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑣)) ∧ ∃𝑣 ∈ 𝐽 (𝑃 ∈ 𝑣 ∧ (𝐺 “ 𝑣) ⊆ 𝑢)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
81	39, 47, 80	mp2and 430	. . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐾 ∧ (𝐺‘𝑃) ∈ 𝑢)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢))
82	81	expr 373	. . 3 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐾) → ((𝐺‘𝑃) ∈ 𝑢 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
83	82	ralrimiva 2508	. 2 ⊢ (𝜑 → ∀𝑢 ∈ 𝐾 ((𝐺‘𝑃) ∈ 𝑢 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))
84	8, 12, 13	lmbr2 12422	. 2 ⊢ (𝜑 → ((𝐺 ∘ 𝐹)(⇝𝑡‘𝐾)(𝐺‘𝑃) ↔ ((𝐺 ∘ 𝐹) ∈ (∪ 𝐾 ↑pm ℂ) ∧ (𝐺‘𝑃) ∈ ∪ 𝐾 ∧ ∀𝑢 ∈ 𝐾 ((𝐺‘𝑃) ∈ 𝑢 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑘 ∈ dom (𝐺 ∘ 𝐹) ∧ ((𝐺 ∘ 𝐹)‘𝑘) ∈ 𝑢)))))
85	35, 37, 83, 84	mpbir3and 1165	1 ⊢ (𝜑 → (𝐺 ∘ 𝐹)(⇝𝑡‘𝐾)(𝐺‘𝑃))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   ∧ w3a 963   = wceq 1332   ∈ wcel 1481  ∀wral 2417  ∃wrex 2418  Vcvv 2689   ⊆ wss 3076  ∪ cuni 3744   class class class wbr 3937  dom cdm 4547   “ cima 4550   ∘ ccom 4551   Fn wfn 5126  ⟶wf 5127  ‘cfv 5131  (class class class)co 5782   ↑_pm cpm 6551  ℂcc 7642  1c1 7645  ℕcn 8744  ℤ_≥cuz 9350  Topctop 12203  TopOnctopon 12216   CnP ccnp 12394  ⇝_𝑡clm 12395

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 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4051  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-cnex 7735  ax-resscn 7736  ax-1cn 7737  ax-1re 7738  ax-icn 7739  ax-addcl 7740  ax-addrcl 7741  ax-mulcl 7742  ax-addcom 7744  ax-addass 7746  ax-distr 7748  ax-i2m1 7749  ax-0lt1 7750  ax-0id 7752  ax-rnegex 7753  ax-cnre 7755  ax-pre-ltirr 7756  ax-pre-ltwlin 7757  ax-pre-lttrn 7758  ax-pre-apti 7759  ax-pre-ltadd 7760

This theorem depends on definitions:  df-bi 116  df-dc 821  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-nel 2405  df-ral 2422  df-rex 2423  df-reu 2424  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-if 3480  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-int 3780  df-iun 3823  df-br 3938  df-opab 3998  df-mpt 3999  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-riota 5738  df-ov 5785  df-oprab 5786  df-mpo 5787  df-1st 6046  df-2nd 6047  df-map 6552  df-pm 6553  df-pnf 7826  df-mnf 7827  df-xr 7828  df-ltxr 7829  df-le 7830  df-sub 7959  df-neg 7960  df-inn 8745  df-n0 9002  df-z 9079  df-uz 9351  df-top 12204  df-topon 12217  df-cnp 12397  df-lm 12398

This theorem is referenced by:  lmcn  12459