ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  neiuni GIF version

Theorem neiuni 15188
Description: The union of the neighborhoods of a set equals the topology's underlying set. (Contributed by FL, 18-Sep-2007.) (Revised by Mario Carneiro, 9-Apr-2015.)
Hypothesis
Ref Expression
tpnei.1 𝑋 = 𝐽
Assertion
Ref Expression
neiuni ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑋 = ((nei‘𝐽)‘𝑆))

Proof of Theorem neiuni
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 tpnei.1 . . . . 5 𝑋 = 𝐽
21tpnei 15187 . . . 4 (𝐽 ∈ Top → (𝑆𝑋𝑋 ∈ ((nei‘𝐽)‘𝑆)))
32biimpa 296 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑋 ∈ ((nei‘𝐽)‘𝑆))
4 elssuni 3961 . . 3 (𝑋 ∈ ((nei‘𝐽)‘𝑆) → 𝑋 ((nei‘𝐽)‘𝑆))
53, 4syl 14 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑋 ((nei‘𝐽)‘𝑆))
61neii1 15174 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆)) → 𝑥𝑋)
76ex 115 . . . . 5 (𝐽 ∈ Top → (𝑥 ∈ ((nei‘𝐽)‘𝑆) → 𝑥𝑋))
87adantr 276 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑥 ∈ ((nei‘𝐽)‘𝑆) → 𝑥𝑋))
98ralrimiv 2622 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ∀𝑥 ∈ ((nei‘𝐽)‘𝑆)𝑥𝑋)
10 unissb 3963 . . 3 ( ((nei‘𝐽)‘𝑆) ⊆ 𝑋 ↔ ∀𝑥 ∈ ((nei‘𝐽)‘𝑆)𝑥𝑋)
119, 10sylibr 134 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((nei‘𝐽)‘𝑆) ⊆ 𝑋)
125, 11eqssd 3265 1 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑋 = ((nei‘𝐽)‘𝑆))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1402  wcel 2209  wral 2528  wss 3220   cuni 3933  cfv 5375  Topctop 15024  neicnei 15165
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4244  ax-sep 4247  ax-pow 4309  ax-pr 4344
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-top 15025  df-nei 15166
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator