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

Theorem neiuni 14914
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 14913 . . . 4 (𝐽 ∈ Top → (𝑆𝑋𝑋 ∈ ((nei‘𝐽)‘𝑆)))
32biimpa 296 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑋 ∈ ((nei‘𝐽)‘𝑆))
4 elssuni 3922 . . 3 (𝑋 ∈ ((nei‘𝐽)‘𝑆) → 𝑋 ((nei‘𝐽)‘𝑆))
53, 4syl 14 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑋 ((nei‘𝐽)‘𝑆))
61neii1 14900 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑥 ∈ ((nei‘𝐽)‘𝑆)) → 𝑥𝑋)
76ex 115 . . . . 5 (𝐽 ∈ Top → (𝑥 ∈ ((nei‘𝐽)‘𝑆) → 𝑥𝑋))
87adantr 276 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑥 ∈ ((nei‘𝐽)‘𝑆) → 𝑥𝑋))
98ralrimiv 2603 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ∀𝑥 ∈ ((nei‘𝐽)‘𝑆)𝑥𝑋)
10 unissb 3924 . . 3 ( ((nei‘𝐽)‘𝑆) ⊆ 𝑋 ↔ ∀𝑥 ∈ ((nei‘𝐽)‘𝑆)𝑥𝑋)
119, 10sylibr 134 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((nei‘𝐽)‘𝑆) ⊆ 𝑋)
125, 11eqssd 3243 1 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑋 = ((nei‘𝐽)‘𝑆))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1397  wcel 2201  wral 2509  wss 3199   cuni 3894  cfv 5328  Topctop 14750  neicnei 14891
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2204  ax-ext 2212  ax-coll 4205  ax-sep 4208  ax-pow 4266  ax-pr 4301
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ral 2514  df-rex 2515  df-reu 2516  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-un 3203  df-in 3205  df-ss 3212  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-iun 3973  df-br 4090  df-opab 4152  df-mpt 4153  df-id 4392  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-f1 5333  df-fo 5334  df-f1o 5335  df-fv 5336  df-top 14751  df-nei 14892
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator