Theorem clsneicnv 45049

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 5848	. . 3 ⊢ ◡𝐻 = ◡(𝐹 ∘ 𝐷)
3		cnvco 5863	. . 3 ⊢ ◡(𝐹 ∘ 𝐷) = (◡𝐷 ∘ ◡𝐹)
4	2, 3	eqtri 2783	. 2 ⊢ ◡𝐻 = (◡𝐷 ∘ ◡𝐹)
5		clsnei.d	. . . 4 ⊢ 𝐷 = (𝑃‘𝐵)
6		clsnei.r	. . . 4 ⊢ (𝜑 → 𝐾𝐻𝑁)
7	5, 1, 6	clsneibex 45046	. . 3 ⊢ (𝜑 → 𝐵 ∈ V)
8		clsnei.p	. . . . 5 ⊢ 𝑃 = (𝑛 ∈ V ↦ (𝑝 ∈ (𝒫 𝑛 ↑m 𝒫 𝑛) ↦ (𝑜 ∈ 𝒫 𝑛 ↦ (𝑛 ∖ (𝑝‘(𝑛 ∖ 𝑜))))))
9		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐵 ∈ V)
10	8, 5, 9	dssmapnvod 44964	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → ◡𝐷 = 𝐷)
11		clsnei.o	. . . . 5 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
12		pwexg 5339	. . . . . 6 ⊢ (𝐵 ∈ V → 𝒫 𝐵 ∈ V)
13	12	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝒫 𝐵 ∈ V)
14		clsnei.f	. . . . 5 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
15		eqid 2760	. . . . 5 ⊢ (𝐵𝑂𝒫 𝐵) = (𝐵𝑂𝒫 𝐵)
16	11, 13, 9, 14, 15	fsovcnvd 44958	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → ◡𝐹 = (𝐵𝑂𝒫 𝐵))
17	10, 16	coeq12d 5838	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → (◡𝐷 ∘ ◡𝐹) = (𝐷 ∘ (𝐵𝑂𝒫 𝐵)))
18	7, 17	mpdan 700	. 2 ⊢ (𝜑 → (◡𝐷 ∘ ◡𝐹) = (𝐷 ∘ (𝐵𝑂𝒫 𝐵)))
19	4, 18	eqtrid 2807	1 ⊢ (𝜑 → ◡𝐻 = (𝐷 ∘ (𝐵𝑂𝒫 𝐵)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {crab 3412  Vcvv 3450   ∖ cdif 3895  𝒫 cpw 4556   class class class wbr 5102   ↦ cmpt 5185  ^◡ccnv 5646   ∘ ccom 5651  ‘cfv 6527  (class class class)co 7408   ∈ cmpo 7410   ↑_m cmap 8825

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7984  df-2nd 7985  df-map 8827

This theorem is used by: (None)