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 35976
Description: Lemma for kur14 35981. 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 4072 . . . . . . 7 (𝑋 ∖ (𝐾‘𝐴)) ⊆ 𝑋
75, 6eqsstri 3954 . . . . . 6 𝐵 ⊆ 𝑋
81, 2, 3, 4, 7kur14lem3 35973 . . . . 5 (𝐾‘𝐵) ⊆ 𝑋
94fveq1i 6886 . . . . . 6 (𝐼‘(𝐾‘𝐵)) = ((int‘𝐽)‘(𝐾‘𝐵))
102ntrss2 23375 . . . . . . 7 ((𝐽 ∈ Top ∧ (𝐾‘𝐵) ⊆ 𝑋) → ((int‘𝐽)‘(𝐾‘𝐵)) ⊆ (𝐾‘𝐵))
111, 8, 10mp2an 705 . . . . . 6 ((int‘𝐽)‘(𝐾‘𝐵)) ⊆ (𝐾‘𝐵)
129, 11eqsstri 3954 . . . . 5 (𝐼‘(𝐾‘𝐵)) ⊆ (𝐾‘𝐵)
132clsss 23372 . . . . 5 ((𝐽 ∈ Top ∧ (𝐾‘𝐵) ⊆ 𝑋 ∧ (𝐼‘(𝐾‘𝐵)) ⊆ (𝐾‘𝐵)) → ((cls‘𝐽)‘(𝐼‘(𝐾‘𝐵))) ⊆ ((cls‘𝐽)‘(𝐾‘𝐵)))
141, 8, 12, 13mp3an 1490 . . . 4 ((cls‘𝐽)‘(𝐼‘(𝐾‘𝐵))) ⊆ ((cls‘𝐽)‘(𝐾‘𝐵))
153fveq1i 6886 . . . 4 (𝐾‘(𝐼‘(𝐾‘𝐵))) = ((cls‘𝐽)‘(𝐼‘(𝐾‘𝐵)))
163fveq1i 6886 . . . 4 (𝐾‘(𝐾‘𝐵)) = ((cls‘𝐽)‘(𝐾‘𝐵))
1714, 15, 163sstr4i 3959 . . 3 (𝐾‘(𝐼‘(𝐾‘𝐵))) ⊆ (𝐾‘(𝐾‘𝐵))
181, 2, 3, 4, 7kur14lem5 35975 . . 3 (𝐾‘(𝐾‘𝐵)) = (𝐾‘𝐵)
1917, 18sseqtri 3956 . 2 (𝐾‘(𝐼‘(𝐾‘𝐵))) ⊆ (𝐾‘𝐵)
201, 2, 3, 4, 8kur14lem2 35972 . . . . 5 (𝐼‘(𝐾‘𝐵)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐵))))
21 difss 4072 . . . . 5 (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐵)))) ⊆ 𝑋
2220, 21eqsstri 3954 . . . 4 (𝐼‘(𝐾‘𝐵)) ⊆ 𝑋
23 kur14lem.a . . . . . . . . 9 𝐴 ⊆ 𝑋
241, 2, 3, 4, 23kur14lem3 35973 . . . . . . . 8 (𝐾‘𝐴) ⊆ 𝑋
255fveq2i 6888 . . . . . . . . . . 11 (𝐾‘𝐵) = (𝐾‘(𝑋 ∖ (𝐾‘𝐴)))
2625difeq2i 4060 . . . . . . . . . 10 (𝑋 ∖ (𝐾‘𝐵)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐴))))
271, 2, 3, 4, 24kur14lem2 35972 . . . . . . . . . 10 (𝐼‘(𝐾‘𝐴)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐴))))
284fveq1i 6886 . . . . . . . . . 10 (𝐼‘(𝐾‘𝐴)) = ((int‘𝐽)‘(𝐾‘𝐴))
2926, 27, 283eqtr2i 2789 . . . . . . . . 9 (𝑋 ∖ (𝐾‘𝐵)) = ((int‘𝐽)‘(𝐾‘𝐴))
302ntrss2 23375 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ (𝐾‘𝐴) ⊆ 𝑋) → ((int‘𝐽)‘(𝐾‘𝐴)) ⊆ (𝐾‘𝐴))
311, 24, 30mp2an 705 . . . . . . . . 9 ((int‘𝐽)‘(𝐾‘𝐴)) ⊆ (𝐾‘𝐴)
3229, 31eqsstri 3954 . . . . . . . 8 (𝑋 ∖ (𝐾‘𝐵)) ⊆ (𝐾‘𝐴)
332clsss 23372 . . . . . . . 8 ((𝐽 ∈ Top ∧ (𝐾‘𝐴) ⊆ 𝑋 ∧ (𝑋 ∖ (𝐾‘𝐵)) ⊆ (𝐾‘𝐴)) → ((cls‘𝐽)‘(𝑋 ∖ (𝐾‘𝐵))) ⊆ ((cls‘𝐽)‘(𝐾‘𝐴)))
341, 24, 32, 33mp3an 1490 . . . . . . 7 ((cls‘𝐽)‘(𝑋 ∖ (𝐾‘𝐵))) ⊆ ((cls‘𝐽)‘(𝐾‘𝐴))
353fveq1i 6886 . . . . . . 7 (𝐾‘(𝑋 ∖ (𝐾‘𝐵))) = ((cls‘𝐽)‘(𝑋 ∖ (𝐾‘𝐵)))
361, 2, 3, 4, 23kur14lem5 35975 . . . . . . . 8 (𝐾‘(𝐾‘𝐴)) = (𝐾‘𝐴)
373fveq1i 6886 . . . . . . . 8 (𝐾‘(𝐾‘𝐴)) = ((cls‘𝐽)‘(𝐾‘𝐴))
3836, 37eqtr3i 2785 . . . . . . 7 (𝐾‘𝐴) = ((cls‘𝐽)‘(𝐾‘𝐴))
3934, 35, 383sstr4i 3959 . . . . . 6 (𝐾‘(𝑋 ∖ (𝐾‘𝐵))) ⊆ (𝐾‘𝐴)
40 sscon 4079 . . . . . 6 ((𝐾‘(𝑋 ∖ (𝐾‘𝐵))) ⊆ (𝐾‘𝐴) → (𝑋 ∖ (𝐾‘𝐴)) ⊆ (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐵)))))
4139, 40ax-mp 5 . . . . 5 (𝑋 ∖ (𝐾‘𝐴)) ⊆ (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐵))))
4241, 5, 203sstr4i 3959 . . . 4 𝐵 ⊆ (𝐼‘(𝐾‘𝐵))
432clsss 23372 . . . 4 ((𝐽 ∈ Top ∧ (𝐼‘(𝐾‘𝐵)) ⊆ 𝑋 ∧ 𝐵 ⊆ (𝐼‘(𝐾‘𝐵))) → ((cls‘𝐽)‘𝐵) ⊆ ((cls‘𝐽)‘(𝐼‘(𝐾‘𝐵))))
441, 22, 42, 43mp3an 1490 . . 3 ((cls‘𝐽)‘𝐵) ⊆ ((cls‘𝐽)‘(𝐼‘(𝐾‘𝐵)))
453fveq1i 6886 . . 3 (𝐾‘𝐵) = ((cls‘𝐽)‘𝐵)
4644, 45, 153sstr4i 3959 . 2 (𝐾‘𝐵) ⊆ (𝐾‘(𝐼‘(𝐾‘𝐵)))
4719, 46eqssi 3924 1 (𝐾‘(𝐼‘(𝐾‘𝐵))) = (𝐾‘𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1569   ∈ wcel 2144   ⊆ wss 3895   ∖ cdif 4045  ∪ cuni 4866  ‘cfv 6538  Topctop 23211  intcnt 23335  clsccl 23336
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-top 23212  df-cld 23337  df-ntr 23338  df-cls 23339
This theorem is used by:  kur14lem7  35977
  Copyright terms: Public domain W3C validator