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

Theorem llynlly 23851
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 23846 . 2 (𝐽 ∈ Locally 𝐴 → 𝐽 ∈ Top)
2 llyi 23848 . . . . 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 23492 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑢 ∈ 𝐽 ∧ 𝑦 ∈ 𝑢) → 𝑢 ∈ ((nei‘𝐽)‘{𝑦}))
84, 5, 6, 7syl3anc 1399 . . . . . 6 (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝑢 ∈ ((nei‘𝐽)‘{𝑦}))
9 simprr1 1240 . . . . . . 7 (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝑢 ⊆ 𝑥)
10 velpw 4565 . . . . . . 7 (𝑢 ∈ 𝒫 𝑥 ↔ 𝑢 ⊆ 𝑥)
119, 10sylibr 237 . . . . . 6 (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝑢 ∈ 𝒫 𝑥)
128, 11elind 4100 . . . . 5 (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥))
13 simprr3 1242 . . . . 5 (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → (𝐽 ↾t 𝑢) ∈ 𝐴)
142, 12, 13reximssdv 3184 . . . 4 ((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) → ∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽 ↾t 𝑢) ∈ 𝐴)
15143expb 1138 . . 3 ((𝐽 ∈ Locally 𝐴 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → ∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽 ↾t 𝑢) ∈ 𝐴)
1615ralrimivva 3209 . 2 (𝐽 ∈ Locally 𝐴 → ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽 ↾t 𝑢) ∈ 𝐴)
17 isnlly 23843 . 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 2147  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900   ∩ cin 4092  𝒫 cpw 4560  {csn 4588  ‘cfv 6566  (class class class)co 7451   ↾t crest 17641  Topctop 23266  neicnei 23470  Locally clly 23838  𝑛-Locally cnlly 23839
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-top 23267  df-nei 23471  df-lly 23840  df-nlly 23841
This theorem is used by:  llyssnlly  23852  efmndtmd  24475
  Copyright terms: Public domain W3C validator