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

Theorem llynlly 21090
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 21085 . 2 (𝐽 ∈ Locally 𝐴𝐽 ∈ Top)
2 llyi 21087 . . . . 5 ((𝐽 ∈ Locally 𝐴𝑥𝐽𝑦𝑥) → ∃𝑢𝐽 (𝑢𝑥𝑦𝑢 ∧ (𝐽t 𝑢) ∈ 𝐴))
3 simpl1 1057 . . . . . . . . . . 11 (((𝐽 ∈ Locally 𝐴𝑥𝐽𝑦𝑥) ∧ (𝑢𝐽 ∧ (𝑢𝑥𝑦𝑢 ∧ (𝐽t 𝑢) ∈ 𝐴))) → 𝐽 ∈ Locally 𝐴)
43, 1syl 17 . . . . . . . . . 10 (((𝐽 ∈ Locally 𝐴𝑥𝐽𝑦𝑥) ∧ (𝑢𝐽 ∧ (𝑢𝑥𝑦𝑢 ∧ (𝐽t 𝑢) ∈ 𝐴))) → 𝐽 ∈ Top)
5 simprl 790 . . . . . . . . . 10 (((𝐽 ∈ Locally 𝐴𝑥𝐽𝑦𝑥) ∧ (𝑢𝐽 ∧ (𝑢𝑥𝑦𝑢 ∧ (𝐽t 𝑢) ∈ 𝐴))) → 𝑢𝐽)
6 simprr2 1103 . . . . . . . . . 10 (((𝐽 ∈ Locally 𝐴𝑥𝐽𝑦𝑥) ∧ (𝑢𝐽 ∧ (𝑢𝑥𝑦𝑢 ∧ (𝐽t 𝑢) ∈ 𝐴))) → 𝑦𝑢)
7 opnneip 20733 . . . . . . . . . 10 ((𝐽 ∈ Top ∧ 𝑢𝐽𝑦𝑢) → 𝑢 ∈ ((nei‘𝐽)‘{𝑦}))
84, 5, 6, 7syl3anc 1318 . . . . . . . . 9 (((𝐽 ∈ Locally 𝐴𝑥𝐽𝑦𝑥) ∧ (𝑢𝐽 ∧ (𝑢𝑥𝑦𝑢 ∧ (𝐽t 𝑢) ∈ 𝐴))) → 𝑢 ∈ ((nei‘𝐽)‘{𝑦}))
9 simprr1 1102 . . . . . . . . . 10 (((𝐽 ∈ Locally 𝐴𝑥𝐽𝑦𝑥) ∧ (𝑢𝐽 ∧ (𝑢𝑥𝑦𝑢 ∧ (𝐽t 𝑢) ∈ 𝐴))) → 𝑢𝑥)
10 selpw 4115 . . . . . . . . . 10 (𝑢 ∈ 𝒫 𝑥𝑢𝑥)
119, 10sylibr 223 . . . . . . . . 9 (((𝐽 ∈ Locally 𝐴𝑥𝐽𝑦𝑥) ∧ (𝑢𝐽 ∧ (𝑢𝑥𝑦𝑢 ∧ (𝐽t 𝑢) ∈ 𝐴))) → 𝑢 ∈ 𝒫 𝑥)
128, 11elind 3760 . . . . . . . 8 (((𝐽 ∈ Locally 𝐴𝑥𝐽𝑦𝑥) ∧ (𝑢𝐽 ∧ (𝑢𝑥𝑦𝑢 ∧ (𝐽t 𝑢) ∈ 𝐴))) → 𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥))
13 simprr3 1104 . . . . . . . 8 (((𝐽 ∈ Locally 𝐴𝑥𝐽𝑦𝑥) ∧ (𝑢𝐽 ∧ (𝑢𝑥𝑦𝑢 ∧ (𝐽t 𝑢) ∈ 𝐴))) → (𝐽t 𝑢) ∈ 𝐴)
1412, 13jca 553 . . . . . . 7 (((𝐽 ∈ Locally 𝐴𝑥𝐽𝑦𝑥) ∧ (𝑢𝐽 ∧ (𝑢𝑥𝑦𝑢 ∧ (𝐽t 𝑢) ∈ 𝐴))) → (𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥) ∧ (𝐽t 𝑢) ∈ 𝐴))
1514ex 449 . . . . . 6 ((𝐽 ∈ Locally 𝐴𝑥𝐽𝑦𝑥) → ((𝑢𝐽 ∧ (𝑢𝑥𝑦𝑢 ∧ (𝐽t 𝑢) ∈ 𝐴)) → (𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥) ∧ (𝐽t 𝑢) ∈ 𝐴)))
1615reximdv2 2997 . . . . 5 ((𝐽 ∈ Locally 𝐴𝑥𝐽𝑦𝑥) → (∃𝑢𝐽 (𝑢𝑥𝑦𝑢 ∧ (𝐽t 𝑢) ∈ 𝐴) → ∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽t 𝑢) ∈ 𝐴))
172, 16mpd 15 . . . 4 ((𝐽 ∈ Locally 𝐴𝑥𝐽𝑦𝑥) → ∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽t 𝑢) ∈ 𝐴)
18173expb 1258 . . 3 ((𝐽 ∈ Locally 𝐴 ∧ (𝑥𝐽𝑦𝑥)) → ∃𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽t 𝑢) ∈ 𝐴)
1918ralrimivva 2954 . 2 (𝐽 ∈ Locally 𝐴 → ∀𝑥𝐽𝑦𝑥𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽t 𝑢) ∈ 𝐴)
20 isnlly 21082 . 2 (𝐽 ∈ 𝑛-Locally 𝐴 ↔ (𝐽 ∈ Top ∧ ∀𝑥𝐽𝑦𝑥𝑢 ∈ (((nei‘𝐽)‘{𝑦}) ∩ 𝒫 𝑥)(𝐽t 𝑢) ∈ 𝐴))
211, 19, 20sylanbrc 695 1 (𝐽 ∈ Locally 𝐴𝐽 ∈ 𝑛-Locally 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  w3a 1031  wcel 1977  wral 2896  wrex 2897  cin 3539  wss 3540  𝒫 cpw 4108  {csn 4125  cfv 5804  (class class class)co 6549  t crest 15904  Topctop 20517  neicnei 20711  Locally clly 21077  𝑛-Locally cnlly 21078
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-top 20521  df-nei 20712  df-lly 21079  df-nlly 21080
This theorem is referenced by:  llyssnlly  21091  symgtgp  21715
  Copyright terms: Public domain W3C validator