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

Theorem indiscld 22985
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 22896 . . . . 5 {∅, 𝐴} ∈ Top
2 indisuni 22897 . . . . . 6 ( I ‘𝐴) = {∅, 𝐴}
32iscld 22921 . . . . 5 ({∅, 𝐴} ∈ Top → (𝑥 ∈ (Clsd‘{∅, 𝐴}) ↔ (𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴})))
41, 3ax-mp 5 . . . 4 (𝑥 ∈ (Clsd‘{∅, 𝐴}) ↔ (𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}))
5 simpl 482 . . . . . 6 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → 𝑥 ⊆ ( I ‘𝐴))
6 dfss4 4235 . . . . . 6 (𝑥 ⊆ ( I ‘𝐴) ↔ (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = 𝑥)
75, 6sylib 218 . . . . 5 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = 𝑥)
8 simpr 484 . . . . . . 7 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴})
9 indislem 22894 . . . . . . 7 {∅, ( I ‘𝐴)} = {∅, 𝐴}
108, 9eleqtrrdi 2840 . . . . . 6 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ 𝑥) ∈ {∅, ( I ‘𝐴)})
11 elpri 4616 . . . . . 6 ((( I ‘𝐴) ∖ 𝑥) ∈ {∅, ( I ‘𝐴)} → ((( I ‘𝐴) ∖ 𝑥) = ∅ ∨ (( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴)))
12 difeq2 4086 . . . . . . . . 9 ((( I ‘𝐴) ∖ 𝑥) = ∅ → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = (( I ‘𝐴) ∖ ∅))
13 dif0 4344 . . . . . . . . 9 (( I ‘𝐴) ∖ ∅) = ( I ‘𝐴)
1412, 13eqtrdi 2781 . . . . . . . 8 ((( I ‘𝐴) ∖ 𝑥) = ∅ → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = ( I ‘𝐴))
15 fvex 6874 . . . . . . . . . 10 ( I ‘𝐴) ∈ V
1615prid2 4730 . . . . . . . . 9 ( I ‘𝐴) ∈ {∅, ( I ‘𝐴)}
1716, 9eleqtri 2827 . . . . . . . 8 ( I ‘𝐴) ∈ {∅, 𝐴}
1814, 17eqeltrdi 2837 . . . . . . 7 ((( I ‘𝐴) ∖ 𝑥) = ∅ → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
19 difeq2 4086 . . . . . . . . 9 ((( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = (( I ‘𝐴) ∖ ( I ‘𝐴)))
20 difid 4342 . . . . . . . . 9 (( I ‘𝐴) ∖ ( I ‘𝐴)) = ∅
2119, 20eqtrdi 2781 . . . . . . . 8 ((( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = ∅)
22 0ex 5265 . . . . . . . . 9 ∅ ∈ V
2322prid1 4729 . . . . . . . 8 ∅ ∈ {∅, 𝐴}
2421, 23eqeltrdi 2837 . . . . . . 7 ((( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
2518, 24jaoi 857 . . . . . 6 (((( I ‘𝐴) ∖ 𝑥) = ∅ ∨ (( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴)) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
2610, 11, 253syl 18 . . . . 5 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
277, 26eqeltrrd 2830 . . . 4 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → 𝑥 ∈ {∅, 𝐴})
284, 27sylbi 217 . . 3 (𝑥 ∈ (Clsd‘{∅, 𝐴}) → 𝑥 ∈ {∅, 𝐴})
2928ssriv 3953 . 2 (Clsd‘{∅, 𝐴}) ⊆ {∅, 𝐴}
30 0cld 22932 . . . . 5 ({∅, 𝐴} ∈ Top → ∅ ∈ (Clsd‘{∅, 𝐴}))
311, 30ax-mp 5 . . . 4 ∅ ∈ (Clsd‘{∅, 𝐴})
322topcld 22929 . . . . 5 ({∅, 𝐴} ∈ Top → ( I ‘𝐴) ∈ (Clsd‘{∅, 𝐴}))
331, 32ax-mp 5 . . . 4 ( I ‘𝐴) ∈ (Clsd‘{∅, 𝐴})
34 prssi 4788 . . . 4 ((∅ ∈ (Clsd‘{∅, 𝐴}) ∧ ( I ‘𝐴) ∈ (Clsd‘{∅, 𝐴})) → {∅, ( I ‘𝐴)} ⊆ (Clsd‘{∅, 𝐴}))
3531, 33, 34mp2an 692 . . 3 {∅, ( I ‘𝐴)} ⊆ (Clsd‘{∅, 𝐴})
369, 35eqsstrri 3997 . 2 {∅, 𝐴} ⊆ (Clsd‘{∅, 𝐴})
3729, 36eqssi 3966 1 (Clsd‘{∅, 𝐴}) = {∅, 𝐴}
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  wo 847   = wceq 1540  wcel 2109  cdif 3914  wss 3917  c0 4299  {cpr 4594   I cid 5535  cfv 6514  Topctop 22787  Clsdccld 22910
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-iota 6467  df-fun 6516  df-fv 6522  df-top 22788  df-topon 22805  df-cld 22913
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator