Theorem ntrneifv1 45340

Description: If (pseudo-)interior and (pseudo-)neighborhood functions are related by the operator, 𝐹, then the function value of 𝐹 is the neighborhood function. (Contributed by RP, 29-May-2021.)

Hypotheses

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

Assertion

Ref	Expression
ntrneifv1	⊢ (𝜑 → (𝐹‘𝐼) = 𝑁)

Distinct variable groups:   𝐵,𝑖,𝑗,𝑘,𝑙,𝑚   𝜑,𝑖,𝑗,𝑘,𝑙

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

Proof of Theorem ntrneifv1

Step	Hyp	Ref	Expression
1		ntrnei.r	. 2 ⊢ (𝜑 → 𝐼𝐹𝑁)
2		ntrnei.o	. . . . . 6 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
3		ntrnei.f	. . . . . 6 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
4	2, 3, 1	ntrneif1o 45336	. . . . 5 ⊢ (𝜑 → 𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)⟶1-1onto(𝒫 𝒫 𝐵 ↑m 𝐵))
5		f1ofn 6855	. . . . 5 ⊢ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)⟶1-1onto(𝒫 𝒫 𝐵 ↑m 𝐵) → 𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵))
6	4, 5	syl 18	. . . 4 ⊢ (𝜑 → 𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵))
7	2, 3, 1	ntrneiiex 45337	. . . 4 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
8	6, 7	jca 521	. . 3 ⊢ (𝜑 → (𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) ∧ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)))
9		fnfun 6669	. . . . 5 ⊢ (𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) → Fun 𝐹)
10	9	adantr 486	. . . 4 ⊢ ((𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) ∧ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) → Fun 𝐹)
11		fndm 6672	. . . . . 6 ⊢ (𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) → dom 𝐹 = (𝒫 𝐵 ↑m 𝒫 𝐵))
12	11	eleq2d 2850	. . . . 5 ⊢ (𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) → (𝐼 ∈ dom 𝐹 ↔ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)))
13	12	biimpar 483	. . . 4 ⊢ ((𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) ∧ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) → 𝐼 ∈ dom 𝐹)
14	10, 13	jca 521	. . 3 ⊢ ((𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) ∧ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) → (Fun 𝐹 ∧ 𝐼 ∈ dom 𝐹))
15		funbrfvb 6969	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐼 ∈ dom 𝐹) → ((𝐹‘𝐼) = 𝑁 ↔ 𝐼𝐹𝑁))
16	8, 14, 15	3syl 19	. 2 ⊢ (𝜑 → ((𝐹‘𝐼) = 𝑁 ↔ 𝐼𝐹𝑁))
17	1, 16	mpbird 260	1 ⊢ (𝜑 → (𝐹‘𝐼) = 𝑁)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454  𝒫 cpw 4560   class class class wbr 5108   ↦ cmpt 5192  dom cdm 5658  Fun wfun 6560   Fn wfn 6561  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453   ↑_m cmap 8885

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-map 8887

This theorem is used by:  ntrneiel  45342