Theorem ntrneifv2 41690

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

Hypotheses

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

Assertion

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

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

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

Proof of Theorem ntrneifv2

Step	Hyp	Ref	Expression
1		ntrnei.r	. 2 ⊢ (𝜑 → 𝐼𝐹𝑁)
2		ntrnei.o	. . . . . 6 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
3		ntrnei.f	. . . . . 6 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
4	2, 3, 1	ntrneif1o 41685	. . . . 5 ⊢ (𝜑 → 𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵))
5	2, 3, 1	ntrneinex 41687	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵))
6		dff1o3 6722	. . . . . . . 8 ⊢ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) ↔ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–onto→(𝒫 𝒫 𝐵 ↑m 𝐵) ∧ Fun ◡𝐹))
7	6	simprbi 497	. . . . . . 7 ⊢ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) → Fun ◡𝐹)
8	7	adantr 481	. . . . . 6 ⊢ ((𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) ∧ 𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵)) → Fun ◡𝐹)
9		df-rn 5600	. . . . . . . . 9 ⊢ ran 𝐹 = dom ◡𝐹
10		f1ofo 6723	. . . . . . . . . 10 ⊢ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) → 𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–onto→(𝒫 𝒫 𝐵 ↑m 𝐵))
11		forn 6691	. . . . . . . . . 10 ⊢ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–onto→(𝒫 𝒫 𝐵 ↑m 𝐵) → ran 𝐹 = (𝒫 𝒫 𝐵 ↑m 𝐵))
12	10, 11	syl 17	. . . . . . . . 9 ⊢ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) → ran 𝐹 = (𝒫 𝒫 𝐵 ↑m 𝐵))
13	9, 12	eqtr3id 2792	. . . . . . . 8 ⊢ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) → dom ◡𝐹 = (𝒫 𝒫 𝐵 ↑m 𝐵))
14	13	eleq2d 2824	. . . . . . 7 ⊢ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) → (𝑁 ∈ dom ◡𝐹 ↔ 𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵)))
15	14	biimpar 478	. . . . . 6 ⊢ ((𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) ∧ 𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵)) → 𝑁 ∈ dom ◡𝐹)
16	8, 15	jca 512	. . . . 5 ⊢ ((𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) ∧ 𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵)) → (Fun ◡𝐹 ∧ 𝑁 ∈ dom ◡𝐹))
17	4, 5, 16	syl2anc 584	. . . 4 ⊢ (𝜑 → (Fun ◡𝐹 ∧ 𝑁 ∈ dom ◡𝐹))
18		funbrfvb 6824	. . . 4 ⊢ ((Fun ◡𝐹 ∧ 𝑁 ∈ dom ◡𝐹) → ((◡𝐹‘𝑁) = 𝐼 ↔ 𝑁◡𝐹𝐼))
19	17, 18	syl 17	. . 3 ⊢ (𝜑 → ((◡𝐹‘𝑁) = 𝐼 ↔ 𝑁◡𝐹𝐼))
20	2, 3, 1	ntrneiiex 41686	. . . 4 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
21		brcnvg 5788	. . . 4 ⊢ ((𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵) ∧ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) → (𝑁◡𝐹𝐼 ↔ 𝐼𝐹𝑁))
22	5, 20, 21	syl2anc 584	. . 3 ⊢ (𝜑 → (𝑁◡𝐹𝐼 ↔ 𝐼𝐹𝑁))
23	19, 22	bitrd 278	. 2 ⊢ (𝜑 → ((◡𝐹‘𝑁) = 𝐼 ↔ 𝐼𝐹𝑁))
24	1, 23	mpbird 256	1 ⊢ (𝜑 → (◡𝐹‘𝑁) = 𝐼)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2106  {crab 3068  Vcvv 3432  𝒫 cpw 4533   class class class wbr 5074   ↦ cmpt 5157  ^◡ccnv 5588  dom cdm 5589  ran crn 5590  Fun wfun 6427  –onto→wfo 6431  –1-1-onto→wf1o 6432  ‘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: (None)