Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ntrclsfv1 Structured version   Visualization version   GIF version

Theorem ntrclsfv1 45195
Description: If (pseudo-)interior and (pseudo-)closure functions are related by the duality operator then there is a functional relation between them (Contributed by RP, 28-May-2021.)
Hypotheses
Ref Expression
ntrcls.o 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗))))))
ntrcls.d 𝐷 = (𝑂‘𝐵)
ntrcls.r (𝜑 → 𝐼𝐷𝐾)
Assertion
Ref Expression
ntrclsfv1 (𝜑 → (𝐷‘𝐼) = 𝐾)
Distinct variable groups:   𝐵,𝑖,𝑗,𝑘   𝜑,𝑖,𝑗,𝑘
Allowed substitution hints:   𝐷(𝑖, 𝑗, 𝑘)   𝐼(𝑖, 𝑗, 𝑘)   𝐾(𝑖, 𝑗, 𝑘)   𝑂(𝑖, 𝑗, 𝑘)

Proof of Theorem ntrclsfv1
StepHypRef Expression
1 ntrcls.r . 2 (𝜑 → 𝐼𝐷𝐾)
2 ntrcls.o . . . . . . 7 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗))))))
3 ntrcls.d . . . . . . 7 𝐷 = (𝑂‘𝐵)
42, 3, 1ntrclsf1o 45191 . . . . . 6 (𝜑 → 𝐷:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝐵 ↑m 𝒫 𝐵))
5 f1ofn 6833 . . . . . 6 (𝐷:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐷 Fn (𝒫 𝐵 ↑m 𝒫 𝐵))
64, 5syl 18 . . . . 5 (𝜑 → 𝐷 Fn (𝒫 𝐵 ↑m 𝒫 𝐵))
72, 3, 1ntrclsiex 45193 . . . . 5 (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
86, 7jca 521 . . . 4 (𝜑 → (𝐷 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) ∧ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)))
9 fnfun 6647 . . . . . 6 (𝐷 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) → Fun 𝐷)
109adantr 486 . . . . 5 ((𝐷 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) ∧ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) → Fun 𝐷)
11 fndm 6650 . . . . . . 7 (𝐷 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) → dom 𝐷 = (𝒫 𝐵 ↑m 𝒫 𝐵))
1211eleq2d 2849 . . . . . 6 (𝐷 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) → (𝐼 ∈ dom 𝐷 ↔ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)))
1312biimpar 483 . . . . 5 ((𝐷 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) ∧ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) → 𝐼 ∈ dom 𝐷)
1410, 13jca 521 . . . 4 ((𝐷 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) ∧ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) → (Fun 𝐷 ∧ 𝐼 ∈ dom 𝐷))
158, 14syl 18 . . 3 (𝜑 → (Fun 𝐷 ∧ 𝐼 ∈ dom 𝐷))
16 funbrfvb 6946 . . 3 ((Fun 𝐷 ∧ 𝐼 ∈ dom 𝐷) → ((𝐷‘𝐼) = 𝐾 ↔ 𝐼𝐷𝐾))
1715, 16syl 18 . 2 (𝜑 → ((𝐷‘𝐼) = 𝐾 ↔ 𝐼𝐷𝐾))
181, 17mpbird 260 1 (𝜑 → (𝐷‘𝐼) = 𝐾)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2146  Vcvv 3453   ∖ cdif 4047  𝒫 cpw 4559   class class class wbr 5105   ↦ cmpt 5188  dom cdm 5654  Fun wfun 6540   Fn wfn 6541  –1-1-onto→wf1o 6545  ‘cfv 6546  (class class class)co 7427   ↑m cmap 8858
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5234  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-iun 4955  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-ov 7430  df-oprab 7431  df-mpo 7432  df-1st 8008  df-2nd 8009  df-map 8860
This theorem is used by:  ntrclsfv2  45196  ntrclscls00  45206  ntrclsiso  45207  ntrclsk2  45208  ntrclskb  45209  ntrclsk3  45210  ntrclsk13  45211
  Copyright terms: Public domain W3C validator