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

Theorem indiscld 23213
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 23124 . . . . 5 {∅, 𝐴} ∈ Top
2 indisuni 23125 . . . . . 6 ( I ‘𝐴) = {∅, 𝐴}
32iscld 23149 . . . . 5 ({∅, 𝐴} ∈ Top → (𝑥 ∈ (Clsd‘{∅, 𝐴}) ↔ (𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴})))
41, 3ax-mp 5 . . . 4 (𝑥 ∈ (Clsd‘{∅, 𝐴}) ↔ (𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}))
5 dfss4 4230 . . . . . 6 (𝑥 ⊆ ( I ‘𝐴) ↔ (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = 𝑥)
65birani 508 . . . . 5 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = 𝑥)
7 simpr 489 . . . . . . 7 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴})
8 indislem 23122 . . . . . . 7 {∅, ( I ‘𝐴)} = {∅, 𝐴}
97, 8eleqtrrdi 2880 . . . . . 6 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ 𝑥) ∈ {∅, ( I ‘𝐴)})
10 elpri 4615 . . . . . 6 ((( I ‘𝐴) ∖ 𝑥) ∈ {∅, ( I ‘𝐴)} → ((( I ‘𝐴) ∖ 𝑥) = ∅ ∨ (( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴)))
11 difeq2 4083 . . . . . . . . 9 ((( I ‘𝐴) ∖ 𝑥) = ∅ → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = (( I ‘𝐴) ∖ ∅))
12 dif0 4340 . . . . . . . . 9 (( I ‘𝐴) ∖ ∅) = ( I ‘𝐴)
1311, 12eqtrdi 2820 . . . . . . . 8 ((( I ‘𝐴) ∖ 𝑥) = ∅ → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = ( I ‘𝐴))
14 fvex 6892 . . . . . . . . . 10 ( I ‘𝐴) ∈ V
1514prid2 4731 . . . . . . . . 9 ( I ‘𝐴) ∈ {∅, ( I ‘𝐴)}
1615, 8eleqtri 2867 . . . . . . . 8 ( I ‘𝐴) ∈ {∅, 𝐴}
1713, 16eqeltrdi 2877 . . . . . . 7 ((( I ‘𝐴) ∖ 𝑥) = ∅ → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
18 difeq2 4083 . . . . . . . . 9 ((( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = (( I ‘𝐴) ∖ ( I ‘𝐴)))
19 difid 4338 . . . . . . . . 9 (( I ‘𝐴) ∖ ( I ‘𝐴)) = ∅
2018, 19eqtrdi 2820 . . . . . . . 8 ((( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = ∅)
21 0ex 5269 . . . . . . . . 9 ∅ ∈ V
2221prid1 4730 . . . . . . . 8 ∅ ∈ {∅, 𝐴}
2320, 22eqeltrdi 2877 . . . . . . 7 ((( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
2417, 23jaoi 870 . . . . . 6 (((( I ‘𝐴) ∖ 𝑥) = ∅ ∨ (( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴)) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
259, 10, 243syl 19 . . . . 5 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
266, 25eqeltrrd 2870 . . . 4 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → 𝑥 ∈ {∅, 𝐴})
274, 26sylbi 220 . . 3 (𝑥 ∈ (Clsd‘{∅, 𝐴}) → 𝑥 ∈ {∅, 𝐴})
2827ssriv 3949 . 2 (Clsd‘{∅, 𝐴}) ⊆ {∅, 𝐴}
29 0cld 23160 . . . . 5 ({∅, 𝐴} ∈ Top → ∅ ∈ (Clsd‘{∅, 𝐴}))
301, 29ax-mp 5 . . . 4 ∅ ∈ (Clsd‘{∅, 𝐴})
312topcld 23157 . . . . 5 ({∅, 𝐴} ∈ Top → ( I ‘𝐴) ∈ (Clsd‘{∅, 𝐴}))
321, 31ax-mp 5 . . . 4 ( I ‘𝐴) ∈ (Clsd‘{∅, 𝐴})
33 prssi 4788 . . . 4 ((∅ ∈ (Clsd‘{∅, 𝐴}) ∧ ( I ‘𝐴) ∈ (Clsd‘{∅, 𝐴})) → {∅, ( I ‘𝐴)} ⊆ (Clsd‘{∅, 𝐴}))
3430, 32, 33mp2an 704 . . 3 {∅, ( I ‘𝐴)} ⊆ (Clsd‘{∅, 𝐴})
358, 34eqsstrri 3992 . 2 {∅, 𝐴} ⊆ (Clsd‘{∅, 𝐴})
3628, 35eqssi 3961 1 (Clsd‘{∅, 𝐴}) = {∅, 𝐴}
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400  wo 860   = wceq 1567  wcel 2149  cdif 3910  wss 3913  c0 4294  {cpr 4593   I cid 5553  cfv 6533  Topctop 23015  Clsdccld 23138
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6489  df-fun 6535  df-fv 6541  df-top 23016  df-topon 23033  df-cld 23141
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator