Theorem clsneicnv 45295

Description: If a (pseudo-)closure function and a (pseudo-)neighborhood function are related by the 𝐻 operator, then the converse of the operator is known. (Contributed by RP, 5-Jun-2021.)

Hypotheses

Ref	Expression
clsnei.o	⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
clsnei.p	⊢ 𝑃 = (𝑛 ∈ V ↦ (𝑝 ∈ (𝒫 𝑛 ↑m 𝒫 𝑛) ↦ (𝑜 ∈ 𝒫 𝑛 ↦ (𝑛 ∖ (𝑝‘(𝑛 ∖ 𝑜))))))
clsnei.d	⊢ 𝐷 = (𝑃‘𝐵)
clsnei.f	⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
clsnei.h	⊢ 𝐻 = (𝐹 ∘ 𝐷)
clsnei.r	⊢ (𝜑 → 𝐾𝐻𝑁)

Assertion

Ref	Expression
clsneicnv	⊢ (𝜑 → ◡𝐻 = (𝐷 ∘ (𝐵𝑂𝒫 𝐵)))

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

Allowed substitution hints:   𝜑(𝑚)   𝐷(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)   𝑃(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)   𝐹(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)   𝐻(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)   𝐾(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)   𝑁(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)   𝑂(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)

Proof of Theorem clsneicnv

Step	Hyp	Ref	Expression
1		clsnei.h	. . . 4 ⊢ 𝐻 = (𝐹 ∘ 𝐷)
2	1	cnveqi 5858	. . 3 ⊢ ◡𝐻 = ◡(𝐹 ∘ 𝐷)
3		cnvco 5873	. . 3 ⊢ ◡(𝐹 ∘ 𝐷) = (◡𝐷 ∘ ◡𝐹)
4	2, 3	eqtri 2786	. 2 ⊢ ◡𝐻 = (◡𝐷 ∘ ◡𝐹)
5		clsnei.d	. . . 4 ⊢ 𝐷 = (𝑃‘𝐵)
6		clsnei.r	. . . 4 ⊢ (𝜑 → 𝐾𝐻𝑁)
7	5, 1, 6	clsneibex 45292	. . 3 ⊢ (𝜑 → 𝐵 ∈ V)
8		clsnei.p	. . . . 5 ⊢ 𝑃 = (𝑛 ∈ V ↦ (𝑝 ∈ (𝒫 𝑛 ↑m 𝒫 𝑛) ↦ (𝑜 ∈ 𝒫 𝑛 ↦ (𝑛 ∖ (𝑝‘(𝑛 ∖ 𝑜))))))
9		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐵 ∈ V)
10	8, 5, 9	dssmapnvod 45210	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → ◡𝐷 = 𝐷)
11		clsnei.o	. . . . 5 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
12		pwexg 5344	. . . . . 6 ⊢ (𝐵 ∈ V → 𝒫 𝐵 ∈ V)
13	12	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝒫 𝐵 ∈ V)
14		clsnei.f	. . . . 5 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
15		eqid 2763	. . . . 5 ⊢ (𝐵𝑂𝒫 𝐵) = (𝐵𝑂𝒫 𝐵)
16	11, 13, 9, 14, 15	fsovcnvd 45204	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → ◡𝐹 = (𝐵𝑂𝒫 𝐵))
17	10, 16	coeq12d 5847	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → (◡𝐷 ∘ ◡𝐹) = (𝐷 ∘ (𝐵𝑂𝒫 𝐵)))
18	7, 17	mpdan 700	. 2 ⊢ (𝜑 → (◡𝐷 ∘ ◡𝐹) = (𝐷 ∘ (𝐵𝑂𝒫 𝐵)))
19	4, 18	eqtrid 2810	1 ⊢ (𝜑 → ◡𝐻 = (𝐷 ∘ (𝐵𝑂𝒫 𝐵)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454   ∖ cdif 4048  𝒫 cpw 4560   class class class wbr 5106   ↦ cmpt 5189  ^◡ccnv 5654   ∘ ccom 5659  ‘cfv 6555  (class class class)co 7440   ∈ cmpo 7442   ↑_m cmap 8872

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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-map 8874

This theorem is used by: (None)