Theorem flimcf 23960

Description: Fineness is properly characterized by the property that every limit point of a filter in the finer topology is a limit point in the coarser topology. (Contributed by Jeff Hankins, 28-Sep-2009.) (Revised by Mario Carneiro, 23-Aug-2015.)

Assertion

Ref	Expression
flimcf	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) → (𝐽 ⊆ 𝐾 ↔ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)))

Distinct variable groups:   𝑓,𝐽   𝑓,𝐾   𝑓,𝑋

Proof of Theorem flimcf

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

Step	Hyp	Ref	Expression
1		simplll 775	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ (𝐾 fLim 𝑓))) → 𝐽 ∈ (TopOn‘𝑋))
2		simprl 771	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ (𝐾 fLim 𝑓))) → 𝑓 ∈ (Fil‘𝑋))
3		simplr 769	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ (𝐾 fLim 𝑓))) → 𝐽 ⊆ 𝐾)
4		flimss1 23951	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑓 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓))
5	1, 2, 3, 4	syl3anc 1374	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ (𝐾 fLim 𝑓))) → (𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓))
6		simprr 773	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ (𝐾 fLim 𝑓))) → 𝑥 ∈ (𝐾 fLim 𝑓))
7	5, 6	sseldd 3923	. . . . 5 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ (𝐾 fLim 𝑓))) → 𝑥 ∈ (𝐽 fLim 𝑓))
8	7	expr 456	. . . 4 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑓 ∈ (Fil‘𝑋)) → (𝑥 ∈ (𝐾 fLim 𝑓) → 𝑥 ∈ (𝐽 fLim 𝑓)))
9	8	ssrdv 3928	. . 3 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑓 ∈ (Fil‘𝑋)) → (𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓))
10	9	ralrimiva 3130	. 2 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) → ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓))
11		oveq2 7369	. . . . . . . . . . . 12 ⊢ (𝑓 = ((nei‘𝐾)‘{𝑦}) → (𝐾 fLim 𝑓) = (𝐾 fLim ((nei‘𝐾)‘{𝑦})))
12		oveq2 7369	. . . . . . . . . . . 12 ⊢ (𝑓 = ((nei‘𝐾)‘{𝑦}) → (𝐽 fLim 𝑓) = (𝐽 fLim ((nei‘𝐾)‘{𝑦})))
13	11, 12	sseq12d 3956	. . . . . . . . . . 11 ⊢ (𝑓 = ((nei‘𝐾)‘{𝑦}) → ((𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓) ↔ (𝐾 fLim ((nei‘𝐾)‘{𝑦})) ⊆ (𝐽 fLim ((nei‘𝐾)‘{𝑦}))))
14		simplr 769	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓))
15		simpllr 776	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝐾 ∈ (TopOn‘𝑋))
16		simplll 775	. . . . . . . . . . . . . . 15 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝐽 ∈ (TopOn‘𝑋))
17		simprl 771	. . . . . . . . . . . . . . 15 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝑥 ∈ 𝐽)
18		toponss 22905	. . . . . . . . . . . . . . 15 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥 ∈ 𝐽) → 𝑥 ⊆ 𝑋)
19	16, 17, 18	syl2anc 585	. . . . . . . . . . . . . 14 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝑥 ⊆ 𝑋)
20		simprr 773	. . . . . . . . . . . . . 14 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝑦 ∈ 𝑥)
21	19, 20	sseldd 3923	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝑦 ∈ 𝑋)
22	21	snssd 4753	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → {𝑦} ⊆ 𝑋)
23	20	snn0d 4720	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → {𝑦} ≠ ∅)
24		neifil 23858	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ (TopOn‘𝑋) ∧ {𝑦} ⊆ 𝑋 ∧ {𝑦} ≠ ∅) → ((nei‘𝐾)‘{𝑦}) ∈ (Fil‘𝑋))
25	15, 22, 23, 24	syl3anc 1374	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → ((nei‘𝐾)‘{𝑦}) ∈ (Fil‘𝑋))
26	13, 14, 25	rspcdva 3566	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → (𝐾 fLim ((nei‘𝐾)‘{𝑦})) ⊆ (𝐽 fLim ((nei‘𝐾)‘{𝑦})))
27		neiflim 23952	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝑦 ∈ 𝑋) → 𝑦 ∈ (𝐾 fLim ((nei‘𝐾)‘{𝑦})))
28	15, 21, 27	syl2anc 585	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝑦 ∈ (𝐾 fLim ((nei‘𝐾)‘{𝑦})))
29	26, 28	sseldd 3923	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝑦 ∈ (𝐽 fLim ((nei‘𝐾)‘{𝑦})))
30		flimneiss 23944	. . . . . . . . 9 ⊢ (𝑦 ∈ (𝐽 fLim ((nei‘𝐾)‘{𝑦})) → ((nei‘𝐽)‘{𝑦}) ⊆ ((nei‘𝐾)‘{𝑦}))
31	29, 30	syl 17	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → ((nei‘𝐽)‘{𝑦}) ⊆ ((nei‘𝐾)‘{𝑦}))
32		topontop 22891	. . . . . . . . . 10 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
33	16, 32	syl 17	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝐽 ∈ Top)
34		opnneip 23097	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) → 𝑥 ∈ ((nei‘𝐽)‘{𝑦}))
35	33, 17, 20, 34	syl3anc 1374	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝑥 ∈ ((nei‘𝐽)‘{𝑦}))
36	31, 35	sseldd 3923	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝑥 ∈ ((nei‘𝐾)‘{𝑦}))
37	36	anassrs 467	. . . . . 6 ⊢ (((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ 𝑥 ∈ 𝐽) ∧ 𝑦 ∈ 𝑥) → 𝑥 ∈ ((nei‘𝐾)‘{𝑦}))
38	37	ralrimiva 3130	. . . . 5 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ 𝑥 ∈ 𝐽) → ∀𝑦 ∈ 𝑥 𝑥 ∈ ((nei‘𝐾)‘{𝑦}))
39		simpllr 776	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ 𝑥 ∈ 𝐽) → 𝐾 ∈ (TopOn‘𝑋))
40		topontop 22891	. . . . . 6 ⊢ (𝐾 ∈ (TopOn‘𝑋) → 𝐾 ∈ Top)
41		opnnei 23098	. . . . . 6 ⊢ (𝐾 ∈ Top → (𝑥 ∈ 𝐾 ↔ ∀𝑦 ∈ 𝑥 𝑥 ∈ ((nei‘𝐾)‘{𝑦})))
42	39, 40, 41	3syl 18	. . . . 5 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ 𝑥 ∈ 𝐽) → (𝑥 ∈ 𝐾 ↔ ∀𝑦 ∈ 𝑥 𝑥 ∈ ((nei‘𝐾)‘{𝑦})))
43	38, 42	mpbird 257	. . . 4 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ 𝑥 ∈ 𝐽) → 𝑥 ∈ 𝐾)
44	43	ex 412	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) → (𝑥 ∈ 𝐽 → 𝑥 ∈ 𝐾))
45	44	ssrdv 3928	. 2 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) → 𝐽 ⊆ 𝐾)
46	10, 45	impbida 801	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) → (𝐽 ⊆ 𝐾 ↔ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052   ⊆ wss 3890  ∅c0 4274  {csn 4568  ‘cfv 6493  (class class class)co 7361  Topctop 22871  TopOnctopon 22888  neicnei 23075  Filcfil 23823   fLim cflim 23912

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371  ax-un 7683

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366  df-fbas 21344  df-top 22872  df-topon 22889  df-ntr 22998  df-nei 23076  df-fil 23824  df-flim 23917

This theorem is referenced by: (None)