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

Theorem indiscld 23120
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 23030 . . . . 5 {∅, 𝐴} ∈ Top
2 indisuni 23031 . . . . . 6 ( I ‘𝐴) = {∅, 𝐴}
32iscld 23056 . . . . 5 ({∅, 𝐴} ∈ Top → (𝑥 ∈ (Clsd‘{∅, 𝐴}) ↔ (𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴})))
41, 3ax-mp 5 . . . 4 (𝑥 ∈ (Clsd‘{∅, 𝐴}) ↔ (𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}))
5 simpl 482 . . . . . 6 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → 𝑥 ⊆ ( I ‘𝐴))
6 dfss4 4288 . . . . . 6 (𝑥 ⊆ ( I ‘𝐴) ↔ (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = 𝑥)
75, 6sylib 218 . . . . 5 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = 𝑥)
8 simpr 484 . . . . . . 7 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴})
9 indislem 23028 . . . . . . 7 {∅, ( I ‘𝐴)} = {∅, 𝐴}
108, 9eleqtrrdi 2855 . . . . . 6 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ 𝑥) ∈ {∅, ( I ‘𝐴)})
11 elpri 4671 . . . . . 6 ((( I ‘𝐴) ∖ 𝑥) ∈ {∅, ( I ‘𝐴)} → ((( I ‘𝐴) ∖ 𝑥) = ∅ ∨ (( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴)))
12 difeq2 4143 . . . . . . . . 9 ((( I ‘𝐴) ∖ 𝑥) = ∅ → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = (( I ‘𝐴) ∖ ∅))
13 dif0 4400 . . . . . . . . 9 (( I ‘𝐴) ∖ ∅) = ( I ‘𝐴)
1412, 13eqtrdi 2796 . . . . . . . 8 ((( I ‘𝐴) ∖ 𝑥) = ∅ → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = ( I ‘𝐴))
15 fvex 6933 . . . . . . . . . 10 ( I ‘𝐴) ∈ V
1615prid2 4788 . . . . . . . . 9 ( I ‘𝐴) ∈ {∅, ( I ‘𝐴)}
1716, 9eleqtri 2842 . . . . . . . 8 ( I ‘𝐴) ∈ {∅, 𝐴}
1814, 17eqeltrdi 2852 . . . . . . 7 ((( I ‘𝐴) ∖ 𝑥) = ∅ → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
19 difeq2 4143 . . . . . . . . 9 ((( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = (( I ‘𝐴) ∖ ( I ‘𝐴)))
20 difid 4398 . . . . . . . . 9 (( I ‘𝐴) ∖ ( I ‘𝐴)) = ∅
2119, 20eqtrdi 2796 . . . . . . . 8 ((( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) = ∅)
22 0ex 5325 . . . . . . . . 9 ∅ ∈ V
2322prid1 4787 . . . . . . . 8 ∅ ∈ {∅, 𝐴}
2421, 23eqeltrdi 2852 . . . . . . 7 ((( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
2518, 24jaoi 856 . . . . . 6 (((( I ‘𝐴) ∖ 𝑥) = ∅ ∨ (( I ‘𝐴) ∖ 𝑥) = ( I ‘𝐴)) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
2610, 11, 253syl 18 . . . . 5 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → (( I ‘𝐴) ∖ (( I ‘𝐴) ∖ 𝑥)) ∈ {∅, 𝐴})
277, 26eqeltrrd 2845 . . . 4 ((𝑥 ⊆ ( I ‘𝐴) ∧ (( I ‘𝐴) ∖ 𝑥) ∈ {∅, 𝐴}) → 𝑥 ∈ {∅, 𝐴})
284, 27sylbi 217 . . 3 (𝑥 ∈ (Clsd‘{∅, 𝐴}) → 𝑥 ∈ {∅, 𝐴})
2928ssriv 4012 . 2 (Clsd‘{∅, 𝐴}) ⊆ {∅, 𝐴}
30 0cld 23067 . . . . 5 ({∅, 𝐴} ∈ Top → ∅ ∈ (Clsd‘{∅, 𝐴}))
311, 30ax-mp 5 . . . 4 ∅ ∈ (Clsd‘{∅, 𝐴})
322topcld 23064 . . . . 5 ({∅, 𝐴} ∈ Top → ( I ‘𝐴) ∈ (Clsd‘{∅, 𝐴}))
331, 32ax-mp 5 . . . 4 ( I ‘𝐴) ∈ (Clsd‘{∅, 𝐴})
34 prssi 4846 . . . 4 ((∅ ∈ (Clsd‘{∅, 𝐴}) ∧ ( I ‘𝐴) ∈ (Clsd‘{∅, 𝐴})) → {∅, ( I ‘𝐴)} ⊆ (Clsd‘{∅, 𝐴}))
3531, 33, 34mp2an 691 . . 3 {∅, ( I ‘𝐴)} ⊆ (Clsd‘{∅, 𝐴})
369, 35eqsstrri 4044 . 2 {∅, 𝐴} ⊆ (Clsd‘{∅, 𝐴})
3729, 36eqssi 4025 1 (Clsd‘{∅, 𝐴}) = {∅, 𝐴}
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  wo 846   = wceq 1537  wcel 2108  cdif 3973  wss 3976  c0 4352  {cpr 4650   I cid 5592  cfv 6573  Topctop 22920  Clsdccld 23045
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-iota 6525  df-fun 6575  df-fv 6581  df-top 22921  df-topon 22938  df-cld 23048
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator