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

Theorem isclo2 23096
Description: A set 𝐴 is clopen iff for every point 𝑥 in the space there is a neighborhood 𝑦 of 𝑥 which is either disjoint from 𝐴 or contained in 𝐴. (Contributed by Mario Carneiro, 7-Jul-2015.)
Hypothesis
Ref Expression
isclo.1 𝑋 = 𝐽
Assertion
Ref Expression
isclo2 ((𝐽 ∈ Top ∧ 𝐴𝑋) → (𝐴 ∈ (𝐽 ∩ (Clsd‘𝐽)) ↔ ∀𝑥𝑋𝑦𝐽 (𝑥𝑦 ∧ ∀𝑧𝑦 (𝑧𝐴𝑦𝐴))))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐽,𝑦,𝑧   𝑥,𝑋,𝑦,𝑧

Proof of Theorem isclo2
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 isclo.1 . . 3 𝑋 = 𝐽
21isclo 23095 . 2 ((𝐽 ∈ Top ∧ 𝐴𝑋) → (𝐴 ∈ (𝐽 ∩ (Clsd‘𝐽)) ↔ ∀𝑥𝑋𝑦𝐽 (𝑥𝑦 ∧ ∀𝑧𝑦 (𝑥𝐴𝑧𝐴))))
3 eleq1w 2824 . . . . . . . . . . 11 (𝑧 = 𝑤 → (𝑧𝐴𝑤𝐴))
43bibi2d 342 . . . . . . . . . 10 (𝑧 = 𝑤 → ((𝑥𝐴𝑧𝐴) ↔ (𝑥𝐴𝑤𝐴)))
54cbvralvw 3237 . . . . . . . . 9 (∀𝑧𝑦 (𝑥𝐴𝑧𝐴) ↔ ∀𝑤𝑦 (𝑥𝐴𝑤𝐴))
65anbi2i 623 . . . . . . . 8 ((∀𝑧𝑦 (𝑥𝐴𝑧𝐴) ∧ ∀𝑧𝑦 (𝑥𝐴𝑧𝐴)) ↔ (∀𝑧𝑦 (𝑥𝐴𝑧𝐴) ∧ ∀𝑤𝑦 (𝑥𝐴𝑤𝐴)))
7 pm4.24 563 . . . . . . . 8 (∀𝑧𝑦 (𝑥𝐴𝑧𝐴) ↔ (∀𝑧𝑦 (𝑥𝐴𝑧𝐴) ∧ ∀𝑧𝑦 (𝑥𝐴𝑧𝐴)))
8 raaanv 4518 . . . . . . . 8 (∀𝑧𝑦𝑤𝑦 ((𝑥𝐴𝑧𝐴) ∧ (𝑥𝐴𝑤𝐴)) ↔ (∀𝑧𝑦 (𝑥𝐴𝑧𝐴) ∧ ∀𝑤𝑦 (𝑥𝐴𝑤𝐴)))
96, 7, 83bitr4i 303 . . . . . . 7 (∀𝑧𝑦 (𝑥𝐴𝑧𝐴) ↔ ∀𝑧𝑦𝑤𝑦 ((𝑥𝐴𝑧𝐴) ∧ (𝑥𝐴𝑤𝐴)))
10 bibi1 351 . . . . . . . . . . . . 13 ((𝑥𝐴𝑧𝐴) → ((𝑥𝐴𝑤𝐴) ↔ (𝑧𝐴𝑤𝐴)))
1110biimpa 476 . . . . . . . . . . . 12 (((𝑥𝐴𝑧𝐴) ∧ (𝑥𝐴𝑤𝐴)) → (𝑧𝐴𝑤𝐴))
1211biimpcd 249 . . . . . . . . . . 11 (𝑧𝐴 → (((𝑥𝐴𝑧𝐴) ∧ (𝑥𝐴𝑤𝐴)) → 𝑤𝐴))
1312ralimdv 3169 . . . . . . . . . 10 (𝑧𝐴 → (∀𝑤𝑦 ((𝑥𝐴𝑧𝐴) ∧ (𝑥𝐴𝑤𝐴)) → ∀𝑤𝑦 𝑤𝐴))
1413com12 32 . . . . . . . . 9 (∀𝑤𝑦 ((𝑥𝐴𝑧𝐴) ∧ (𝑥𝐴𝑤𝐴)) → (𝑧𝐴 → ∀𝑤𝑦 𝑤𝐴))
15 dfss3 3972 . . . . . . . . 9 (𝑦𝐴 ↔ ∀𝑤𝑦 𝑤𝐴)
1614, 15imbitrrdi 252 . . . . . . . 8 (∀𝑤𝑦 ((𝑥𝐴𝑧𝐴) ∧ (𝑥𝐴𝑤𝐴)) → (𝑧𝐴𝑦𝐴))
1716ralimi 3083 . . . . . . 7 (∀𝑧𝑦𝑤𝑦 ((𝑥𝐴𝑧𝐴) ∧ (𝑥𝐴𝑤𝐴)) → ∀𝑧𝑦 (𝑧𝐴𝑦𝐴))
189, 17sylbi 217 . . . . . 6 (∀𝑧𝑦 (𝑥𝐴𝑧𝐴) → ∀𝑧𝑦 (𝑧𝐴𝑦𝐴))
19 eleq1w 2824 . . . . . . . . . . 11 (𝑧 = 𝑥 → (𝑧𝐴𝑥𝐴))
2019imbi1d 341 . . . . . . . . . 10 (𝑧 = 𝑥 → ((𝑧𝐴𝑦𝐴) ↔ (𝑥𝐴𝑦𝐴)))
2120rspcv 3618 . . . . . . . . 9 (𝑥𝑦 → (∀𝑧𝑦 (𝑧𝐴𝑦𝐴) → (𝑥𝐴𝑦𝐴)))
22 dfss3 3972 . . . . . . . . . . 11 (𝑦𝐴 ↔ ∀𝑧𝑦 𝑧𝐴)
2322imbi2i 336 . . . . . . . . . 10 ((𝑥𝐴𝑦𝐴) ↔ (𝑥𝐴 → ∀𝑧𝑦 𝑧𝐴))
24 r19.21v 3180 . . . . . . . . . 10 (∀𝑧𝑦 (𝑥𝐴𝑧𝐴) ↔ (𝑥𝐴 → ∀𝑧𝑦 𝑧𝐴))
2523, 24bitr4i 278 . . . . . . . . 9 ((𝑥𝐴𝑦𝐴) ↔ ∀𝑧𝑦 (𝑥𝐴𝑧𝐴))
2621, 25imbitrdi 251 . . . . . . . 8 (𝑥𝑦 → (∀𝑧𝑦 (𝑧𝐴𝑦𝐴) → ∀𝑧𝑦 (𝑥𝐴𝑧𝐴)))
27 ssel 3977 . . . . . . . . . . 11 (𝑦𝐴 → (𝑥𝑦𝑥𝐴))
2827com12 32 . . . . . . . . . 10 (𝑥𝑦 → (𝑦𝐴𝑥𝐴))
2928imim2d 57 . . . . . . . . 9 (𝑥𝑦 → ((𝑧𝐴𝑦𝐴) → (𝑧𝐴𝑥𝐴)))
3029ralimdv 3169 . . . . . . . 8 (𝑥𝑦 → (∀𝑧𝑦 (𝑧𝐴𝑦𝐴) → ∀𝑧𝑦 (𝑧𝐴𝑥𝐴)))
3126, 30jcad 512 . . . . . . 7 (𝑥𝑦 → (∀𝑧𝑦 (𝑧𝐴𝑦𝐴) → (∀𝑧𝑦 (𝑥𝐴𝑧𝐴) ∧ ∀𝑧𝑦 (𝑧𝐴𝑥𝐴))))
32 ralbiim 3113 . . . . . . 7 (∀𝑧𝑦 (𝑥𝐴𝑧𝐴) ↔ (∀𝑧𝑦 (𝑥𝐴𝑧𝐴) ∧ ∀𝑧𝑦 (𝑧𝐴𝑥𝐴)))
3331, 32imbitrrdi 252 . . . . . 6 (𝑥𝑦 → (∀𝑧𝑦 (𝑧𝐴𝑦𝐴) → ∀𝑧𝑦 (𝑥𝐴𝑧𝐴)))
3418, 33impbid2 226 . . . . 5 (𝑥𝑦 → (∀𝑧𝑦 (𝑥𝐴𝑧𝐴) ↔ ∀𝑧𝑦 (𝑧𝐴𝑦𝐴)))
3534pm5.32i 574 . . . 4 ((𝑥𝑦 ∧ ∀𝑧𝑦 (𝑥𝐴𝑧𝐴)) ↔ (𝑥𝑦 ∧ ∀𝑧𝑦 (𝑧𝐴𝑦𝐴)))
3635rexbii 3094 . . 3 (∃𝑦𝐽 (𝑥𝑦 ∧ ∀𝑧𝑦 (𝑥𝐴𝑧𝐴)) ↔ ∃𝑦𝐽 (𝑥𝑦 ∧ ∀𝑧𝑦 (𝑧𝐴𝑦𝐴)))
3736ralbii 3093 . 2 (∀𝑥𝑋𝑦𝐽 (𝑥𝑦 ∧ ∀𝑧𝑦 (𝑥𝐴𝑧𝐴)) ↔ ∀𝑥𝑋𝑦𝐽 (𝑥𝑦 ∧ ∀𝑧𝑦 (𝑧𝐴𝑦𝐴)))
382, 37bitrdi 287 1 ((𝐽 ∈ Top ∧ 𝐴𝑋) → (𝐴 ∈ (𝐽 ∩ (Clsd‘𝐽)) ↔ ∀𝑥𝑋𝑦𝐽 (𝑥𝑦 ∧ ∀𝑧𝑦 (𝑧𝐴𝑦𝐴))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2108  wral 3061  wrex 3070  cin 3950  wss 3951   cuni 4907  cfv 6561  Topctop 22899  Clsdccld 23024
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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-iota 6514  df-fun 6563  df-fv 6569  df-topgen 17488  df-top 22900  df-cld 23027
This theorem is referenced by:  connpconn  35240
  Copyright terms: Public domain W3C validator