Theorem lmflf 23940

Description: The topological limit relation on functions can be written in terms of the filter limit along the filter generated by the upper integer sets. (Contributed by Mario Carneiro, 13-Oct-2015.)

Hypotheses

Ref	Expression
lmflf.1	⊢ 𝑍 = (ℤ≥‘𝑀)
lmflf.2	⊢ 𝐿 = (𝑍filGen(ℤ≥ “ 𝑍))

Assertion

Ref	Expression
lmflf	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) → (𝐹(⇝𝑡‘𝐽)𝑃 ↔ 𝑃 ∈ ((𝐽 fLimf 𝐿)‘𝐹)))

Proof of Theorem lmflf

Dummy variables 𝑗 𝑘 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		uzf 12745	. . . . . . . 8 ⊢ ℤ≥:ℤ⟶𝒫 ℤ
2		ffn 6659	. . . . . . . 8 ⊢ (ℤ≥:ℤ⟶𝒫 ℤ → ℤ≥ Fn ℤ)
3	1, 2	ax-mp 5	. . . . . . 7 ⊢ ℤ≥ Fn ℤ
4		lmflf.1	. . . . . . . 8 ⊢ 𝑍 = (ℤ≥‘𝑀)
5		uzssz 12763	. . . . . . . 8 ⊢ (ℤ≥‘𝑀) ⊆ ℤ
6	4, 5	eqsstri 3977	. . . . . . 7 ⊢ 𝑍 ⊆ ℤ
7		imaeq2 6012	. . . . . . . . 9 ⊢ (𝑦 = (ℤ≥‘𝑗) → (𝐹 “ 𝑦) = (𝐹 “ (ℤ≥‘𝑗)))
8	7	sseq1d 3962	. . . . . . . 8 ⊢ (𝑦 = (ℤ≥‘𝑗) → ((𝐹 “ 𝑦) ⊆ 𝑥 ↔ (𝐹 “ (ℤ≥‘𝑗)) ⊆ 𝑥))
9	8	rexima 7181	. . . . . . 7 ⊢ ((ℤ≥ Fn ℤ ∧ 𝑍 ⊆ ℤ) → (∃𝑦 ∈ (ℤ≥ “ 𝑍)(𝐹 “ 𝑦) ⊆ 𝑥 ↔ ∃𝑗 ∈ 𝑍 (𝐹 “ (ℤ≥‘𝑗)) ⊆ 𝑥))
10	3, 6, 9	mp2an 692	. . . . . 6 ⊢ (∃𝑦 ∈ (ℤ≥ “ 𝑍)(𝐹 “ 𝑦) ⊆ 𝑥 ↔ ∃𝑗 ∈ 𝑍 (𝐹 “ (ℤ≥‘𝑗)) ⊆ 𝑥)
11		simpl3 1194	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) ∧ 𝑗 ∈ 𝑍) → 𝐹:𝑍⟶𝑋)
12	11	ffund 6663	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) ∧ 𝑗 ∈ 𝑍) → Fun 𝐹)
13		uzss 12765	. . . . . . . . . . 11 ⊢ (𝑗 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝑗) ⊆ (ℤ≥‘𝑀))
14	13, 4	eleq2s 2851	. . . . . . . . . 10 ⊢ (𝑗 ∈ 𝑍 → (ℤ≥‘𝑗) ⊆ (ℤ≥‘𝑀))
15	14	adantl 481	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) ∧ 𝑗 ∈ 𝑍) → (ℤ≥‘𝑗) ⊆ (ℤ≥‘𝑀))
16	11	fdmd 6669	. . . . . . . . . 10 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) ∧ 𝑗 ∈ 𝑍) → dom 𝐹 = 𝑍)
17	16, 4	eqtrdi 2784	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) ∧ 𝑗 ∈ 𝑍) → dom 𝐹 = (ℤ≥‘𝑀))
18	15, 17	sseqtrrd 3968	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) ∧ 𝑗 ∈ 𝑍) → (ℤ≥‘𝑗) ⊆ dom 𝐹)
19		funimass4 6895	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ (ℤ≥‘𝑗) ⊆ dom 𝐹) → ((𝐹 “ (ℤ≥‘𝑗)) ⊆ 𝑥 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐹‘𝑘) ∈ 𝑥))
20	12, 18, 19	syl2anc 584	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) ∧ 𝑗 ∈ 𝑍) → ((𝐹 “ (ℤ≥‘𝑗)) ⊆ 𝑥 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐹‘𝑘) ∈ 𝑥))
21	20	rexbidva 3155	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) → (∃𝑗 ∈ 𝑍 (𝐹 “ (ℤ≥‘𝑗)) ⊆ 𝑥 ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐹‘𝑘) ∈ 𝑥))
22	10, 21	bitr2id 284	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐹‘𝑘) ∈ 𝑥 ↔ ∃𝑦 ∈ (ℤ≥ “ 𝑍)(𝐹 “ 𝑦) ⊆ 𝑥))
23	22	imbi2d 340	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) → ((𝑃 ∈ 𝑥 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐹‘𝑘) ∈ 𝑥) ↔ (𝑃 ∈ 𝑥 → ∃𝑦 ∈ (ℤ≥ “ 𝑍)(𝐹 “ 𝑦) ⊆ 𝑥)))
24	23	ralbidv 3156	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) → (∀𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐹‘𝑘) ∈ 𝑥) ↔ ∀𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 → ∃𝑦 ∈ (ℤ≥ “ 𝑍)(𝐹 “ 𝑦) ⊆ 𝑥)))
25	24	anbi2d 630	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) → ((𝑃 ∈ 𝑋 ∧ ∀𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐹‘𝑘) ∈ 𝑥)) ↔ (𝑃 ∈ 𝑋 ∧ ∀𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 → ∃𝑦 ∈ (ℤ≥ “ 𝑍)(𝐹 “ 𝑦) ⊆ 𝑥))))
26		simp1 1136	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) → 𝐽 ∈ (TopOn‘𝑋))
27		simp2 1137	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) → 𝑀 ∈ ℤ)
28		simp3 1138	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) → 𝐹:𝑍⟶𝑋)
29		eqidd 2734	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = (𝐹‘𝑘))
30	26, 4, 27, 28, 29	lmbrf 23195	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) → (𝐹(⇝𝑡‘𝐽)𝑃 ↔ (𝑃 ∈ 𝑋 ∧ ∀𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐹‘𝑘) ∈ 𝑥))))
31	4	uzfbas 23833	. . 3 ⊢ (𝑀 ∈ ℤ → (ℤ≥ “ 𝑍) ∈ (fBas‘𝑍))
32		lmflf.2	. . . 4 ⊢ 𝐿 = (𝑍filGen(ℤ≥ “ 𝑍))
33	32	flffbas 23930	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (ℤ≥ “ 𝑍) ∈ (fBas‘𝑍) ∧ 𝐹:𝑍⟶𝑋) → (𝑃 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ (𝑃 ∈ 𝑋 ∧ ∀𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 → ∃𝑦 ∈ (ℤ≥ “ 𝑍)(𝐹 “ 𝑦) ⊆ 𝑥))))
34	31, 33	syl3an2 1164	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) → (𝑃 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ (𝑃 ∈ 𝑋 ∧ ∀𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 → ∃𝑦 ∈ (ℤ≥ “ 𝑍)(𝐹 “ 𝑦) ⊆ 𝑥))))
35	25, 30, 34	3bitr4d 311	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ ℤ ∧ 𝐹:𝑍⟶𝑋) → (𝐹(⇝𝑡‘𝐽)𝑃 ↔ 𝑃 ∈ ((𝐽 fLimf 𝐿)‘𝐹)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∀wral 3048  ∃wrex 3057   ⊆ wss 3898  𝒫 cpw 4551   class class class wbr 5095  dom cdm 5621   “ cima 5624  Fun wfun 6483   Fn wfn 6484  ⟶wf 6485  ‘cfv 6489  (class class class)co 7355  ℤcz 12479  ℤ_≥cuz 12742  fBascfbas 21288  filGencfg 21289  TopOnctopon 22845  ⇝_𝑡clm 23161   fLimf cflf 23870

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677  ax-cnex 11073  ax-resscn 11074  ax-1cn 11075  ax-icn 11076  ax-addcl 11077  ax-addrcl 11078  ax-mulcl 11079  ax-mulrcl 11080  ax-i2m1 11085  ax-1ne0 11086  ax-rrecex 11089  ax-cnre 11090  ax-pre-lttri 11091  ax-pre-lttrn 11092

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-om 7806  df-1st 7930  df-2nd 7931  df-frecs 8220  df-wrecs 8251  df-recs 8300  df-rdg 8338  df-er 8631  df-map 8761  df-pm 8762  df-en 8880  df-dom 8881  df-sdom 8882  df-pnf 11159  df-mnf 11160  df-xr 11161  df-ltxr 11162  df-le 11163  df-neg 11358  df-nn 12137  df-z 12480  df-uz 12743  df-rest 17333  df-fbas 21297  df-fg 21298  df-top 22829  df-topon 22846  df-ntr 22955  df-nei 23033  df-lm 23164  df-fil 23781  df-fm 23873  df-flim 23874  df-flf 23875

This theorem is referenced by:  cmetcaulem  25235