Theorem ntrneifv2 44440

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 44435	. . . . 5 ⊢ (𝜑 → 𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵))
5	2, 3, 1	ntrneinex 44437	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵))
6		dff1o3 6788	. . . . . . . 8 ⊢ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) ↔ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–onto→(𝒫 𝒫 𝐵 ↑m 𝐵) ∧ Fun ◡𝐹))
7	6	simprbi 497	. . . . . . 7 ⊢ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) → Fun ◡𝐹)
8	7	adantr 480	. . . . . 6 ⊢ ((𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) ∧ 𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵)) → Fun ◡𝐹)
9		df-rn 5643	. . . . . . . . 9 ⊢ ran 𝐹 = dom ◡𝐹
10		f1ofo 6789	. . . . . . . . . 10 ⊢ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) → 𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–onto→(𝒫 𝒫 𝐵 ↑m 𝐵))
11		forn 6757	. . . . . . . . . 10 ⊢ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–onto→(𝒫 𝒫 𝐵 ↑m 𝐵) → ran 𝐹 = (𝒫 𝒫 𝐵 ↑m 𝐵))
12	10, 11	syl 17	. . . . . . . . 9 ⊢ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) → ran 𝐹 = (𝒫 𝒫 𝐵 ↑m 𝐵))
13	9, 12	eqtr3id 2786	. . . . . . . 8 ⊢ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) → dom ◡𝐹 = (𝒫 𝒫 𝐵 ↑m 𝐵))
14	13	eleq2d 2823	. . . . . . 7 ⊢ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) → (𝑁 ∈ dom ◡𝐹 ↔ 𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵)))
15	14	biimpar 477	. . . . . 6 ⊢ ((𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) ∧ 𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵)) → 𝑁 ∈ dom ◡𝐹)
16	8, 15	jca 511	. . . . 5 ⊢ ((𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) ∧ 𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵)) → (Fun ◡𝐹 ∧ 𝑁 ∈ dom ◡𝐹))
17	4, 5, 16	syl2anc 585	. . . 4 ⊢ (𝜑 → (Fun ◡𝐹 ∧ 𝑁 ∈ dom ◡𝐹))
18		funbrfvb 6895	. . . 4 ⊢ ((Fun ◡𝐹 ∧ 𝑁 ∈ dom ◡𝐹) → ((◡𝐹‘𝑁) = 𝐼 ↔ 𝑁◡𝐹𝐼))
19	17, 18	syl 17	. . 3 ⊢ (𝜑 → ((◡𝐹‘𝑁) = 𝐼 ↔ 𝑁◡𝐹𝐼))
20	2, 3, 1	ntrneiiex 44436	. . . 4 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
21		brcnvg 5836	. . . 4 ⊢ ((𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵) ∧ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) → (𝑁◡𝐹𝐼 ↔ 𝐼𝐹𝑁))
22	5, 20, 21	syl2anc 585	. . 3 ⊢ (𝜑 → (𝑁◡𝐹𝐼 ↔ 𝐼𝐹𝑁))
23	19, 22	bitrd 279	. 2 ⊢ (𝜑 → ((◡𝐹‘𝑁) = 𝐼 ↔ 𝐼𝐹𝑁))
24	1, 23	mpbird 257	1 ⊢ (𝜑 → (◡𝐹‘𝑁) = 𝐼)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  {crab 3401  Vcvv 3442  𝒫 cpw 4556   class class class wbr 5100   ↦ cmpt 5181  ^◡ccnv 5631  dom cdm 5632  ran crn 5633  Fun wfun 6494  –onto→wfo 6498  –1-1-onto→wf1o 6499  ‘cfv 6500  (class class class)co 7368   ∈ cmpo 7370   ↑_m cmap 8775

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 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690

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 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-map 8777

This theorem is referenced by: (None)