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

Theorem ntrclsfveq1 38878
 Description: If interior and closure functions are related then specific function values are complementary. (Contributed by RP, 27-Jun-2021.)
Hypotheses
Ref Expression
ntrcls.o 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖𝑚 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖𝑗))))))
ntrcls.d 𝐷 = (𝑂𝐵)
ntrcls.r (𝜑𝐼𝐷𝐾)
ntrclsfv.s (𝜑𝑆 ∈ 𝒫 𝐵)
ntrclsfv.c (𝜑𝐶 ∈ 𝒫 𝐵)
Assertion
Ref Expression
ntrclsfveq1 (𝜑 → ((𝐼𝑆) = 𝐶 ↔ (𝐾‘(𝐵𝑆)) = (𝐵𝐶)))
Distinct variable groups:   𝐵,𝑖,𝑗,𝑘   𝑗,𝐾,𝑘   𝑆,𝑗   𝜑,𝑖,𝑗,𝑘
Allowed substitution hints:   𝐶(𝑖,𝑗,𝑘)   𝐷(𝑖,𝑗,𝑘)   𝑆(𝑖,𝑘)   𝐼(𝑖,𝑗,𝑘)   𝐾(𝑖)   𝑂(𝑖,𝑗,𝑘)

Proof of Theorem ntrclsfveq1
StepHypRef Expression
1 ntrclsfv.c . . . . . 6 (𝜑𝐶 ∈ 𝒫 𝐵)
21elpwid 4314 . . . . 5 (𝜑𝐶𝐵)
3 dfss4 4001 . . . . 5 (𝐶𝐵 ↔ (𝐵 ∖ (𝐵𝐶)) = 𝐶)
42, 3sylib 208 . . . 4 (𝜑 → (𝐵 ∖ (𝐵𝐶)) = 𝐶)
54eqcomd 2766 . . 3 (𝜑𝐶 = (𝐵 ∖ (𝐵𝐶)))
65eqeq2d 2770 . 2 (𝜑 → ((𝐵 ∖ (𝐾‘(𝐵𝑆))) = 𝐶 ↔ (𝐵 ∖ (𝐾‘(𝐵𝑆))) = (𝐵 ∖ (𝐵𝐶))))
7 ntrcls.o . . . 4 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖𝑚 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖𝑗))))))
8 ntrcls.d . . . 4 𝐷 = (𝑂𝐵)
9 ntrcls.r . . . 4 (𝜑𝐼𝐷𝐾)
10 ntrclsfv.s . . . 4 (𝜑𝑆 ∈ 𝒫 𝐵)
117, 8, 9, 10ntrclsfv 38877 . . 3 (𝜑 → (𝐼𝑆) = (𝐵 ∖ (𝐾‘(𝐵𝑆))))
1211eqeq1d 2762 . 2 (𝜑 → ((𝐼𝑆) = 𝐶 ↔ (𝐵 ∖ (𝐾‘(𝐵𝑆))) = 𝐶))
137, 8, 9ntrclskex 38872 . . . . . 6 (𝜑𝐾 ∈ (𝒫 𝐵𝑚 𝒫 𝐵))
14 elmapi 8047 . . . . . 6 (𝐾 ∈ (𝒫 𝐵𝑚 𝒫 𝐵) → 𝐾:𝒫 𝐵⟶𝒫 𝐵)
1513, 14syl 17 . . . . 5 (𝜑𝐾:𝒫 𝐵⟶𝒫 𝐵)
168, 9ntrclsrcomplex 38853 . . . . 5 (𝜑 → (𝐵𝑆) ∈ 𝒫 𝐵)
1715, 16ffvelrnd 6524 . . . 4 (𝜑 → (𝐾‘(𝐵𝑆)) ∈ 𝒫 𝐵)
1817elpwid 4314 . . 3 (𝜑 → (𝐾‘(𝐵𝑆)) ⊆ 𝐵)
19 difssd 3881 . . 3 (𝜑 → (𝐵𝐶) ⊆ 𝐵)
20 rcompleq 38838 . . 3 (((𝐾‘(𝐵𝑆)) ⊆ 𝐵 ∧ (𝐵𝐶) ⊆ 𝐵) → ((𝐾‘(𝐵𝑆)) = (𝐵𝐶) ↔ (𝐵 ∖ (𝐾‘(𝐵𝑆))) = (𝐵 ∖ (𝐵𝐶))))
2118, 19, 20syl2anc 696 . 2 (𝜑 → ((𝐾‘(𝐵𝑆)) = (𝐵𝐶) ↔ (𝐵 ∖ (𝐾‘(𝐵𝑆))) = (𝐵 ∖ (𝐵𝐶))))
226, 12, 213bitr4d 300 1 (𝜑 → ((𝐼𝑆) = 𝐶 ↔ (𝐾‘(𝐵𝑆)) = (𝐵𝐶)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   = wceq 1632   ∈ wcel 2139  Vcvv 3340   ∖ cdif 3712   ⊆ wss 3715  𝒫 cpw 4302   class class class wbr 4804   ↦ cmpt 4881  ⟶wf 6045  ‘cfv 6049  (class class class)co 6814   ↑𝑚 cmap 8025 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-rep 4923  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7115 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-ral 3055  df-rex 3056  df-reu 3057  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-op 4328  df-uni 4589  df-iun 4674  df-br 4805  df-opab 4865  df-mpt 4882  df-id 5174  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-ov 6817  df-oprab 6818  df-mpt2 6819  df-1st 7334  df-2nd 7335  df-map 8027 This theorem is referenced by:  ntrclsfveq  38880
 Copyright terms: Public domain W3C validator