Theorem lpss3 23173

Description: Subset relationship for limit points. (Contributed by Mario Carneiro, 25-Dec-2016.)

Hypothesis

Ref	Expression
lpfval.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
lpss3	⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((limPt‘𝐽)‘𝑇) ⊆ ((limPt‘𝐽)‘𝑆))

Proof of Theorem lpss3

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp1 1136	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝐽 ∈ Top)
2		simp2 1137	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝑆 ⊆ 𝑋)
3	2	ssdifssd 4170	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → (𝑆 ∖ {𝑥}) ⊆ 𝑋)
4		simp3 1138	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝑇 ⊆ 𝑆)
5	4	ssdifd 4168	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → (𝑇 ∖ {𝑥}) ⊆ (𝑆 ∖ {𝑥}))
6		lpfval.1	. . . . . 6 ⊢ 𝑋 = ∪ 𝐽
7	6	clsss 23083	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ∖ {𝑥}) ⊆ 𝑋 ∧ (𝑇 ∖ {𝑥}) ⊆ (𝑆 ∖ {𝑥})) → ((cls‘𝐽)‘(𝑇 ∖ {𝑥})) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))
8	1, 3, 5, 7	syl3anc 1371	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((cls‘𝐽)‘(𝑇 ∖ {𝑥})) ⊆ ((cls‘𝐽)‘(𝑆 ∖ {𝑥})))
9	8	sseld 4007	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → (𝑥 ∈ ((cls‘𝐽)‘(𝑇 ∖ {𝑥})) → 𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
10	4, 2	sstrd 4019	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝑇 ⊆ 𝑋)
11	6	islp 23169	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑇 ⊆ 𝑋) → (𝑥 ∈ ((limPt‘𝐽)‘𝑇) ↔ 𝑥 ∈ ((cls‘𝐽)‘(𝑇 ∖ {𝑥}))))
12	1, 10, 11	syl2anc 583	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → (𝑥 ∈ ((limPt‘𝐽)‘𝑇) ↔ 𝑥 ∈ ((cls‘𝐽)‘(𝑇 ∖ {𝑥}))))
13	6	islp 23169	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑥 ∈ ((limPt‘𝐽)‘𝑆) ↔ 𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
14	1, 2, 13	syl2anc 583	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → (𝑥 ∈ ((limPt‘𝐽)‘𝑆) ↔ 𝑥 ∈ ((cls‘𝐽)‘(𝑆 ∖ {𝑥}))))
15	9, 12, 14	3imtr4d 294	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → (𝑥 ∈ ((limPt‘𝐽)‘𝑇) → 𝑥 ∈ ((limPt‘𝐽)‘𝑆)))
16	15	ssrdv 4014	1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((limPt‘𝐽)‘𝑇) ⊆ ((limPt‘𝐽)‘𝑆))

Syntax hints:   → wi 4   ↔ wb 206   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108   ∖ cdif 3973   ⊆ wss 3976  {csn 4648  ∪ cuni 4931  ‘cfv 6573  Topctop 22920  clsccl 23047  limPtclp 23163

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-iun 5017  df-iin 5018  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-top 22921  df-cld 23048  df-cls 23050  df-lp 23165

This theorem is referenced by:  perfdvf  25958  pibt2  37383  lpss2  37714  fourierdlem113  46140