Theorem clsint2 36956

Description: The closure of an intersection is a subset of the intersection of the closures. (Contributed by Jeff Hankins, 31-Aug-2009.)

Hypothesis

Ref	Expression
clsint2.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
clsint2	⊢ ((𝐽 ∈ Top ∧ 𝐶 ⊆ 𝒫 𝑋) → ((cls‘𝐽)‘∩ 𝐶) ⊆ ∩ 𝑐 ∈ 𝐶 ((cls‘𝐽)‘𝑐))

Distinct variable groups:   𝐶,𝑐   𝐽,𝑐   𝑋,𝑐

Proof of Theorem clsint2

Step	Hyp	Ref	Expression
1		sspwuni 5064	. . . 4 ⊢ (𝐶 ⊆ 𝒫 𝑋 ↔ ∪ 𝐶 ⊆ 𝑋)
2		elssuni 4902	. . . . . . . 8 ⊢ (𝑐 ∈ 𝐶 → 𝑐 ⊆ ∪ 𝐶)
3		sstr2 3941	. . . . . . . 8 ⊢ (𝑐 ⊆ ∪ 𝐶 → (∪ 𝐶 ⊆ 𝑋 → 𝑐 ⊆ 𝑋))
4	2, 3	syl 18	. . . . . . 7 ⊢ (𝑐 ∈ 𝐶 → (∪ 𝐶 ⊆ 𝑋 → 𝑐 ⊆ 𝑋))
5	4	adantl 487	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ∈ 𝐶) → (∪ 𝐶 ⊆ 𝑋 → 𝑐 ⊆ 𝑋))
6		intss1 4926	. . . . . . . . 9 ⊢ (𝑐 ∈ 𝐶 → ∩ 𝐶 ⊆ 𝑐)
7		clsint2.1	. . . . . . . . . 10 ⊢ 𝑋 = ∪ 𝐽
8	7	clsss 23285	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ⊆ 𝑋 ∧ ∩ 𝐶 ⊆ 𝑐) → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))
9	6, 8	syl3an3 1183	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ⊆ 𝑋 ∧ 𝑐 ∈ 𝐶) → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))
10	9	3com23 1144	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ∈ 𝐶 ∧ 𝑐 ⊆ 𝑋) → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))
11	10	3expia 1139	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ∈ 𝐶) → (𝑐 ⊆ 𝑋 → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)))
12	5, 11	syld 48	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑐 ∈ 𝐶) → (∪ 𝐶 ⊆ 𝑋 → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)))
13	12	impancom 457	. . . 4 ⊢ ((𝐽 ∈ Top ∧ ∪ 𝐶 ⊆ 𝑋) → (𝑐 ∈ 𝐶 → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)))
14	1, 13	sylan2b 606	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐶 ⊆ 𝒫 𝑋) → (𝑐 ∈ 𝐶 → ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)))
15	14	ralrimiv 3155	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐶 ⊆ 𝒫 𝑋) → ∀𝑐 ∈ 𝐶 ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))
16		ssiin 5018	. 2 ⊢ (((cls‘𝐽)‘∩ 𝐶) ⊆ ∩ 𝑐 ∈ 𝐶 ((cls‘𝐽)‘𝑐) ↔ ∀𝑐 ∈ 𝐶 ((cls‘𝐽)‘∩ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))
17	15, 16	sylibr 237	1 ⊢ ((𝐽 ∈ Top ∧ 𝐶 ⊆ 𝒫 𝑋) → ((cls‘𝐽)‘∩ 𝐶) ⊆ ∩ 𝑐 ∈ 𝐶 ((cls‘𝐽)‘𝑐))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3078   ⊆ wss 3902  𝒫 cpw 4560  ∪ cuni 4870  ∩ cint 4910  ∩ ciin 4955  ‘cfv 6537  Topctop 23124  clsccl 23249

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-top 23125  df-cld 23250  df-cls 23252

This theorem is used by: (None)