Theorem ntrneineine1lem 44535

Description: If (pseudo-)interior and (pseudo-)neighborhood functions are related by the operator, 𝐹, then conditions equal to claiming that for every point, at not all subsets are (pseudo-)neighborboods hold equally. (Contributed by RP, 1-Jun-2021.)

Hypotheses

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

Assertion

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

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

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

Proof of Theorem ntrneineine1lem

Step	Hyp	Ref	Expression
1		ntrnei.o	. . . . 5 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
2		ntrnei.f	. . . . 5 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
3		ntrnei.r	. . . . . 6 ⊢ (𝜑 → 𝐼𝐹𝑁)
4	3	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝐼𝐹𝑁)
5		ntrnei.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
6	5	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑋 ∈ 𝐵)
7		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑠 ∈ 𝒫 𝐵)
8	1, 2, 4, 6, 7	ntrneiel 44532	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝑋 ∈ (𝐼‘𝑠) ↔ 𝑠 ∈ (𝑁‘𝑋)))
9	8	notbid 318	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (¬ 𝑋 ∈ (𝐼‘𝑠) ↔ ¬ 𝑠 ∈ (𝑁‘𝑋)))
10	9	rexbidva 3160	. 2 ⊢ (𝜑 → (∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑋 ∈ (𝐼‘𝑠) ↔ ∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑠 ∈ (𝑁‘𝑋)))
11	1, 2, 3	ntrneinex 44528	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵))
12		elmapi 8791	. . . . . . 7 ⊢ (𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵) → 𝑁:𝐵⟶𝒫 𝒫 𝐵)
13	11, 12	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑁:𝐵⟶𝒫 𝒫 𝐵)
14	13, 5	ffvelcdmd 7033	. . . . 5 ⊢ (𝜑 → (𝑁‘𝑋) ∈ 𝒫 𝒫 𝐵)
15	14	elpwid 4551	. . . 4 ⊢ (𝜑 → (𝑁‘𝑋) ⊆ 𝒫 𝐵)
16		biortn 938	. . . 4 ⊢ ((𝑁‘𝑋) ⊆ 𝒫 𝐵 → (¬ 𝒫 𝐵 ⊆ (𝑁‘𝑋) ↔ (¬ (𝑁‘𝑋) ⊆ 𝒫 𝐵 ∨ ¬ 𝒫 𝐵 ⊆ (𝑁‘𝑋))))
17	15, 16	syl 17	. . 3 ⊢ (𝜑 → (¬ 𝒫 𝐵 ⊆ (𝑁‘𝑋) ↔ (¬ (𝑁‘𝑋) ⊆ 𝒫 𝐵 ∨ ¬ 𝒫 𝐵 ⊆ (𝑁‘𝑋))))
18		df-rex 3063	. . . 4 ⊢ (∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑠 ∈ (𝑁‘𝑋) ↔ ∃𝑠(𝑠 ∈ 𝒫 𝐵 ∧ ¬ 𝑠 ∈ (𝑁‘𝑋)))
19		nss 3987	. . . 4 ⊢ (¬ 𝒫 𝐵 ⊆ (𝑁‘𝑋) ↔ ∃𝑠(𝑠 ∈ 𝒫 𝐵 ∧ ¬ 𝑠 ∈ (𝑁‘𝑋)))
20	18, 19	bitr4i 278	. . 3 ⊢ (∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑠 ∈ (𝑁‘𝑋) ↔ ¬ 𝒫 𝐵 ⊆ (𝑁‘𝑋))
21		df-ne 2934	. . . 4 ⊢ ((𝑁‘𝑋) ≠ 𝒫 𝐵 ↔ ¬ (𝑁‘𝑋) = 𝒫 𝐵)
22		ianor 984	. . . . 5 ⊢ (¬ ((𝑁‘𝑋) ⊆ 𝒫 𝐵 ∧ 𝒫 𝐵 ⊆ (𝑁‘𝑋)) ↔ (¬ (𝑁‘𝑋) ⊆ 𝒫 𝐵 ∨ ¬ 𝒫 𝐵 ⊆ (𝑁‘𝑋)))
23		eqss 3938	. . . . 5 ⊢ ((𝑁‘𝑋) = 𝒫 𝐵 ↔ ((𝑁‘𝑋) ⊆ 𝒫 𝐵 ∧ 𝒫 𝐵 ⊆ (𝑁‘𝑋)))
24	22, 23	xchnxbir 333	. . . 4 ⊢ (¬ (𝑁‘𝑋) = 𝒫 𝐵 ↔ (¬ (𝑁‘𝑋) ⊆ 𝒫 𝐵 ∨ ¬ 𝒫 𝐵 ⊆ (𝑁‘𝑋)))
25	21, 24	bitri 275	. . 3 ⊢ ((𝑁‘𝑋) ≠ 𝒫 𝐵 ↔ (¬ (𝑁‘𝑋) ⊆ 𝒫 𝐵 ∨ ¬ 𝒫 𝐵 ⊆ (𝑁‘𝑋)))
26	17, 20, 25	3bitr4g 314	. 2 ⊢ (𝜑 → (∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑠 ∈ (𝑁‘𝑋) ↔ (𝑁‘𝑋) ≠ 𝒫 𝐵))
27	10, 26	bitrd 279	1 ⊢ (𝜑 → (∃𝑠 ∈ 𝒫 𝐵 ¬ 𝑋 ∈ (𝐼‘𝑠) ↔ (𝑁‘𝑋) ≠ 𝒫 𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   = wceq 1542  ∃wex 1781   ∈ wcel 2114   ≠ wne 2933  ∃wrex 3062  {crab 3390  Vcvv 3430   ⊆ wss 3890  𝒫 cpw 4542   class class class wbr 5086   ↦ cmpt 5167  ⟶wf 6490  ‘cfv 6494  (class class class)co 7362   ∈ cmpo 7364   ↑_m cmap 8768

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5304  ax-pr 5372  ax-un 7684

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5521  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-res 5638  df-ima 5639  df-iota 6450  df-fun 6496  df-fn 6497  df-f 6498  df-f1 6499  df-fo 6500  df-f1o 6501  df-fv 6502  df-ov 7365  df-oprab 7366  df-mpo 7367  df-1st 7937  df-2nd 7938  df-map 8770

This theorem is referenced by:  ntrneineine1  44539