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 35711
Description: Lemma for kur14 35716. 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 4090 . . . . . . 7 (𝑋 ∖ (𝐾𝐴)) ⊆ 𝑋
75, 6eqsstri 3983 . . . . . 6 𝐵𝑋
81, 2, 3, 4, 7kur14lem3 35708 . . . . 5 (𝐾𝐵) ⊆ 𝑋
94fveq1i 6882 . . . . . 6 (𝐼‘(𝐾𝐵)) = ((int‘𝐽)‘(𝐾𝐵))
102ntrss2 23223 . . . . . . 7 ((𝐽 ∈ Top ∧ (𝐾𝐵) ⊆ 𝑋) → ((int‘𝐽)‘(𝐾𝐵)) ⊆ (𝐾𝐵))
111, 8, 10mp2an 704 . . . . . 6 ((int‘𝐽)‘(𝐾𝐵)) ⊆ (𝐾𝐵)
129, 11eqsstri 3983 . . . . 5 (𝐼‘(𝐾𝐵)) ⊆ (𝐾𝐵)
132clsss 23220 . . . . 5 ((𝐽 ∈ Top ∧ (𝐾𝐵) ⊆ 𝑋 ∧ (𝐼‘(𝐾𝐵)) ⊆ (𝐾𝐵)) → ((cls‘𝐽)‘(𝐼‘(𝐾𝐵))) ⊆ ((cls‘𝐽)‘(𝐾𝐵)))
141, 8, 12, 13mp3an 1490 . . . 4 ((cls‘𝐽)‘(𝐼‘(𝐾𝐵))) ⊆ ((cls‘𝐽)‘(𝐾𝐵))
153fveq1i 6882 . . . 4 (𝐾‘(𝐼‘(𝐾𝐵))) = ((cls‘𝐽)‘(𝐼‘(𝐾𝐵)))
163fveq1i 6882 . . . 4 (𝐾‘(𝐾𝐵)) = ((cls‘𝐽)‘(𝐾𝐵))
1714, 15, 163sstr4i 3988 . . 3 (𝐾‘(𝐼‘(𝐾𝐵))) ⊆ (𝐾‘(𝐾𝐵))
181, 2, 3, 4, 7kur14lem5 35710 . . 3 (𝐾‘(𝐾𝐵)) = (𝐾𝐵)
1917, 18sseqtri 3985 . 2 (𝐾‘(𝐼‘(𝐾𝐵))) ⊆ (𝐾𝐵)
201, 2, 3, 4, 8kur14lem2 35707 . . . . 5 (𝐼‘(𝐾𝐵)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐵))))
21 difss 4090 . . . . 5 (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐵)))) ⊆ 𝑋
2220, 21eqsstri 3983 . . . 4 (𝐼‘(𝐾𝐵)) ⊆ 𝑋
23 kur14lem.a . . . . . . . . 9 𝐴𝑋
241, 2, 3, 4, 23kur14lem3 35708 . . . . . . . 8 (𝐾𝐴) ⊆ 𝑋
255fveq2i 6884 . . . . . . . . . . 11 (𝐾𝐵) = (𝐾‘(𝑋 ∖ (𝐾𝐴)))
2625difeq2i 4078 . . . . . . . . . 10 (𝑋 ∖ (𝐾𝐵)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐴))))
271, 2, 3, 4, 24kur14lem2 35707 . . . . . . . . . 10 (𝐼‘(𝐾𝐴)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐴))))
284fveq1i 6882 . . . . . . . . . 10 (𝐼‘(𝐾𝐴)) = ((int‘𝐽)‘(𝐾𝐴))
2926, 27, 283eqtr2i 2792 . . . . . . . . 9 (𝑋 ∖ (𝐾𝐵)) = ((int‘𝐽)‘(𝐾𝐴))
302ntrss2 23223 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ (𝐾𝐴) ⊆ 𝑋) → ((int‘𝐽)‘(𝐾𝐴)) ⊆ (𝐾𝐴))
311, 24, 30mp2an 704 . . . . . . . . 9 ((int‘𝐽)‘(𝐾𝐴)) ⊆ (𝐾𝐴)
3229, 31eqsstri 3983 . . . . . . . 8 (𝑋 ∖ (𝐾𝐵)) ⊆ (𝐾𝐴)
332clsss 23220 . . . . . . . 8 ((𝐽 ∈ Top ∧ (𝐾𝐴) ⊆ 𝑋 ∧ (𝑋 ∖ (𝐾𝐵)) ⊆ (𝐾𝐴)) → ((cls‘𝐽)‘(𝑋 ∖ (𝐾𝐵))) ⊆ ((cls‘𝐽)‘(𝐾𝐴)))
341, 24, 32, 33mp3an 1490 . . . . . . 7 ((cls‘𝐽)‘(𝑋 ∖ (𝐾𝐵))) ⊆ ((cls‘𝐽)‘(𝐾𝐴))
353fveq1i 6882 . . . . . . 7 (𝐾‘(𝑋 ∖ (𝐾𝐵))) = ((cls‘𝐽)‘(𝑋 ∖ (𝐾𝐵)))
361, 2, 3, 4, 23kur14lem5 35710 . . . . . . . 8 (𝐾‘(𝐾𝐴)) = (𝐾𝐴)
373fveq1i 6882 . . . . . . . 8 (𝐾‘(𝐾𝐴)) = ((cls‘𝐽)‘(𝐾𝐴))
3836, 37eqtr3i 2788 . . . . . . 7 (𝐾𝐴) = ((cls‘𝐽)‘(𝐾𝐴))
3934, 35, 383sstr4i 3988 . . . . . 6 (𝐾‘(𝑋 ∖ (𝐾𝐵))) ⊆ (𝐾𝐴)
40 sscon 4097 . . . . . 6 ((𝐾‘(𝑋 ∖ (𝐾𝐵))) ⊆ (𝐾𝐴) → (𝑋 ∖ (𝐾𝐴)) ⊆ (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐵)))))
4139, 40ax-mp 5 . . . . 5 (𝑋 ∖ (𝐾𝐴)) ⊆ (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐵))))
4241, 5, 203sstr4i 3988 . . . 4 𝐵 ⊆ (𝐼‘(𝐾𝐵))
432clsss 23220 . . . 4 ((𝐽 ∈ Top ∧ (𝐼‘(𝐾𝐵)) ⊆ 𝑋𝐵 ⊆ (𝐼‘(𝐾𝐵))) → ((cls‘𝐽)‘𝐵) ⊆ ((cls‘𝐽)‘(𝐼‘(𝐾𝐵))))
441, 22, 42, 43mp3an 1490 . . 3 ((cls‘𝐽)‘𝐵) ⊆ ((cls‘𝐽)‘(𝐼‘(𝐾𝐵)))
453fveq1i 6882 . . 3 (𝐾𝐵) = ((cls‘𝐽)‘𝐵)
4644, 45, 153sstr4i 3988 . 2 (𝐾𝐵) ⊆ (𝐾‘(𝐼‘(𝐾𝐵)))
4719, 46eqssi 3953 1 (𝐾‘(𝐼‘(𝐾𝐵))) = (𝐾𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  wcel 2143  cdif 3902  wss 3905   cuni 4872  cfv 6536  Topctop 23059  intcnt 23183  clsccl 23184
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-iin 4959  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-top 23060  df-cld 23185  df-ntr 23186  df-cls 23187
This theorem is used by:  kur14lem7  35712
  Copyright terms: Public domain W3C validator