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

Theorem llynlly 23789
Description: A locally 𝐴 space is n-locally 𝐴: the "n-locally" predicate is the weaker notion. (Contributed by Mario Carneiro, 2-Mar-2015.)
Assertion
Ref Expression
llynlly (𝐽 ∈ Locally 𝐴 → 𝐽 ∈ 𝑛-Locally 𝐴)

Proof of Theorem llynlly
Dummy variables 𝑢 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 llytop 23784 . 2 (𝐽 ∈ Locally 𝐴 → 𝐽 ∈ Top)
2 llyi 23786 . . . . 5 ((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) → ∃𝑢 ∈ 𝐽 (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))
3 simpl1 1210 . . . . . . . 8 (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝐽 ∈ Locally 𝐴)
43, 1syl 18 . . . . . . 7 (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝐽 ∈ Top)
5 simprl 783 . . . . . . 7 (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝑢 ∈ 𝐽)
6 simprr2 1241 . . . . . . 7 (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝑦 ∈ 𝑢)
7 opnneip 23430 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑢 ∈ 𝐽 ∧ 𝑦 ∈ 𝑢) → 𝑢 ∈ ((nei‘𝐽)‘{𝑦}))
84, 5, 6, 7syl3anc 1398 . . . . . 6 (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝑢 ∈ ((nei‘𝐽)‘{𝑦}))
9 simprr1 1240 . . . . . . 7 (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝑢 ⊆ 𝑥)
10 velpw 4562 . . . . . . 7 (𝑢 ∈ 𝒫 𝑥 ↔ 𝑢 ⊆ 𝑥)
119, 10sylibr 237 . . . . . 6 (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝑢 ∈ 𝒫 𝑥)
128, 11elind 4146 . . . . 5 (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥))
13 simprr3 1242 . . . . 5 (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → (𝐽 ↾t 𝑢) ∈ 𝐴)
142, 12, 13reximssdv 3181 . . . 4 ((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) → ∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽 ↾t 𝑢) ∈ 𝐴)
15143expb 1138 . . 3 ((𝐽 ∈ Locally 𝐴 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → ∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽 ↾t 𝑢) ∈ 𝐴)
1615ralrimivva 3206 . 2 (𝐽 ∈ Locally 𝐴 → ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽 ↾t 𝑢) ∈ 𝐴)
17 isnlly 23781 . 2 (𝐽 ∈ 𝑛-Locally 𝐴 ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽 ↾t 𝑢) ∈ 𝐴))
181, 16, 17sylanbrc 595 1 (𝐽 ∈ Locally 𝐴 → 𝐽 ∈ 𝑛-Locally 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087   ∩ cin 3898   ⊆ wss 3899  𝒫 cpw 4557  {csn 4584  ‘cfv 6537  (class class class)co 7418   ↾t crest 17584  Topctop 23204  neicnei 23408  Locally clly 23776  𝑛-Locally cnlly 23777
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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-top 23205  df-nei 23409  df-lly 23778  df-nlly 23779
This theorem is used by:  llyssnlly  23790  efmndtmd  24413
  Copyright terms: Public domain W3C validator