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 32571
Description: Lemma for kur14 32576. 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 4059 . . . . . . 7 (𝑋 ∖ (𝐾𝐴)) ⊆ 𝑋
75, 6eqsstri 3949 . . . . . 6 𝐵𝑋
81, 2, 3, 4, 7kur14lem3 32568 . . . . 5 (𝐾𝐵) ⊆ 𝑋
94fveq1i 6646 . . . . . 6 (𝐼‘(𝐾𝐵)) = ((int‘𝐽)‘(𝐾𝐵))
102ntrss2 21662 . . . . . . 7 ((𝐽 ∈ Top ∧ (𝐾𝐵) ⊆ 𝑋) → ((int‘𝐽)‘(𝐾𝐵)) ⊆ (𝐾𝐵))
111, 8, 10mp2an 691 . . . . . 6 ((int‘𝐽)‘(𝐾𝐵)) ⊆ (𝐾𝐵)
129, 11eqsstri 3949 . . . . 5 (𝐼‘(𝐾𝐵)) ⊆ (𝐾𝐵)
132clsss 21659 . . . . 5 ((𝐽 ∈ Top ∧ (𝐾𝐵) ⊆ 𝑋 ∧ (𝐼‘(𝐾𝐵)) ⊆ (𝐾𝐵)) → ((cls‘𝐽)‘(𝐼‘(𝐾𝐵))) ⊆ ((cls‘𝐽)‘(𝐾𝐵)))
141, 8, 12, 13mp3an 1458 . . . 4 ((cls‘𝐽)‘(𝐼‘(𝐾𝐵))) ⊆ ((cls‘𝐽)‘(𝐾𝐵))
153fveq1i 6646 . . . 4 (𝐾‘(𝐼‘(𝐾𝐵))) = ((cls‘𝐽)‘(𝐼‘(𝐾𝐵)))
163fveq1i 6646 . . . 4 (𝐾‘(𝐾𝐵)) = ((cls‘𝐽)‘(𝐾𝐵))
1714, 15, 163sstr4i 3958 . . 3 (𝐾‘(𝐼‘(𝐾𝐵))) ⊆ (𝐾‘(𝐾𝐵))
181, 2, 3, 4, 7kur14lem5 32570 . . 3 (𝐾‘(𝐾𝐵)) = (𝐾𝐵)
1917, 18sseqtri 3951 . 2 (𝐾‘(𝐼‘(𝐾𝐵))) ⊆ (𝐾𝐵)
201, 2, 3, 4, 8kur14lem2 32567 . . . . 5 (𝐼‘(𝐾𝐵)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐵))))
21 difss 4059 . . . . 5 (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐵)))) ⊆ 𝑋
2220, 21eqsstri 3949 . . . 4 (𝐼‘(𝐾𝐵)) ⊆ 𝑋
23 kur14lem.a . . . . . . . . 9 𝐴𝑋
241, 2, 3, 4, 23kur14lem3 32568 . . . . . . . 8 (𝐾𝐴) ⊆ 𝑋
255fveq2i 6648 . . . . . . . . . . 11 (𝐾𝐵) = (𝐾‘(𝑋 ∖ (𝐾𝐴)))
2625difeq2i 4047 . . . . . . . . . 10 (𝑋 ∖ (𝐾𝐵)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐴))))
271, 2, 3, 4, 24kur14lem2 32567 . . . . . . . . . 10 (𝐼‘(𝐾𝐴)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐴))))
284fveq1i 6646 . . . . . . . . . 10 (𝐼‘(𝐾𝐴)) = ((int‘𝐽)‘(𝐾𝐴))
2926, 27, 283eqtr2i 2827 . . . . . . . . 9 (𝑋 ∖ (𝐾𝐵)) = ((int‘𝐽)‘(𝐾𝐴))
302ntrss2 21662 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ (𝐾𝐴) ⊆ 𝑋) → ((int‘𝐽)‘(𝐾𝐴)) ⊆ (𝐾𝐴))
311, 24, 30mp2an 691 . . . . . . . . 9 ((int‘𝐽)‘(𝐾𝐴)) ⊆ (𝐾𝐴)
3229, 31eqsstri 3949 . . . . . . . 8 (𝑋 ∖ (𝐾𝐵)) ⊆ (𝐾𝐴)
332clsss 21659 . . . . . . . 8 ((𝐽 ∈ Top ∧ (𝐾𝐴) ⊆ 𝑋 ∧ (𝑋 ∖ (𝐾𝐵)) ⊆ (𝐾𝐴)) → ((cls‘𝐽)‘(𝑋 ∖ (𝐾𝐵))) ⊆ ((cls‘𝐽)‘(𝐾𝐴)))
341, 24, 32, 33mp3an 1458 . . . . . . 7 ((cls‘𝐽)‘(𝑋 ∖ (𝐾𝐵))) ⊆ ((cls‘𝐽)‘(𝐾𝐴))
353fveq1i 6646 . . . . . . 7 (𝐾‘(𝑋 ∖ (𝐾𝐵))) = ((cls‘𝐽)‘(𝑋 ∖ (𝐾𝐵)))
361, 2, 3, 4, 23kur14lem5 32570 . . . . . . . 8 (𝐾‘(𝐾𝐴)) = (𝐾𝐴)
373fveq1i 6646 . . . . . . . 8 (𝐾‘(𝐾𝐴)) = ((cls‘𝐽)‘(𝐾𝐴))
3836, 37eqtr3i 2823 . . . . . . 7 (𝐾𝐴) = ((cls‘𝐽)‘(𝐾𝐴))
3934, 35, 383sstr4i 3958 . . . . . 6 (𝐾‘(𝑋 ∖ (𝐾𝐵))) ⊆ (𝐾𝐴)
40 sscon 4066 . . . . . 6 ((𝐾‘(𝑋 ∖ (𝐾𝐵))) ⊆ (𝐾𝐴) → (𝑋 ∖ (𝐾𝐴)) ⊆ (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐵)))))
4139, 40ax-mp 5 . . . . 5 (𝑋 ∖ (𝐾𝐴)) ⊆ (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾𝐵))))
4241, 5, 203sstr4i 3958 . . . 4 𝐵 ⊆ (𝐼‘(𝐾𝐵))
432clsss 21659 . . . 4 ((𝐽 ∈ Top ∧ (𝐼‘(𝐾𝐵)) ⊆ 𝑋𝐵 ⊆ (𝐼‘(𝐾𝐵))) → ((cls‘𝐽)‘𝐵) ⊆ ((cls‘𝐽)‘(𝐼‘(𝐾𝐵))))
441, 22, 42, 43mp3an 1458 . . 3 ((cls‘𝐽)‘𝐵) ⊆ ((cls‘𝐽)‘(𝐼‘(𝐾𝐵)))
453fveq1i 6646 . . 3 (𝐾𝐵) = ((cls‘𝐽)‘𝐵)
4644, 45, 153sstr4i 3958 . 2 (𝐾𝐵) ⊆ (𝐾‘(𝐼‘(𝐾𝐵)))
4719, 46eqssi 3931 1 (𝐾‘(𝐼‘(𝐾𝐵))) = (𝐾𝐵)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1538  wcel 2111  cdif 3878  wss 3881   cuni 4800  cfv 6324  Topctop 21498  intcnt 21622  clsccl 21623
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-iin 4884  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-top 21499  df-cld 21624  df-ntr 21625  df-cls 21626
This theorem is referenced by:  kur14lem7  32572
  Copyright terms: Public domain W3C validator