Theorem llynlly 23703

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.

Step	Hyp	Ref	Expression
1		llytop 23698	. 2 ⊢ (𝐽 ∈ Locally 𝐴 → 𝐽 ∈ Top)
2		llyi 23700	. . . . 5 ⊢ ((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) → ∃𝑢 ∈ 𝐽 (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))
3		simpl1 1210	. . . . . . . 8 ⊢ (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝐽 ∈ Locally 𝐴)
4	3, 1	syl 18	. . . . . . 7 ⊢ (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝐽 ∈ Top)
5		simprl 783	. . . . . . 7 ⊢ (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝑢 ∈ 𝐽)
6		simprr2 1241	. . . . . . 7 ⊢ (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝑦 ∈ 𝑢)
7		opnneip 23344	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑢 ∈ 𝐽 ∧ 𝑦 ∈ 𝑢) → 𝑢 ∈ ((nei‘𝐽)‘{𝑦}))
8	4, 5, 6, 7	syl3anc 1398	. . . . . 6 ⊢ (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝑢 ∈ ((nei‘𝐽)‘{𝑦}))
9		simprr1 1240	. . . . . . 7 ⊢ (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝑢 ⊆ 𝑥)
10		velpw 4562	. . . . . . 7 ⊢ (𝑢 ∈ 𝒫 𝑥 ↔ 𝑢 ⊆ 𝑥)
11	9, 10	sylibr 237	. . . . . 6 ⊢ (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝑢 ∈ 𝒫 𝑥)
12	8, 11	elind 4146	. . . . 5 ⊢ (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → 𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥))
13		simprr3 1242	. . . . 5 ⊢ (((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) ∧ (𝑢 ∈ 𝐽 ∧ (𝑢 ⊆ 𝑥 ∧ 𝑦 ∈ 𝑢 ∧ (𝐽 ↾t 𝑢) ∈ 𝐴))) → (𝐽 ↾t 𝑢) ∈ 𝐴)
14	2, 12, 13	reximssdv 3180	. . . 4 ⊢ ((𝐽 ∈ Locally 𝐴 ∧ 𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥) → ∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽 ↾t 𝑢) ∈ 𝐴)
15	14	3expb 1138	. . 3 ⊢ ((𝐽 ∈ Locally 𝐴 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝑥)) → ∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽 ↾t 𝑢) ∈ 𝐴)
16	15	ralrimivva 3205	. 2 ⊢ (𝐽 ∈ Locally 𝐴 → ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽 ↾t 𝑢) ∈ 𝐴)
17		isnlly 23695	. 2 ⊢ (𝐽 ∈ 𝑛-Locally 𝐴 ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽 ↾t 𝑢) ∈ 𝐴))
18	1, 16, 17	sylanbrc 595	1 ⊢ (𝐽 ∈ Locally 𝐴 → 𝐽 ∈ 𝑛-Locally 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086   ∩ cin 3898   ⊆ wss 3899  𝒫 cpw 4557  {csn 4584  ‘cfv 6533  (class class class)co 7413   ↾_t crest 17505  Topctop 23118  neicnei 23322  Locally clly 23690  𝑛-Locally cnlly 23691

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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  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 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416  df-top 23119  df-nei 23323  df-lly 23692  df-nlly 23693

This theorem is used by:  llyssnlly  23704  efmndtmd  24327