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 36185
Description: Lemma for kur14 36190. 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 4074 . . . . . . 7 (𝑋 ∖ (𝐾‘𝐴)) ⊆ 𝑋
75, 6eqsstri 3958 . . . . . 6 𝐵 ⊆ 𝑋
81, 2, 3, 4, 7kur14lem3 36182 . . . . 5 (𝐾‘𝐵) ⊆ 𝑋
94fveq1i 6916 . . . . . 6 (𝐼‘(𝐾‘𝐵)) = ((int‘𝐽)‘(𝐾‘𝐵))
102ntrss2 23432 . . . . . . 7 ((𝐽 ∈ Top ∧ (𝐾‘𝐵) ⊆ 𝑋) → ((int‘𝐽)‘(𝐾‘𝐵)) ⊆ (𝐾‘𝐵))
111, 8, 10mp2an 705 . . . . . 6 ((int‘𝐽)‘(𝐾‘𝐵)) ⊆ (𝐾‘𝐵)
129, 11eqsstri 3958 . . . . 5 (𝐼‘(𝐾‘𝐵)) ⊆ (𝐾‘𝐵)
132clsss 23429 . . . . 5 ((𝐽 ∈ Top ∧ (𝐾‘𝐵) ⊆ 𝑋 ∧ (𝐼‘(𝐾‘𝐵)) ⊆ (𝐾‘𝐵)) → ((cls‘𝐽)‘(𝐼‘(𝐾‘𝐵))) ⊆ ((cls‘𝐽)‘(𝐾‘𝐵)))
141, 8, 12, 13mp3an 1493 . . . 4 ((cls‘𝐽)‘(𝐼‘(𝐾‘𝐵))) ⊆ ((cls‘𝐽)‘(𝐾‘𝐵))
153fveq1i 6916 . . . 4 (𝐾‘(𝐼‘(𝐾‘𝐵))) = ((cls‘𝐽)‘(𝐼‘(𝐾‘𝐵)))
163fveq1i 6916 . . . 4 (𝐾‘(𝐾‘𝐵)) = ((cls‘𝐽)‘(𝐾‘𝐵))
1714, 15, 163sstr4i 3963 . . 3 (𝐾‘(𝐼‘(𝐾‘𝐵))) ⊆ (𝐾‘(𝐾‘𝐵))
181, 2, 3, 4, 7kur14lem5 36184 . . 3 (𝐾‘(𝐾‘𝐵)) = (𝐾‘𝐵)
1917, 18sseqtri 3960 . 2 (𝐾‘(𝐼‘(𝐾‘𝐵))) ⊆ (𝐾‘𝐵)
201, 2, 3, 4, 8kur14lem2 36181 . . . . 5 (𝐼‘(𝐾‘𝐵)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐵))))
21 difss 4074 . . . . 5 (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐵)))) ⊆ 𝑋
2220, 21eqsstri 3958 . . . 4 (𝐼‘(𝐾‘𝐵)) ⊆ 𝑋
23 kur14lem.a . . . . . . . . 9 𝐴 ⊆ 𝑋
241, 2, 3, 4, 23kur14lem3 36182 . . . . . . . 8 (𝐾‘𝐴) ⊆ 𝑋
255fveq2i 6918 . . . . . . . . . . 11 (𝐾‘𝐵) = (𝐾‘(𝑋 ∖ (𝐾‘𝐴)))
2625difeq2i 4062 . . . . . . . . . 10 (𝑋 ∖ (𝐾‘𝐵)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐴))))
271, 2, 3, 4, 24kur14lem2 36181 . . . . . . . . . 10 (𝐼‘(𝐾‘𝐴)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐴))))
284fveq1i 6916 . . . . . . . . . 10 (𝐼‘(𝐾‘𝐴)) = ((int‘𝐽)‘(𝐾‘𝐴))
2926, 27, 283eqtr2i 2795 . . . . . . . . 9 (𝑋 ∖ (𝐾‘𝐵)) = ((int‘𝐽)‘(𝐾‘𝐴))
302ntrss2 23432 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ (𝐾‘𝐴) ⊆ 𝑋) → ((int‘𝐽)‘(𝐾‘𝐴)) ⊆ (𝐾‘𝐴))
311, 24, 30mp2an 705 . . . . . . . . 9 ((int‘𝐽)‘(𝐾‘𝐴)) ⊆ (𝐾‘𝐴)
3229, 31eqsstri 3958 . . . . . . . 8 (𝑋 ∖ (𝐾‘𝐵)) ⊆ (𝐾‘𝐴)
332clsss 23429 . . . . . . . 8 ((𝐽 ∈ Top ∧ (𝐾‘𝐴) ⊆ 𝑋 ∧ (𝑋 ∖ (𝐾‘𝐵)) ⊆ (𝐾‘𝐴)) → ((cls‘𝐽)‘(𝑋 ∖ (𝐾‘𝐵))) ⊆ ((cls‘𝐽)‘(𝐾‘𝐴)))
341, 24, 32, 33mp3an 1493 . . . . . . 7 ((cls‘𝐽)‘(𝑋 ∖ (𝐾‘𝐵))) ⊆ ((cls‘𝐽)‘(𝐾‘𝐴))
353fveq1i 6916 . . . . . . 7 (𝐾‘(𝑋 ∖ (𝐾‘𝐵))) = ((cls‘𝐽)‘(𝑋 ∖ (𝐾‘𝐵)))
361, 2, 3, 4, 23kur14lem5 36184 . . . . . . . 8 (𝐾‘(𝐾‘𝐴)) = (𝐾‘𝐴)
373fveq1i 6916 . . . . . . . 8 (𝐾‘(𝐾‘𝐴)) = ((cls‘𝐽)‘(𝐾‘𝐴))
3836, 37eqtr3i 2791 . . . . . . 7 (𝐾‘𝐴) = ((cls‘𝐽)‘(𝐾‘𝐴))
3934, 35, 383sstr4i 3963 . . . . . 6 (𝐾‘(𝑋 ∖ (𝐾‘𝐵))) ⊆ (𝐾‘𝐴)
40 sscon 4081 . . . . . 6 ((𝐾‘(𝑋 ∖ (𝐾‘𝐵))) ⊆ (𝐾‘𝐴) → (𝑋 ∖ (𝐾‘𝐴)) ⊆ (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐵)))))
4139, 40ax-mp 5 . . . . 5 (𝑋 ∖ (𝐾‘𝐴)) ⊆ (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐵))))
4241, 5, 203sstr4i 3963 . . . 4 𝐵 ⊆ (𝐼‘(𝐾‘𝐵))
432clsss 23429 . . . 4 ((𝐽 ∈ Top ∧ (𝐼‘(𝐾‘𝐵)) ⊆ 𝑋 ∧ 𝐵 ⊆ (𝐼‘(𝐾‘𝐵))) → ((cls‘𝐽)‘𝐵) ⊆ ((cls‘𝐽)‘(𝐼‘(𝐾‘𝐵))))
441, 22, 42, 43mp3an 1493 . . 3 ((cls‘𝐽)‘𝐵) ⊆ ((cls‘𝐽)‘(𝐼‘(𝐾‘𝐵)))
453fveq1i 6916 . . 3 (𝐾‘𝐵) = ((cls‘𝐽)‘𝐵)
4644, 45, 153sstr4i 3963 . 2 (𝐾‘𝐵) ⊆ (𝐾‘(𝐼‘(𝐾‘𝐵)))
4719, 46eqssi 3928 1 (𝐾‘(𝐼‘(𝐾‘𝐵))) = (𝐾‘𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1572   ∈ wcel 2150   ⊆ wss 3899   ∖ cdif 4047  ∪ cuni 4871  ‘cfv 6565  Topctop 23268  intcnt 23392  clsccl 23393
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-iin 4958  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-top 23269  df-cld 23394  df-ntr 23395  df-cls 23396
This theorem is used by:  kur14lem7  36186
  Copyright terms: Public domain W3C validator