Theorem topssnei 23352

Description: A finer topology has more neighborhoods. (Contributed by Mario Carneiro, 9-Apr-2015.)

Hypotheses

Ref	Expression
tpnei.1	⊢ 𝑋 = ∪ 𝐽
topssnei.2	⊢ 𝑌 = ∪ 𝐾

Assertion

Ref	Expression
topssnei	⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ 𝐽 ⊆ 𝐾) → ((nei‘𝐽)‘𝑆) ⊆ ((nei‘𝐾)‘𝑆))

Proof of Theorem topssnei

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl2 1211	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝐾 ∈ Top)
2		simprl 783	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝐽 ⊆ 𝐾)
3		simpl1 1210	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝐽 ∈ Top)
4		simprr 785	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝑥 ∈ ((nei‘𝐽)‘𝑆))
5		tpnei.1	. . . . . . . . 9 ⊢ 𝑋 = ∪ 𝐽
6	5	neii1 23334	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆)) → 𝑥 ⊆ 𝑋)
7	3, 4, 6	syl2anc 596	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝑥 ⊆ 𝑋)
8	5	ntropn 23277	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ⊆ 𝑋) → ((int‘𝐽)‘𝑥) ∈ 𝐽)
9	3, 7, 8	syl2anc 596	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → ((int‘𝐽)‘𝑥) ∈ 𝐽)
10	2, 9	sseldd 3932	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → ((int‘𝐽)‘𝑥) ∈ 𝐾)
11	5	neiss2 23329	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆)) → 𝑆 ⊆ 𝑋)
12	3, 4, 11	syl2anc 596	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝑆 ⊆ 𝑋)
13	5	neiint 23332	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑋) → (𝑥 ∈ ((nei‘𝐽)‘𝑆) ↔ 𝑆 ⊆ ((int‘𝐽)‘𝑥)))
14	3, 12, 7, 13	syl3anc 1398	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → (𝑥 ∈ ((nei‘𝐽)‘𝑆) ↔ 𝑆 ⊆ ((int‘𝐽)‘𝑥)))
15	4, 14	mpbid 235	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝑆 ⊆ ((int‘𝐽)‘𝑥))
16		opnneiss 23346	. . . . 5 ⊢ ((𝐾 ∈ Top ∧ ((int‘𝐽)‘𝑥) ∈ 𝐾 ∧ 𝑆 ⊆ ((int‘𝐽)‘𝑥)) → ((int‘𝐽)‘𝑥) ∈ ((nei‘𝐾)‘𝑆))
17	1, 10, 15, 16	syl3anc 1398	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → ((int‘𝐽)‘𝑥) ∈ ((nei‘𝐾)‘𝑆))
18	5	ntrss2 23285	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ⊆ 𝑋) → ((int‘𝐽)‘𝑥) ⊆ 𝑥)
19	3, 7, 18	syl2anc 596	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → ((int‘𝐽)‘𝑥) ⊆ 𝑥)
20		simpl3 1212	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝑋 = 𝑌)
21	7, 20	sseqtrd 3967	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝑥 ⊆ 𝑌)
22		topssnei.2	. . . . 5 ⊢ 𝑌 = ∪ 𝐾
23	22	ssnei2 23344	. . . 4 ⊢ (((𝐾 ∈ Top ∧ ((int‘𝐽)‘𝑥) ∈ ((nei‘𝐾)‘𝑆)) ∧ (((int‘𝐽)‘𝑥) ⊆ 𝑥 ∧ 𝑥 ⊆ 𝑌)) → 𝑥 ∈ ((nei‘𝐾)‘𝑆))
24	1, 17, 19, 21, 23	syl22anc 852	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝑥 ∈ ((nei‘𝐾)‘𝑆))
25	24	expr 462	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ 𝐽 ⊆ 𝐾) → (𝑥 ∈ ((nei‘𝐽)‘𝑆) → 𝑥 ∈ ((nei‘𝐾)‘𝑆)))
26	25	ssrdv 3937	1 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ 𝐽 ⊆ 𝐾) → ((nei‘𝐽)‘𝑆) ⊆ ((nei‘𝐾)‘𝑆))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ⊆ wss 3899  ∪ cuni 4867  ‘cfv 6533  Topctop 23121  intcnt 23245  neicnei 23325

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-top 23122  df-ntr 23248  df-nei 23326

This theorem is used by:  flimss1  24202