Theorem ntrneineine0lem 41693

Description: If (pseudo-)interior and (pseudo-)neighborhood functions are related by the operator, 𝐹, then conditions equal to claiming that for every point, at least one (pseudo-)neighborbood exists hold equally. (Contributed by RP, 29-May-2021.)

Hypotheses

Ref	Expression
ntrnei.o	⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
ntrnei.f	⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
ntrnei.r	⊢ (𝜑 → 𝐼𝐹𝑁)
ntrnei.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)

Assertion

Ref	Expression
ntrneineine0lem	⊢ (𝜑 → (∃𝑠 ∈ 𝒫 𝐵𝑋 ∈ (𝐼‘𝑠) ↔ (𝑁‘𝑋) ≠ ∅))

Distinct variable groups:   𝐵,𝑖,𝑗,𝑘,𝑙,𝑚   𝑘,𝐼,𝑙,𝑚   𝑁,𝑠   𝑋,𝑙,𝑚,𝑠   𝜑,𝑖,𝑗,𝑘,𝑙,𝑠

Allowed substitution hints:   𝜑(𝑚)   𝐵(𝑠)   𝐹(𝑖,𝑗,𝑘,𝑚,𝑠,𝑙)   𝐼(𝑖,𝑗,𝑠)   𝑁(𝑖,𝑗,𝑘,𝑚,𝑙)   𝑂(𝑖,𝑗,𝑘,𝑚,𝑠,𝑙)   𝑋(𝑖,𝑗,𝑘)

Proof of Theorem ntrneineine0lem

Step	Hyp	Ref	Expression
1		ntrnei.o	. . . 4 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
2		ntrnei.f	. . . 4 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
3		ntrnei.r	. . . . 5 ⊢ (𝜑 → 𝐼𝐹𝑁)
4	3	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝐼𝐹𝑁)
5		ntrnei.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
6	5	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑋 ∈ 𝐵)
7		simpr 485	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑠 ∈ 𝒫 𝐵)
8	1, 2, 4, 6, 7	ntrneiel 41691	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝑋 ∈ (𝐼‘𝑠) ↔ 𝑠 ∈ (𝑁‘𝑋)))
9	8	rexbidva 3225	. 2 ⊢ (𝜑 → (∃𝑠 ∈ 𝒫 𝐵𝑋 ∈ (𝐼‘𝑠) ↔ ∃𝑠 ∈ 𝒫 𝐵𝑠 ∈ (𝑁‘𝑋)))
10	1, 2, 3	ntrneinex 41687	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵))
11		elmapi 8637	. . . . . . . . . 10 ⊢ (𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵) → 𝑁:𝐵⟶𝒫 𝒫 𝐵)
12	10, 11	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝑁:𝐵⟶𝒫 𝒫 𝐵)
13	12, 5	ffvelrnd 6962	. . . . . . . 8 ⊢ (𝜑 → (𝑁‘𝑋) ∈ 𝒫 𝒫 𝐵)
14	13	elpwid 4544	. . . . . . 7 ⊢ (𝜑 → (𝑁‘𝑋) ⊆ 𝒫 𝐵)
15	14	sseld 3920	. . . . . 6 ⊢ (𝜑 → (𝑠 ∈ (𝑁‘𝑋) → 𝑠 ∈ 𝒫 𝐵))
16	15	pm4.71rd 563	. . . . 5 ⊢ (𝜑 → (𝑠 ∈ (𝑁‘𝑋) ↔ (𝑠 ∈ 𝒫 𝐵 ∧ 𝑠 ∈ (𝑁‘𝑋))))
17	16	exbidv 1924	. . . 4 ⊢ (𝜑 → (∃𝑠 𝑠 ∈ (𝑁‘𝑋) ↔ ∃𝑠(𝑠 ∈ 𝒫 𝐵 ∧ 𝑠 ∈ (𝑁‘𝑋))))
18	17	bicomd 222	. . 3 ⊢ (𝜑 → (∃𝑠(𝑠 ∈ 𝒫 𝐵 ∧ 𝑠 ∈ (𝑁‘𝑋)) ↔ ∃𝑠 𝑠 ∈ (𝑁‘𝑋)))
19		df-rex 3070	. . 3 ⊢ (∃𝑠 ∈ 𝒫 𝐵𝑠 ∈ (𝑁‘𝑋) ↔ ∃𝑠(𝑠 ∈ 𝒫 𝐵 ∧ 𝑠 ∈ (𝑁‘𝑋)))
20		n0 4280	. . 3 ⊢ ((𝑁‘𝑋) ≠ ∅ ↔ ∃𝑠 𝑠 ∈ (𝑁‘𝑋))
21	18, 19, 20	3bitr4g 314	. 2 ⊢ (𝜑 → (∃𝑠 ∈ 𝒫 𝐵𝑠 ∈ (𝑁‘𝑋) ↔ (𝑁‘𝑋) ≠ ∅))
22	9, 21	bitrd 278	1 ⊢ (𝜑 → (∃𝑠 ∈ 𝒫 𝐵𝑋 ∈ (𝐼‘𝑠) ↔ (𝑁‘𝑋) ≠ ∅))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539  ∃wex 1782   ∈ wcel 2106   ≠ wne 2943  ∃wrex 3065  {crab 3068  Vcvv 3432  ∅c0 4256  𝒫 cpw 4533   class class class wbr 5074   ↦ cmpt 5157  ⟶wf 6429  ‘cfv 6433  (class class class)co 7275   ∈ cmpo 7277   ↑_m cmap 8615

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-1st 7831  df-2nd 7832  df-map 8617

This theorem is referenced by:  ntrneineine0  41697