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

Theorem neissex 12348
Description: For any neighborhood 𝑁 of 𝑆, there is a neighborhood 𝑥 of 𝑆 such that 𝑁 is a neighborhood of all subsets of 𝑥. Generalization to subsets of Property Viv of [BourbakiTop1] p. I.3. (Contributed by FL, 2-Oct-2006.)
Assertion
Ref Expression
neissex ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → ∃𝑥 ∈ ((nei‘𝐽)‘𝑆)∀𝑦(𝑦𝑥𝑁 ∈ ((nei‘𝐽)‘𝑦)))
Distinct variable groups:   𝑥,𝑦,𝐽   𝑥,𝑁,𝑦   𝑥,𝑆,𝑦

Proof of Theorem neissex
StepHypRef Expression
1 neii2 12332 . 2 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → ∃𝑥𝐽 (𝑆𝑥𝑥𝑁))
2 opnneiss 12341 . . . . 5 ((𝐽 ∈ Top ∧ 𝑥𝐽𝑆𝑥) → 𝑥 ∈ ((nei‘𝐽)‘𝑆))
323expb 1182 . . . 4 ((𝐽 ∈ Top ∧ (𝑥𝐽𝑆𝑥)) → 𝑥 ∈ ((nei‘𝐽)‘𝑆))
43adantrrr 478 . . 3 ((𝐽 ∈ Top ∧ (𝑥𝐽 ∧ (𝑆𝑥𝑥𝑁))) → 𝑥 ∈ ((nei‘𝐽)‘𝑆))
54adantlr 468 . 2 (((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ (𝑥𝐽 ∧ (𝑆𝑥𝑥𝑁))) → 𝑥 ∈ ((nei‘𝐽)‘𝑆))
6 simplll 522 . . . . . 6 ((((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ (𝑥𝐽𝑥𝑁)) ∧ 𝑦𝑥) → 𝐽 ∈ Top)
7 simpll 518 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ 𝑥𝐽) → 𝐽 ∈ Top)
8 simpr 109 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ 𝑥𝐽) → 𝑥𝐽)
9 eqid 2139 . . . . . . . . . . . 12 𝐽 = 𝐽
109neii1 12330 . . . . . . . . . . 11 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → 𝑁 𝐽)
1110adantr 274 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ 𝑥𝐽) → 𝑁 𝐽)
129opnssneib 12339 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ 𝑥𝐽𝑁 𝐽) → (𝑥𝑁𝑁 ∈ ((nei‘𝐽)‘𝑥)))
137, 8, 11, 12syl3anc 1216 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ 𝑥𝐽) → (𝑥𝑁𝑁 ∈ ((nei‘𝐽)‘𝑥)))
1413biimpa 294 . . . . . . . 8 ((((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ 𝑥𝐽) ∧ 𝑥𝑁) → 𝑁 ∈ ((nei‘𝐽)‘𝑥))
1514anasss 396 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ (𝑥𝐽𝑥𝑁)) → 𝑁 ∈ ((nei‘𝐽)‘𝑥))
1615adantr 274 . . . . . 6 ((((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ (𝑥𝐽𝑥𝑁)) ∧ 𝑦𝑥) → 𝑁 ∈ ((nei‘𝐽)‘𝑥))
17 simpr 109 . . . . . 6 ((((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ (𝑥𝐽𝑥𝑁)) ∧ 𝑦𝑥) → 𝑦𝑥)
18 neiss 12333 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑥) ∧ 𝑦𝑥) → 𝑁 ∈ ((nei‘𝐽)‘𝑦))
196, 16, 17, 18syl3anc 1216 . . . . 5 ((((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ (𝑥𝐽𝑥𝑁)) ∧ 𝑦𝑥) → 𝑁 ∈ ((nei‘𝐽)‘𝑦))
2019ex 114 . . . 4 (((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ (𝑥𝐽𝑥𝑁)) → (𝑦𝑥𝑁 ∈ ((nei‘𝐽)‘𝑦)))
2120adantrrl 477 . . 3 (((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ (𝑥𝐽 ∧ (𝑆𝑥𝑥𝑁))) → (𝑦𝑥𝑁 ∈ ((nei‘𝐽)‘𝑦)))
2221alrimiv 1846 . 2 (((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ (𝑥𝐽 ∧ (𝑆𝑥𝑥𝑁))) → ∀𝑦(𝑦𝑥𝑁 ∈ ((nei‘𝐽)‘𝑦)))
231, 5, 22reximssdv 2536 1 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → ∃𝑥 ∈ ((nei‘𝐽)‘𝑆)∀𝑦(𝑦𝑥𝑁 ∈ ((nei‘𝐽)‘𝑦)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  wal 1329  wcel 1480  wrex 2417  wss 3071   cuni 3736  cfv 5123  Topctop 12178  neicnei 12321
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-pow 4098  ax-pr 4131
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-top 12179  df-nei 12322
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator