Theorem gneispacess2 44734

Description: All supersets of a neighborhood of a point (limited to the domain of the neighborhood space) are also neighborhoods of that point. (Contributed by RP, 15-Apr-2021.)

Hypothesis

Ref	Expression
gneispace.a	⊢ 𝐴 = {𝑓 ∣ (𝑓:dom 𝑓⟶(𝒫 (𝒫 dom 𝑓 ∖ {∅}) ∖ {∅}) ∧ ∀𝑝 ∈ dom 𝑓∀𝑛 ∈ (𝑓‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝑓(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝑓‘𝑝))))}

Assertion

Ref	Expression
gneispacess2	⊢ (((𝐹 ∈ 𝐴 ∧ 𝑃 ∈ dom 𝐹) ∧ (𝑁 ∈ (𝐹‘𝑃) ∧ 𝑆 ∈ 𝒫 dom 𝐹 ∧ 𝑁 ⊆ 𝑆)) → 𝑆 ∈ (𝐹‘𝑃))

Distinct variable groups:   𝑛,𝐹,𝑝,𝑓,𝑠   𝑃,𝑝,𝑛   𝑛,𝑁   𝑆,𝑠   𝑛,𝑠,𝑁   𝑠,𝑝,𝑃

Allowed substitution hints:   𝐴(𝑓,𝑛,𝑠,𝑝)   𝑃(𝑓)   𝑆(𝑓,𝑛,𝑝)   𝑁(𝑓,𝑝)

Proof of Theorem gneispacess2

Step	Hyp	Ref	Expression
1		gneispace.a	. . . . 5 ⊢ 𝐴 = {𝑓 ∣ (𝑓:dom 𝑓⟶(𝒫 (𝒫 dom 𝑓 ∖ {∅}) ∖ {∅}) ∧ ∀𝑝 ∈ dom 𝑓∀𝑛 ∈ (𝑓‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝑓(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝑓‘𝑝))))}
2	1	gneispacess 44733	. . . 4 ⊢ (𝐹 ∈ 𝐴 → ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))
3		fveq2 6871	. . . . . 6 ⊢ (𝑝 = 𝑃 → (𝐹‘𝑝) = (𝐹‘𝑃))
4	3	eleq2d 2851	. . . . . . . 8 ⊢ (𝑝 = 𝑃 → (𝑠 ∈ (𝐹‘𝑝) ↔ 𝑠 ∈ (𝐹‘𝑃)))
5	4	imbi2d 343	. . . . . . 7 ⊢ (𝑝 = 𝑃 → ((𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)) ↔ (𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑃))))
6	5	ralbidv 3188	. . . . . 6 ⊢ (𝑝 = 𝑃 → (∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)) ↔ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑃))))
7	3, 6	raleqbidv 3339	. . . . 5 ⊢ (𝑝 = 𝑃 → (∀𝑛 ∈ (𝐹‘𝑝)∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)) ↔ ∀𝑛 ∈ (𝐹‘𝑃)∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑃))))
8	7	rspccv 3581	. . . 4 ⊢ (∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)) → (𝑃 ∈ dom 𝐹 → ∀𝑛 ∈ (𝐹‘𝑃)∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑃))))
9	2, 8	syl 18	. . 3 ⊢ (𝐹 ∈ 𝐴 → (𝑃 ∈ dom 𝐹 → ∀𝑛 ∈ (𝐹‘𝑃)∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑃))))
10		sseq1 3964	. . . . . . . 8 ⊢ (𝑛 = 𝑁 → (𝑛 ⊆ 𝑠 ↔ 𝑁 ⊆ 𝑠))
11	10	imbi1d 344	. . . . . . 7 ⊢ (𝑛 = 𝑁 → ((𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑃)) ↔ (𝑁 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑃))))
12	11	ralbidv 3188	. . . . . 6 ⊢ (𝑛 = 𝑁 → (∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑃)) ↔ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑁 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑃))))
13	12	rspccv 3581	. . . . 5 ⊢ (∀𝑛 ∈ (𝐹‘𝑃)∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑃)) → (𝑁 ∈ (𝐹‘𝑃) → ∀𝑠 ∈ 𝒫 dom 𝐹(𝑁 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑃))))
14		sseq2 3965	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (𝑁 ⊆ 𝑠 ↔ 𝑁 ⊆ 𝑆))
15		eleq1 2853	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (𝑠 ∈ (𝐹‘𝑃) ↔ 𝑆 ∈ (𝐹‘𝑃)))
16	14, 15	imbi12d 347	. . . . . 6 ⊢ (𝑠 = 𝑆 → ((𝑁 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑃)) ↔ (𝑁 ⊆ 𝑆 → 𝑆 ∈ (𝐹‘𝑃))))
17	16	rspccv 3581	. . . . 5 ⊢ (∀𝑠 ∈ 𝒫 dom 𝐹(𝑁 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑃)) → (𝑆 ∈ 𝒫 dom 𝐹 → (𝑁 ⊆ 𝑆 → 𝑆 ∈ (𝐹‘𝑃))))
18	13, 17	syl6 36	. . . 4 ⊢ (∀𝑛 ∈ (𝐹‘𝑃)∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑃)) → (𝑁 ∈ (𝐹‘𝑃) → (𝑆 ∈ 𝒫 dom 𝐹 → (𝑁 ⊆ 𝑆 → 𝑆 ∈ (𝐹‘𝑃)))))
19	18	3impd 1365	. . 3 ⊢ (∀𝑛 ∈ (𝐹‘𝑃)∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑃)) → ((𝑁 ∈ (𝐹‘𝑃) ∧ 𝑆 ∈ 𝒫 dom 𝐹 ∧ 𝑁 ⊆ 𝑆) → 𝑆 ∈ (𝐹‘𝑃)))
20	9, 19	syl6 36	. 2 ⊢ (𝐹 ∈ 𝐴 → (𝑃 ∈ dom 𝐹 → ((𝑁 ∈ (𝐹‘𝑃) ∧ 𝑆 ∈ 𝒫 dom 𝐹 ∧ 𝑁 ⊆ 𝑆) → 𝑆 ∈ (𝐹‘𝑃))))
21	20	imp31 422	1 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝑃 ∈ dom 𝐹) ∧ (𝑁 ∈ (𝐹‘𝑃) ∧ 𝑆 ∈ 𝒫 dom 𝐹 ∧ 𝑁 ⊆ 𝑆)) → 𝑆 ∈ (𝐹‘𝑃))

Syntax hints:   → wi 4   ∧ wa 400   ∧ w3a 1101   = wceq 1563   ∈ wcel 2145  {cab 2743  ∀wral 3079   ∖ cdif 3904   ⊆ wss 3907  ∅c0 4288  𝒫 cpw 4558  {csn 4585  dom cdm 5652  ⟶wf 6521  ‘cfv 6525

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-fv 6533

This theorem is referenced by: (None)