Theorem topssnei 22275

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 1191	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝐾 ∈ Top)
2		simprl 768	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝐽 ⊆ 𝐾)
3		simpl1 1190	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝐽 ∈ Top)
4		simprr 770	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝑥 ∈ ((nei‘𝐽)‘𝑆))
5		tpnei.1	. . . . . . . . 9 ⊢ 𝑋 = ∪ 𝐽
6	5	neii1 22257	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆)) → 𝑥 ⊆ 𝑋)
7	3, 4, 6	syl2anc 584	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝑥 ⊆ 𝑋)
8	5	ntropn 22200	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ⊆ 𝑋) → ((int‘𝐽)‘𝑥) ∈ 𝐽)
9	3, 7, 8	syl2anc 584	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → ((int‘𝐽)‘𝑥) ∈ 𝐽)
10	2, 9	sseldd 3922	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → ((int‘𝐽)‘𝑥) ∈ 𝐾)
11	5	neiss2 22252	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆)) → 𝑆 ⊆ 𝑋)
12	3, 4, 11	syl2anc 584	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝑆 ⊆ 𝑋)
13	5	neiint 22255	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑋) → (𝑥 ∈ ((nei‘𝐽)‘𝑆) ↔ 𝑆 ⊆ ((int‘𝐽)‘𝑥)))
14	3, 12, 7, 13	syl3anc 1370	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → (𝑥 ∈ ((nei‘𝐽)‘𝑆) ↔ 𝑆 ⊆ ((int‘𝐽)‘𝑥)))
15	4, 14	mpbid 231	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝑆 ⊆ ((int‘𝐽)‘𝑥))
16		opnneiss 22269	. . . . 5 ⊢ ((𝐾 ∈ Top ∧ ((int‘𝐽)‘𝑥) ∈ 𝐾 ∧ 𝑆 ⊆ ((int‘𝐽)‘𝑥)) → ((int‘𝐽)‘𝑥) ∈ ((nei‘𝐾)‘𝑆))
17	1, 10, 15, 16	syl3anc 1370	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → ((int‘𝐽)‘𝑥) ∈ ((nei‘𝐾)‘𝑆))
18	5	ntrss2 22208	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ⊆ 𝑋) → ((int‘𝐽)‘𝑥) ⊆ 𝑥)
19	3, 7, 18	syl2anc 584	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → ((int‘𝐽)‘𝑥) ⊆ 𝑥)
20		simpl3 1192	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝑋 = 𝑌)
21	7, 20	sseqtrd 3961	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝑥 ⊆ 𝑌)
22		topssnei.2	. . . . 5 ⊢ 𝑌 = ∪ 𝐾
23	22	ssnei2 22267	. . . 4 ⊢ (((𝐾 ∈ Top ∧ ((int‘𝐽)‘𝑥) ∈ ((nei‘𝐾)‘𝑆)) ∧ (((int‘𝐽)‘𝑥) ⊆ 𝑥 ∧ 𝑥 ⊆ 𝑌)) → 𝑥 ∈ ((nei‘𝐾)‘𝑆))
24	1, 17, 19, 21, 23	syl22anc 836	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ (𝐽 ⊆ 𝐾 ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆))) → 𝑥 ∈ ((nei‘𝐾)‘𝑆))
25	24	expr 457	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ 𝐽 ⊆ 𝐾) → (𝑥 ∈ ((nei‘𝐽)‘𝑆) → 𝑥 ∈ ((nei‘𝐾)‘𝑆)))
26	25	ssrdv 3927	1 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝑋 = 𝑌) ∧ 𝐽 ⊆ 𝐾) → ((nei‘𝐽)‘𝑆) ⊆ ((nei‘𝐾)‘𝑆))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106   ⊆ wss 3887  ∪ cuni 4839  ‘cfv 6433  Topctop 22042  intcnt 22168  neicnei 22248

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-top 22043  df-ntr 22171  df-nei 22249

This theorem is referenced by:  flimss1  23124