MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  indiscld Structured version   Visualization version   GIF version

Theorem indiscld 23139
Description: The closed sets of an indiscrete topology. (Contributed by FL, 5-Jan-2009.) (Revised by Mario Carneiro, 14-Aug-2015.)
Assertion
Ref Expression
indiscld (Clsd‘{∅, 𝐴}) = {∅, 𝐴}

Proof of Theorem indiscld
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 indistop 23050 . . . . 5 {∅, 𝐴} ∈ Top
2 indisuni 23051 . . . . . 6 ( I ‘𝐴) = {∅, 𝐴}
32iscld 23075 . . . . 5 ({∅, 𝐴} ∈ Top → (𝑥 ∈ (Clsd‘{∅, 𝐴}) ↔ (𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴})))
41, 3ax-mp 5 . . . 4 (𝑥 ∈ (Clsd‘{∅, 𝐴}) ↔ (𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}))
5 dfss4 4219 . . . . . 6 (𝑥 ⊆ ( I ‘𝐴) ↔ (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = 𝑥)
65birani 507 . . . . 5 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = 𝑥)
7 simpr 488 . . . . . . 7 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴})
8 indislem 23048 . . . . . . 7 {∅, ( I ‘𝐴)} = {∅, 𝐴}
97, 8eleqtrrdi 2872 . . . . . 6 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ 𝑥) ∈ {∅, ( I ‘𝐴)})
10 elpri 4603 . . . . . 6 ((( I ‘𝐴) ∖ 𝑥) ∈ {∅, ( I ‘𝐴)} → ((( I ‘𝐴) ∖ 𝑥) = ∅ ∨ (( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴)))
11 difeq2 4072 . . . . . . . . 9 ((( I ‘𝐴) ∖ 𝑥) = ∅ → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = (( I ‘𝐴) ∖ ∅))
12 dif0 4328 . . . . . . . . 9 (( I ‘𝐴) ∖ ∅) = ( I ‘𝐴)
1311, 12eqtrdi 2812 . . . . . . . 8 ((( I ‘𝐴) ∖ 𝑥) = ∅ → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = ( I ‘𝐴))
14 fvex 6875 . . . . . . . . . 10 ( I ‘𝐴) ∈ V
1514prid2 4719 . . . . . . . . 9 ( I ‘𝐴) ∈ {∅, ( I ‘𝐴)}
1615, 8eleqtri 2859 . . . . . . . 8 ( I ‘𝐴) ∈ {∅, 𝐴}
1713, 16eqeltrdi 2869 . . . . . . 7 ((( I ‘𝐴) ∖ 𝑥) = ∅ → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
18 difeq2 4072 . . . . . . . . 9 ((( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = (( I ‘𝐴) ∖ ( I ‘𝐴)))
19 difid 4326 . . . . . . . . 9 (( I ‘𝐴) ∖ ( I ‘𝐴)) = ∅
2018, 19eqtrdi 2812 . . . . . . . 8 ((( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = ∅)
21 0ex 5254 . . . . . . . . 9 ∅ ∈ V
2221prid1 4718 . . . . . . . 8 ∅ ∈ {∅, 𝐴}
2320, 22eqeltrdi 2869 . . . . . . 7 ((( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
2417, 23jaoi 868 . . . . . 6 (((( I ‘𝐴) ∖ 𝑥) = ∅ ∨ (( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴)) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
259, 10, 243syl 18 . . . . 5 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
266, 25eqeltrrd 2862 . . . 4 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → 𝑥 ∈ {∅, 𝐴})
274, 26sylbi 219 . . 3 (𝑥 ∈ (Clsd‘{∅, 𝐴}) → 𝑥 ∈ {∅, 𝐴})
2827ssriv 3938 . 2 (Clsd‘{∅, 𝐴}) ⊆ {∅, 𝐴}
29 0cld 23086 . . . . 5 ({∅, 𝐴} ∈ Top → ∅ ∈ (Clsd‘{∅, 𝐴}))
301, 29ax-mp 5 . . . 4 ∅ ∈ (Clsd‘{∅, 𝐴})
312topcld 23083 . . . . 5 ({∅, 𝐴} ∈ Top → ( I ‘𝐴) ∈ (Clsd‘{∅, 𝐴}))
321, 31ax-mp 5 . . . 4 ( I ‘𝐴) ∈ (Clsd‘{∅, 𝐴})
33 prssi 4776 . . . 4 ((∅ ∈ (Clsd‘{∅, 𝐴}) ∧ ( I ‘𝐴) ∈ (Clsd‘{∅, 𝐴})) → {∅, ( I ‘𝐴)} ⊆ (Clsd‘{∅, 𝐴}))
3430, 32, 33mp2an 702 . . 3 {∅, ( I ‘𝐴)} ⊆ (Clsd‘{∅, 𝐴})
358, 34eqsstrri 3981 . 2 {∅, 𝐴} ⊆ (Clsd‘{∅, 𝐴})
3628, 35eqssi 3950 1 (Clsd‘{∅, 𝐴}) = {∅, 𝐴}
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 399  wo 858   = wceq 1559  wcel 2141  cdif 3899  wss 3902  c0 4283  {cpr 4581   I cid 5537  cfv 6516  Topctop 22941  Clsdccld 23064
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7713
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-iota 6472  df-fun 6518  df-fv 6524  df-top 22942  df-topon 22959  df-cld 23067
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator