Theorem flimcf 23965

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 780	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ (𝐾 fLim 𝑓))) → 𝐽 ∈ (TopOn‘𝑋))
2		simprl 776	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ (𝐾 fLim 𝑓))) → 𝑓 ∈ (Fil‘𝑋))
3		simplr 774	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ (𝐾 fLim 𝑓))) → 𝐽 ⊆ 𝐾)
4		flimss1 23956	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑓 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓))
5	1, 2, 3, 4	syl3anc 1379	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ (𝐾 fLim 𝑓))) → (𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓))
6		simprr 778	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ (𝐾 fLim 𝑓))) → 𝑥 ∈ (𝐾 fLim 𝑓))
7	5, 6	sseldd 3916	. . . . 5 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ (𝐾 fLim 𝑓))) → 𝑥 ∈ (𝐽 fLim 𝑓))
8	7	expr 457	. . . 4 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑓 ∈ (Fil‘𝑋)) → (𝑥 ∈ (𝐾 fLim 𝑓) → 𝑥 ∈ (𝐽 fLim 𝑓)))
9	8	ssrdv 3921	. . 3 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑓 ∈ (Fil‘𝑋)) → (𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓))
10	9	ralrimiva 3131	. 2 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ 𝐽 ⊆ 𝐾) → ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓))
11		oveq2 7364	. . . . . . . . . . . 12 ⊢ (𝑓 = ((nei‘𝐾)‘{𝑦}) → (𝐾 fLim 𝑓) = (𝐾 fLim ((nei‘𝐾)‘{𝑦})))
12		oveq2 7364	. . . . . . . . . . . 12 ⊢ (𝑓 = ((nei‘𝐾)‘{𝑦}) → (𝐽 fLim 𝑓) = (𝐽 fLim ((nei‘𝐾)‘{𝑦})))
13	11, 12	sseq12d 3948	. . . . . . . . . . 11 ⊢ (𝑓 = ((nei‘𝐾)‘{𝑦}) → ((𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓) ↔ (𝐾 fLim ((nei‘𝐾)‘{𝑦})) ⊆ (𝐽 fLim ((nei‘𝐾)‘{𝑦}))))
14		simplr 774	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓))
15		simpllr 781	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝐾 ∈ (TopOn‘𝑋))
16		simplll 780	. . . . . . . . . . . . . . 15 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝐽 ∈ (TopOn‘𝑋))
17		simprl 776	. . . . . . . . . . . . . . 15 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝑥 ∈ 𝐽)
18		toponss 22910	. . . . . . . . . . . . . . 15 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥 ∈ 𝐽) → 𝑥 ⊆ 𝑋)
19	16, 17, 18	syl2anc 590	. . . . . . . . . . . . . 14 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝑥 ⊆ 𝑋)
20		simprr 778	. . . . . . . . . . . . . 14 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝑦 ∈ 𝑥)
21	19, 20	sseldd 3916	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝑦 ∈ 𝑋)
22	21	snssd 4718	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → {𝑦} ⊆ 𝑋)
23	20	snn0d 4707	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → {𝑦} ≠ ∅)
24		neifil 23863	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ (TopOn‘𝑋) ∧ {𝑦} ⊆ 𝑋 ∧ {𝑦} ≠ ∅) → ((nei‘𝐾)‘{𝑦}) ∈ (Fil‘𝑋))
25	15, 22, 23, 24	syl3anc 1379	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → ((nei‘𝐾)‘{𝑦}) ∈ (Fil‘𝑋))
26	13, 14, 25	rspcdva 3561	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → (𝐾 fLim ((nei‘𝐾)‘{𝑦})) ⊆ (𝐽 fLim ((nei‘𝐾)‘{𝑦})))
27		neiflim 23957	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝑦 ∈ 𝑋) → 𝑦 ∈ (𝐾 fLim ((nei‘𝐾)‘{𝑦})))
28	15, 21, 27	syl2anc 590	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝑦 ∈ (𝐾 fLim ((nei‘𝐾)‘{𝑦})))
29	26, 28	sseldd 3916	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝑦 ∈ (𝐽 fLim ((nei‘𝐾)‘{𝑦})))
30		flimneiss 23949	. . . . . . . . 9 ⊢ (𝑦 ∈ (𝐽 fLim ((nei‘𝐾)‘{𝑦})) → ((nei‘𝐽)‘{𝑦}) ⊆ ((nei‘𝐾)‘{𝑦}))
31	29, 30	syl 17	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → ((nei‘𝐽)‘{𝑦}) ⊆ ((nei‘𝐾)‘{𝑦}))
32		topontop 22896	. . . . . . . . . 10 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
33	16, 32	syl 17	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝐽 ∈ Top)
34		opnneip 23102	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) → 𝑥 ∈ ((nei‘𝐽)‘{𝑦}))
35	33, 17, 20, 34	syl3anc 1379	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝑥 ∈ ((nei‘𝐽)‘{𝑦}))
36	31, 35	sseldd 3916	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → 𝑥 ∈ ((nei‘𝐾)‘{𝑦}))
37	36	anassrs 468	. . . . . 6 ⊢ (((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ 𝑥 ∈ 𝐽) ∧ 𝑦 ∈ 𝑥) → 𝑥 ∈ ((nei‘𝐾)‘{𝑦}))
38	37	ralrimiva 3131	. . . . 5 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ 𝑥 ∈ 𝐽) → ∀𝑦 ∈ 𝑥 𝑥 ∈ ((nei‘𝐾)‘{𝑦}))
39		simpllr 781	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ 𝑥 ∈ 𝐽) → 𝐾 ∈ (TopOn‘𝑋))
40		topontop 22896	. . . . . 6 ⊢ (𝐾 ∈ (TopOn‘𝑋) → 𝐾 ∈ Top)
41		opnnei 23103	. . . . . 6 ⊢ (𝐾 ∈ Top → (𝑥 ∈ 𝐾 ↔ ∀𝑦 ∈ 𝑥 𝑥 ∈ ((nei‘𝐾)‘{𝑦})))
42	39, 40, 41	3syl 18	. . . . 5 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ 𝑥 ∈ 𝐽) → (𝑥 ∈ 𝐾 ↔ ∀𝑦 ∈ 𝑥 𝑥 ∈ ((nei‘𝐾)‘{𝑦})))
43	38, 42	mpbird 258	. . . 4 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) ∧ 𝑥 ∈ 𝐽) → 𝑥 ∈ 𝐾)
44	43	ex 413	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) → (𝑥 ∈ 𝐽 → 𝑥 ∈ 𝐾))
45	44	ssrdv 3921	. 2 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) ∧ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)) → 𝐽 ⊆ 𝐾)
46	10, 45	impbida 806	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋)) → (𝐽 ⊆ 𝐾 ↔ ∀𝑓 ∈ (Fil‘𝑋)(𝐾 fLim 𝑓) ⊆ (𝐽 fLim 𝑓)))

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   = wceq 1547   ∈ wcel 2119   ≠ wne 2934  ∀wral 3053   ⊆ wss 3883  ∅c0 4261  {csn 4555  ‘cfv 6485  (class class class)co 7356  Topctop 22876  TopOnctopon 22893  neicnei 23080  Filcfil 23828   fLim cflim 23917

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-nel 3039  df-ral 3054  df-rex 3064  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-fbas 21344  df-top 22877  df-topon 22894  df-ntr 23003  df-nei 23081  df-fil 23829  df-flim 23922

This theorem is referenced by: (None)