Users' Mathboxes Mathbox for ML < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  topdifinffin Structured version   Visualization version   GIF version

Theorem topdifinffin 37290
Description: Part of Exercise 3 of [Munkres] p. 83. The topology of all subsets 𝑥 of 𝐴 such that the complement of 𝑥 in 𝐴 is infinite, or 𝑥 is the empty set, or 𝑥 is all of 𝐴, is a topology only if 𝐴 is finite. (Contributed by ML, 17-Jul-2020.)
Hypothesis
Ref Expression
topdifinf.t 𝑇 = {𝑥 ∈ 𝒫 𝐴 ∣ (¬ (𝐴𝑥) ∈ Fin ∨ (𝑥 = ∅ ∨ 𝑥 = 𝐴))}
Assertion
Ref Expression
topdifinffin (𝑇 ∈ (TopOn‘𝐴) → 𝐴 ∈ Fin)
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝑇(𝑥)

Proof of Theorem topdifinffin
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 topdifinf.t . . 3 𝑇 = {𝑥 ∈ 𝒫 𝐴 ∣ (¬ (𝐴𝑥) ∈ Fin ∨ (𝑥 = ∅ ∨ 𝑥 = 𝐴))}
2 difeq2 4102 . . . . . . 7 (𝑥 = 𝑦 → (𝐴𝑥) = (𝐴𝑦))
32eleq1d 2818 . . . . . 6 (𝑥 = 𝑦 → ((𝐴𝑥) ∈ Fin ↔ (𝐴𝑦) ∈ Fin))
43notbid 318 . . . . 5 (𝑥 = 𝑦 → (¬ (𝐴𝑥) ∈ Fin ↔ ¬ (𝐴𝑦) ∈ Fin))
5 eqeq1 2738 . . . . . 6 (𝑥 = 𝑦 → (𝑥 = ∅ ↔ 𝑦 = ∅))
6 eqeq1 2738 . . . . . 6 (𝑥 = 𝑦 → (𝑥 = 𝐴𝑦 = 𝐴))
75, 6orbi12d 918 . . . . 5 (𝑥 = 𝑦 → ((𝑥 = ∅ ∨ 𝑥 = 𝐴) ↔ (𝑦 = ∅ ∨ 𝑦 = 𝐴)))
84, 7orbi12d 918 . . . 4 (𝑥 = 𝑦 → ((¬ (𝐴𝑥) ∈ Fin ∨ (𝑥 = ∅ ∨ 𝑥 = 𝐴)) ↔ (¬ (𝐴𝑦) ∈ Fin ∨ (𝑦 = ∅ ∨ 𝑦 = 𝐴))))
98cbvrabv 3431 . . 3 {𝑥 ∈ 𝒫 𝐴 ∣ (¬ (𝐴𝑥) ∈ Fin ∨ (𝑥 = ∅ ∨ 𝑥 = 𝐴))} = {𝑦 ∈ 𝒫 𝐴 ∣ (¬ (𝐴𝑦) ∈ Fin ∨ (𝑦 = ∅ ∨ 𝑦 = 𝐴))}
101, 9eqtri 2757 . 2 𝑇 = {𝑦 ∈ 𝒫 𝐴 ∣ (¬ (𝐴𝑦) ∈ Fin ∨ (𝑦 = ∅ ∨ 𝑦 = 𝐴))}
1110topdifinffinlem 37289 1 (𝑇 ∈ (TopOn‘𝐴) → 𝐴 ∈ Fin)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wo 847   = wceq 1539  wcel 2107  {crab 3420  cdif 3930  c0 4315  𝒫 cpw 4582  cfv 6542  Fincfn 8968  TopOnctopon 22883
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706  ax-sep 5278  ax-nul 5288  ax-pow 5347  ax-pr 5414  ax-un 7738
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3773  df-dif 3936  df-un 3938  df-in 3940  df-ss 3950  df-pss 3953  df-nul 4316  df-if 4508  df-pw 4584  df-sn 4609  df-pr 4611  df-op 4615  df-uni 4890  df-br 5126  df-opab 5188  df-mpt 5208  df-tr 5242  df-id 5560  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5673  df-rel 5674  df-cnv 5675  df-co 5676  df-dm 5677  df-rn 5678  df-res 5679  df-ima 5680  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6495  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-om 7871  df-1o 8489  df-en 8969  df-fin 8972  df-topgen 17464  df-top 22867  df-topon 22884
This theorem is referenced by:  topdifinf  37291
  Copyright terms: Public domain W3C validator