Users' Mathboxes Mathbox for Jeff Hankins < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  clsint2 Structured version   Visualization version   GIF version

Theorem clsint2 36564
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
StepHypRef Expression
1 sspwuni 5036 . . . 4 (𝐶 ⊆ 𝒫 𝑋 𝐶𝑋)
2 elssuni 4876 . . . . . . . 8 (𝑐𝐶𝑐 𝐶)
3 sstr2 3929 . . . . . . . 8 (𝑐 𝐶 → ( 𝐶𝑋𝑐𝑋))
42, 3syl 17 . . . . . . 7 (𝑐𝐶 → ( 𝐶𝑋𝑐𝑋))
54adantl 482 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑐𝐶) → ( 𝐶𝑋𝑐𝑋))
6 intss1 4900 . . . . . . . . 9 (𝑐𝐶 𝐶𝑐)
7 clsint2.1 . . . . . . . . . 10 𝑋 = 𝐽
87clsss 23044 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝑐𝑋 𝐶𝑐) → ((cls‘𝐽)‘ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))
96, 8syl3an3 1171 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑐𝑋𝑐𝐶) → ((cls‘𝐽)‘ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))
1093com23 1132 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑐𝐶𝑐𝑋) → ((cls‘𝐽)‘ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))
11103expia 1127 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑐𝐶) → (𝑐𝑋 → ((cls‘𝐽)‘ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)))
125, 11syld 47 . . . . 5 ((𝐽 ∈ Top ∧ 𝑐𝐶) → ( 𝐶𝑋 → ((cls‘𝐽)‘ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)))
1312impancom 452 . . . 4 ((𝐽 ∈ Top ∧ 𝐶𝑋) → (𝑐𝐶 → ((cls‘𝐽)‘ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)))
141, 13sylan2b 600 . . 3 ((𝐽 ∈ Top ∧ 𝐶 ⊆ 𝒫 𝑋) → (𝑐𝐶 → ((cls‘𝐽)‘ 𝐶) ⊆ ((cls‘𝐽)‘𝑐)))
1514ralrimiv 3131 . 2 ((𝐽 ∈ Top ∧ 𝐶 ⊆ 𝒫 𝑋) → ∀𝑐𝐶 ((cls‘𝐽)‘ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))
16 ssiin 4992 . 2 (((cls‘𝐽)‘ 𝐶) ⊆ 𝑐𝐶 ((cls‘𝐽)‘𝑐) ↔ ∀𝑐𝐶 ((cls‘𝐽)‘ 𝐶) ⊆ ((cls‘𝐽)‘𝑐))
1715, 16sylibr 235 1 ((𝐽 ∈ Top ∧ 𝐶 ⊆ 𝒫 𝑋) → ((cls‘𝐽)‘ 𝐶) ⊆ 𝑐𝐶 ((cls‘𝐽)‘𝑐))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1547  wcel 2119  wral 3054  wss 3890  𝒫 cpw 4536   cuni 4845   cint 4884   ciin 4929  cfv 6492  Topctop 22883  clsccl 23008
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-int 4885  df-iun 4930  df-iin 4931  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-top 22884  df-cld 23009  df-cls 23011
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator