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 36142
Description: Lemma for kur14 36147. 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 4075 . . . . . . 7 (𝑋 ∖ (𝐾‘𝐴)) ⊆ 𝑋
75, 6eqsstri 3959 . . . . . 6 𝐵 ⊆ 𝑋
81, 2, 3, 4, 7kur14lem3 36139 . . . . 5 (𝐾‘𝐵) ⊆ 𝑋
94fveq1i 6906 . . . . . 6 (𝐼‘(𝐾‘𝐵)) = ((int‘𝐽)‘(𝐾‘𝐵))
102ntrss2 23402 . . . . . . 7 ((𝐽 ∈ Top ∧ (𝐾‘𝐵) ⊆ 𝑋) → ((int‘𝐽)‘(𝐾‘𝐵)) ⊆ (𝐾‘𝐵))
111, 8, 10mp2an 705 . . . . . 6 ((int‘𝐽)‘(𝐾‘𝐵)) ⊆ (𝐾‘𝐵)
129, 11eqsstri 3959 . . . . 5 (𝐼‘(𝐾‘𝐵)) ⊆ (𝐾‘𝐵)
132clsss 23399 . . . . 5 ((𝐽 ∈ Top ∧ (𝐾‘𝐵) ⊆ 𝑋 ∧ (𝐼‘(𝐾‘𝐵)) ⊆ (𝐾‘𝐵)) → ((cls‘𝐽)‘(𝐼‘(𝐾‘𝐵))) ⊆ ((cls‘𝐽)‘(𝐾‘𝐵)))
141, 8, 12, 13mp3an 1491 . . . 4 ((cls‘𝐽)‘(𝐼‘(𝐾‘𝐵))) ⊆ ((cls‘𝐽)‘(𝐾‘𝐵))
153fveq1i 6906 . . . 4 (𝐾‘(𝐼‘(𝐾‘𝐵))) = ((cls‘𝐽)‘(𝐼‘(𝐾‘𝐵)))
163fveq1i 6906 . . . 4 (𝐾‘(𝐾‘𝐵)) = ((cls‘𝐽)‘(𝐾‘𝐵))
1714, 15, 163sstr4i 3964 . . 3 (𝐾‘(𝐼‘(𝐾‘𝐵))) ⊆ (𝐾‘(𝐾‘𝐵))
181, 2, 3, 4, 7kur14lem5 36141 . . 3 (𝐾‘(𝐾‘𝐵)) = (𝐾‘𝐵)
1917, 18sseqtri 3961 . 2 (𝐾‘(𝐼‘(𝐾‘𝐵))) ⊆ (𝐾‘𝐵)
201, 2, 3, 4, 8kur14lem2 36138 . . . . 5 (𝐼‘(𝐾‘𝐵)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐵))))
21 difss 4075 . . . . 5 (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐵)))) ⊆ 𝑋
2220, 21eqsstri 3959 . . . 4 (𝐼‘(𝐾‘𝐵)) ⊆ 𝑋
23 kur14lem.a . . . . . . . . 9 𝐴 ⊆ 𝑋
241, 2, 3, 4, 23kur14lem3 36139 . . . . . . . 8 (𝐾‘𝐴) ⊆ 𝑋
255fveq2i 6908 . . . . . . . . . . 11 (𝐾‘𝐵) = (𝐾‘(𝑋 ∖ (𝐾‘𝐴)))
2625difeq2i 4063 . . . . . . . . . 10 (𝑋 ∖ (𝐾‘𝐵)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐴))))
271, 2, 3, 4, 24kur14lem2 36138 . . . . . . . . . 10 (𝐼‘(𝐾‘𝐴)) = (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐴))))
284fveq1i 6906 . . . . . . . . . 10 (𝐼‘(𝐾‘𝐴)) = ((int‘𝐽)‘(𝐾‘𝐴))
2926, 27, 283eqtr2i 2792 . . . . . . . . 9 (𝑋 ∖ (𝐾‘𝐵)) = ((int‘𝐽)‘(𝐾‘𝐴))
302ntrss2 23402 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ (𝐾‘𝐴) ⊆ 𝑋) → ((int‘𝐽)‘(𝐾‘𝐴)) ⊆ (𝐾‘𝐴))
311, 24, 30mp2an 705 . . . . . . . . 9 ((int‘𝐽)‘(𝐾‘𝐴)) ⊆ (𝐾‘𝐴)
3229, 31eqsstri 3959 . . . . . . . 8 (𝑋 ∖ (𝐾‘𝐵)) ⊆ (𝐾‘𝐴)
332clsss 23399 . . . . . . . 8 ((𝐽 ∈ Top ∧ (𝐾‘𝐴) ⊆ 𝑋 ∧ (𝑋 ∖ (𝐾‘𝐵)) ⊆ (𝐾‘𝐴)) → ((cls‘𝐽)‘(𝑋 ∖ (𝐾‘𝐵))) ⊆ ((cls‘𝐽)‘(𝐾‘𝐴)))
341, 24, 32, 33mp3an 1491 . . . . . . 7 ((cls‘𝐽)‘(𝑋 ∖ (𝐾‘𝐵))) ⊆ ((cls‘𝐽)‘(𝐾‘𝐴))
353fveq1i 6906 . . . . . . 7 (𝐾‘(𝑋 ∖ (𝐾‘𝐵))) = ((cls‘𝐽)‘(𝑋 ∖ (𝐾‘𝐵)))
361, 2, 3, 4, 23kur14lem5 36141 . . . . . . . 8 (𝐾‘(𝐾‘𝐴)) = (𝐾‘𝐴)
373fveq1i 6906 . . . . . . . 8 (𝐾‘(𝐾‘𝐴)) = ((cls‘𝐽)‘(𝐾‘𝐴))
3836, 37eqtr3i 2788 . . . . . . 7 (𝐾‘𝐴) = ((cls‘𝐽)‘(𝐾‘𝐴))
3934, 35, 383sstr4i 3964 . . . . . 6 (𝐾‘(𝑋 ∖ (𝐾‘𝐵))) ⊆ (𝐾‘𝐴)
40 sscon 4082 . . . . . 6 ((𝐾‘(𝑋 ∖ (𝐾‘𝐵))) ⊆ (𝐾‘𝐴) → (𝑋 ∖ (𝐾‘𝐴)) ⊆ (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐵)))))
4139, 40ax-mp 5 . . . . 5 (𝑋 ∖ (𝐾‘𝐴)) ⊆ (𝑋 ∖ (𝐾‘(𝑋 ∖ (𝐾‘𝐵))))
4241, 5, 203sstr4i 3964 . . . 4 𝐵 ⊆ (𝐼‘(𝐾‘𝐵))
432clsss 23399 . . . 4 ((𝐽 ∈ Top ∧ (𝐼‘(𝐾‘𝐵)) ⊆ 𝑋 ∧ 𝐵 ⊆ (𝐼‘(𝐾‘𝐵))) → ((cls‘𝐽)‘𝐵) ⊆ ((cls‘𝐽)‘(𝐼‘(𝐾‘𝐵))))
441, 22, 42, 43mp3an 1491 . . 3 ((cls‘𝐽)‘𝐵) ⊆ ((cls‘𝐽)‘(𝐼‘(𝐾‘𝐵)))
453fveq1i 6906 . . 3 (𝐾‘𝐵) = ((cls‘𝐽)‘𝐵)
4644, 45, 153sstr4i 3964 . 2 (𝐾‘𝐵) ⊆ (𝐾‘(𝐼‘(𝐾‘𝐵)))
4719, 46eqssi 3929 1 (𝐾‘(𝐼‘(𝐾‘𝐵))) = (𝐾‘𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   ∖ cdif 4048  ∪ cuni 4870  ‘cfv 6555  Topctop 23238  intcnt 23362  clsccl 23363
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5171  df-mpt 5190  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 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-top 23239  df-cld 23364  df-ntr 23365  df-cls 23366
This theorem is used by:  kur14lem7  36143
  Copyright terms: Public domain W3C validator