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 38191
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 4067 . . . . . . 7 (𝑥 = 𝑦 → (𝐴𝑥) = (𝐴𝑦))
32eleq1d 2845 . . . . . 6 (𝑥 = 𝑦 → ((𝐴𝑥) ∈ Fin ↔ (𝐴𝑦) ∈ Fin))
43notbid 321 . . . . 5 (𝑥 = 𝑦 → (¬ (𝐴𝑥) ∈ Fin ↔ ¬ (𝐴𝑦) ∈ Fin))
5 eqeq1 2764 . . . . . 6 (𝑥 = 𝑦 → (𝑥 = ∅ ↔ 𝑦 = ∅))
6 eqeq1 2764 . . . . . 6 (𝑥 = 𝑦 → (𝑥 = 𝐴𝑦 = 𝐴))
75, 6orbi12d 932 . . . . 5 (𝑥 = 𝑦 → ((𝑥 = ∅ ∨ 𝑥 = 𝐴) ↔ (𝑦 = ∅ ∨ 𝑦 = 𝐴)))
84, 7orbi12d 932 . . . 4 (𝑥 = 𝑦 → ((¬ (𝐴𝑥) ∈ Fin ∨ (𝑥 = ∅ ∨ 𝑥 = 𝐴)) ↔ (¬ (𝐴𝑦) ∈ Fin ∨ (𝑦 = ∅ ∨ 𝑦 = 𝐴))))
98cbvrabv 3422 . . 3 {𝑥 ∈ 𝒫 𝐴 ∣ (¬ (𝐴𝑥) ∈ Fin ∨ (𝑥 = ∅ ∨ 𝑥 = 𝐴))} = {𝑦 ∈ 𝒫 𝐴 ∣ (¬ (𝐴𝑦) ∈ Fin ∨ (𝑦 = ∅ ∨ 𝑦 = 𝐴))}
101, 9eqtri 2783 . 2 𝑇 = {𝑦 ∈ 𝒫 𝐴 ∣ (¬ (𝐴𝑦) ∈ Fin ∨ (𝑦 = ∅ ∨ 𝑦 = 𝐴))}
1110topdifinffinlem 38190 1 (𝑇 ∈ (TopOn‘𝐴) → 𝐴 ∈ Fin)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wo 861   = wceq 1570  wcel 2145  {crab 3412  cdif 3895  c0 4278  𝒫 cpw 4556  cfv 6527  Fincfn 8951  TopOnctopon 23189
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-ord 6354  df-on 6355  df-lim 6356  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-om 7861  df-1o 8454  df-en 8952  df-fin 8955  df-topgen 17575  df-top 23173  df-topon 23190
This theorem is used by:  topdifinf  38192
  Copyright terms: Public domain W3C validator