Theorem isopn3 21677

Description: A subset is open iff it equals its own interior. (Contributed by NM, 9-Oct-2006.) (Revised by Mario Carneiro, 11-Nov-2013.)

Hypothesis

Ref	Expression
clscld.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
isopn3	⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑆 ∈ 𝐽 ↔ ((int‘𝐽)‘𝑆) = 𝑆))

Proof of Theorem isopn3

Step	Hyp	Ref	Expression
1		clscld.1	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
2	1	ntrval 21647	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) = ∪ (𝐽 ∩ 𝒫 𝑆))
3		inss2 4209	. . . . . . . 8 ⊢ (𝐽 ∩ 𝒫 𝑆) ⊆ 𝒫 𝑆
4	3	unissi 4850	. . . . . . 7 ⊢ ∪ (𝐽 ∩ 𝒫 𝑆) ⊆ ∪ 𝒫 𝑆
5		unipw 5346	. . . . . . 7 ⊢ ∪ 𝒫 𝑆 = 𝑆
6	4, 5	sseqtri 4006	. . . . . 6 ⊢ ∪ (𝐽 ∩ 𝒫 𝑆) ⊆ 𝑆
7	6	a1i 11	. . . . 5 ⊢ (𝑆 ∈ 𝐽 → ∪ (𝐽 ∩ 𝒫 𝑆) ⊆ 𝑆)
8		id 22	. . . . . . 7 ⊢ (𝑆 ∈ 𝐽 → 𝑆 ∈ 𝐽)
9		pwidg 4564	. . . . . . 7 ⊢ (𝑆 ∈ 𝐽 → 𝑆 ∈ 𝒫 𝑆)
10	8, 9	elind 4174	. . . . . 6 ⊢ (𝑆 ∈ 𝐽 → 𝑆 ∈ (𝐽 ∩ 𝒫 𝑆))
11		elssuni 4871	. . . . . 6 ⊢ (𝑆 ∈ (𝐽 ∩ 𝒫 𝑆) → 𝑆 ⊆ ∪ (𝐽 ∩ 𝒫 𝑆))
12	10, 11	syl 17	. . . . 5 ⊢ (𝑆 ∈ 𝐽 → 𝑆 ⊆ ∪ (𝐽 ∩ 𝒫 𝑆))
13	7, 12	eqssd 3987	. . . 4 ⊢ (𝑆 ∈ 𝐽 → ∪ (𝐽 ∩ 𝒫 𝑆) = 𝑆)
14	2, 13	sylan9eq 2879	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑆 ∈ 𝐽) → ((int‘𝐽)‘𝑆) = 𝑆)
15	14	ex 415	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑆 ∈ 𝐽 → ((int‘𝐽)‘𝑆) = 𝑆))
16	1	ntropn 21660	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((int‘𝐽)‘𝑆) ∈ 𝐽)
17		eleq1 2903	. . 3 ⊢ (((int‘𝐽)‘𝑆) = 𝑆 → (((int‘𝐽)‘𝑆) ∈ 𝐽 ↔ 𝑆 ∈ 𝐽))
18	16, 17	syl5ibcom 247	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (((int‘𝐽)‘𝑆) = 𝑆 → 𝑆 ∈ 𝐽))
19	15, 18	impbid 214	1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑆 ∈ 𝐽 ↔ ((int‘𝐽)‘𝑆) = 𝑆))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1536   ∈ wcel 2113   ∩ cin 3938   ⊆ wss 3939  𝒫 cpw 4542  ∪ cuni 4841  ‘cfv 6358  Topctop 21504  intcnt 21628

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-rep 5193  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-ral 3146  df-rex 3147  df-reu 3148  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-iun 4924  df-br 5070  df-opab 5132  df-mpt 5150  df-id 5463  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-top 21505  df-ntr 21631

This theorem is referenced by:  ntridm  21679  ntrtop  21681  ntr0  21692  isopn3i  21693  opnnei  21731  cnntr  21886  llycmpkgen2  22161  dvnres  24531  dvcnvre  24619  taylthlem2  24965  ulmdvlem3  24993  abelth  25032  opnbnd  33677  ioontr  41793  cncfuni  42175  fperdvper  42209  dirkercncflem3  42397  dirkercncflem4  42398  fourierdlem58  42456  fourierdlem73  42471