Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  kur14lem6 Structured version   Visualization version   GIF version

Theorem kur14lem6 35873
Description: Lemma for kur14 35878. If 𝑘 is the complementation operator and 𝑘 is the closure operator, this expresses the identity 𝑘𝑐𝑘𝐴 = 𝑘𝑐𝑘𝑐𝑘𝑐𝑘𝐴 for any subset 𝐴 of the topological space. This is the key result that lets us cut down long enough sequences of 𝑐𝑘𝑐𝑘... that arise when applying closure and complement repeatedly to 𝐴, and explains why we end up with a number as large as 14, yet no larger. (Contributed by Mario Carneiro, 11-Feb-2015.)
Hypotheses
Ref Expression
kur14lem.j 𝐽 ∈ Top
kur14lem.x 𝑋 = 𝐽
kur14lem.k 𝐾 = (cls‘𝐽)
kur14lem.i 𝐼 = (int‘𝐽)
kur14lem.a 𝐴𝑋
kur14lem.b 𝐵 = (𝑋 ∖ (𝐾𝐴))
Assertion
Ref Expression
kur14lem6 (𝐾‘(𝐼‘(𝐾𝐵))) = (𝐾𝐵)

Proof of Theorem kur14lem6
StepHypRef Expression
1 kur14lem.j . . . . 5 𝐽 ∈ Top
2 kur14lem.x . . . . . 6 𝑋 = 𝐽
3 kur14lem.k . . . . . 6 𝐾 = (cls‘𝐽)
4 kur14lem.i . . . . . 6 𝐼 = (int‘𝐽)
5 kur14lem.b . . . . . . 7 𝐵 = (𝑋 ∖ (𝐾𝐴))
6 difss 4083 . . . . . . 7 (𝑋 ∖ (𝐾𝐴)) ⊆ 𝑋
75, 6eqsstri 3977 . . . . . 6 𝐵𝑋
81, 2, 3, 4, 7kur14lem3 35870 . . . . 5 (𝐾𝐵) ⊆ 𝑋
94fveq1i 6882 . . . . . 6 (𝐼‘(𝐾𝐵)) = ((int‘𝐽)‘(𝐾𝐵))
102ntrss2 23314 . . . . . . 7 ((𝐽 ∈ Top ∧ (𝐾𝐵) ⊆ 𝑋) → ((int‘𝐽)‘(𝐾𝐵)) ⊆ (𝐾𝐵))
111, 8, 10mp2an 705 . . . . . 6 ((int‘𝐽)‘(𝐾𝐵)) ⊆ (𝐾𝐵)
129, 11eqsstri 3977 . . . . 5 (𝐼‘(𝐾𝐵)) ⊆ (𝐾𝐵)
132clsss 23311 . . . . 5 ((𝐽 ∈ Top ∧ (𝐾𝐵) ⊆ 𝑋 ∧ (𝐼‘(𝐾𝐵)) ⊆ (𝐾𝐵)) → ((cls‘𝐽)‘(𝐼‘(𝐾𝐵))) ⊆ ((cls‘𝐽)‘(𝐾𝐵)))
141, 8, 12, 13mp3an 1490 . . . 4 ((cls‘𝐽)‘(𝐼‘(𝐾𝐵))) ⊆ ((cls‘𝐽)‘(𝐾𝐵))
153fveq1i 6882 . . . 4 (𝐾‘(𝐼‘(𝐾𝐵))) = ((cls‘𝐽)‘(𝐼‘(𝐾𝐵)))
163fveq1i 6882 . . . 4 (𝐾‘(𝐾𝐵)) = ((cls‘𝐽)‘(𝐾𝐵))
1714, 15, 163sstr4i 3982 . . 3 (𝐾‘(𝐼‘(𝐾𝐵))) ⊆ (𝐾‘(𝐾𝐵))
181, 2, 3, 4, 7kur14lem5 35872 . . 3 (𝐾‘(𝐾𝐵)) = (𝐾𝐵)
1917, 18sseqtri 3979 . 2 (𝐾‘(𝐼‘(𝐾𝐵))) ⊆ (𝐾𝐵)
201, 2, 3, 4, 8kur14lem2 35869 . . . . 5 (𝐼‘(𝐾𝐵)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐵))))
21 difss 4083 . . . . 5 (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐵)))) ⊆ 𝑋
2220, 21eqsstri 3977 . . . 4 (𝐼‘(𝐾𝐵)) ⊆ 𝑋
23 kur14lem.a . . . . . . . . 9 𝐴𝑋
241, 2, 3, 4, 23kur14lem3 35870 . . . . . . . 8 (𝐾𝐴) ⊆ 𝑋
255fveq2i 6884 . . . . . . . . . . 11 (𝐾𝐵) = (𝐾‘(𝑋 ∖ (𝐾𝐴)))
2625difeq2i 4071 . . . . . . . . . 10 (𝑋 ∖ (𝐾𝐵)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐴))))
271, 2, 3, 4, 24kur14lem2 35869 . . . . . . . . . 10 (𝐼‘(𝐾𝐴)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐴))))
284fveq1i 6882 . . . . . . . . . 10 (𝐼‘(𝐾𝐴)) = ((int‘𝐽)‘(𝐾𝐴))
2926, 27, 283eqtr2i 2789 . . . . . . . . 9 (𝑋 ∖ (𝐾𝐵)) = ((int‘𝐽)‘(𝐾𝐴))
302ntrss2 23314 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ (𝐾𝐴) ⊆ 𝑋) → ((int‘𝐽)‘(𝐾𝐴)) ⊆ (𝐾𝐴))
311, 24, 30mp2an 705 . . . . . . . . 9 ((int‘𝐽)‘(𝐾𝐴)) ⊆ (𝐾𝐴)
3229, 31eqsstri 3977 . . . . . . . 8 (𝑋 ∖ (𝐾𝐵)) ⊆ (𝐾𝐴)
332clsss 23311 . . . . . . . 8 ((𝐽 ∈ Top ∧ (𝐾𝐴) ⊆ 𝑋 ∧ (𝑋 ∖ (𝐾𝐵)) ⊆ (𝐾𝐴)) → ((cls‘𝐽)‘(𝑋 ∖ (𝐾𝐵))) ⊆ ((cls‘𝐽)‘(𝐾𝐴)))
341, 24, 32, 33mp3an 1490 . . . . . . 7 ((cls‘𝐽)‘(𝑋 ∖ (𝐾𝐵))) ⊆ ((cls‘𝐽)‘(𝐾𝐴))
353fveq1i 6882 . . . . . . 7 (𝐾‘(𝑋 ∖ (𝐾𝐵))) = ((cls‘𝐽)‘(𝑋 ∖ (𝐾𝐵)))
361, 2, 3, 4, 23kur14lem5 35872 . . . . . . . 8 (𝐾‘(𝐾𝐴)) = (𝐾𝐴)
373fveq1i 6882 . . . . . . . 8 (𝐾‘(𝐾𝐴)) = ((cls‘𝐽)‘(𝐾𝐴))
3836, 37eqtr3i 2785 . . . . . . 7 (𝐾𝐴) = ((cls‘𝐽)‘(𝐾𝐴))
3934, 35, 383sstr4i 3982 . . . . . 6 (𝐾‘(𝑋 ∖ (𝐾𝐵))) ⊆ (𝐾𝐴)
40 sscon 4090 . . . . . 6 ((𝐾‘(𝑋 ∖ (𝐾𝐵))) ⊆ (𝐾𝐴) → (𝑋 ∖ (𝐾𝐴)) ⊆ (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐵)))))
4139, 40ax-mp 5 . . . . 5 (𝑋 ∖ (𝐾𝐴)) ⊆ (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐵))))
4241, 5, 203sstr4i 3982 . . . 4 𝐵 ⊆ (𝐼‘(𝐾𝐵))
432clsss 23311 . . . 4 ((𝐽 ∈ Top ∧ (𝐼‘(𝐾𝐵)) ⊆ 𝑋𝐵 ⊆ (𝐼‘(𝐾𝐵))) → ((cls‘𝐽)‘𝐵) ⊆ ((cls‘𝐽)‘(𝐼‘(𝐾𝐵))))
441, 22, 42, 43mp3an 1490 . . 3 ((cls‘𝐽)‘𝐵) ⊆ ((cls‘𝐽)‘(𝐼‘(𝐾𝐵)))
453fveq1i 6882 . . 3 (𝐾𝐵) = ((cls‘𝐽)‘𝐵)
4644, 45, 153sstr4i 3982 . 2 (𝐾𝐵) ⊆ (𝐾‘(𝐼‘(𝐾𝐵)))
4719, 46eqssi 3947 1 (𝐾‘(𝐼‘(𝐾𝐵))) = (𝐾𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  wcel 2145  cdif 3896  wss 3899   cuni 4867  cfv 6535  Topctop 23150  intcnt 23274  clsccl 23275
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 7742
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-int 4908  df-iun 4953  df-iin 4954  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 6491  df-fun 6537  df-fn 6538  df-f 6539  df-f1 6540  df-fo 6541  df-f1o 6542  df-fv 6543  df-top 23151  df-cld 23276  df-ntr 23277  df-cls 23278
This theorem is used by:  kur14lem7  35874
  Copyright terms: Public domain W3C validator