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

Theorem ntrclsk2 45260
Description: An interior function is contracting if and only if the closure function is expansive. (Contributed by RP, 9-Jun-2021.)
Hypotheses
Ref Expression
ntrcls.o 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗))))))
ntrcls.d 𝐷 = (𝑂‘𝐵)
ntrcls.r (𝜑 → 𝐼𝐷𝐾)
Assertion
Ref Expression
ntrclsk2 (𝜑 → (∀𝑠 ∈ 𝒫 𝐵(𝐼‘𝑠) ⊆ 𝑠 ↔ ∀𝑠 ∈ 𝒫 𝐵𝑠 ⊆ (𝐾‘𝑠)))
Distinct variable groups:   𝐵,𝑖,𝑗,𝑘,𝑠   𝑗,𝐼,𝑘,𝑠   𝜑,𝑖,𝑗,𝑘,𝑠
Allowed substitution hints:   𝐷(𝑖, 𝑗, 𝑘, 𝑠)   𝐼(𝑖)   𝐾(𝑖, 𝑗, 𝑘, 𝑠)   𝑂(𝑖, 𝑗, 𝑘, 𝑠)

Proof of Theorem ntrclsk2
Dummy variable 𝑡 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6908 . . . 4 (𝑠 = 𝑡 → (𝐼‘𝑠) = (𝐼‘𝑡))
2 id 23 . . . 4 (𝑠 = 𝑡 → 𝑠 = 𝑡)
31, 2sseq12d 3946 . . 3 (𝑠 = 𝑡 → ((𝐼‘𝑠) ⊆ 𝑠 ↔ (𝐼‘𝑡) ⊆ 𝑡))
43cbvralvw 3244 . 2 (∀𝑠 ∈ 𝒫 𝐵(𝐼‘𝑠) ⊆ 𝑠 ↔ ∀𝑡 ∈ 𝒫 𝐵(𝐼‘𝑡) ⊆ 𝑡)
5 ntrcls.d . . . . 5 𝐷 = (𝑂‘𝐵)
6 ntrcls.r . . . . 5 (𝜑 → 𝐼𝐷𝐾)
75, 6ntrclsrcomplex 45227 . . . 4 (𝜑 → (𝐵 ∖ 𝑠) ∈ 𝒫 𝐵)
87adantr 486 . . 3 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐵 ∖ 𝑠) ∈ 𝒫 𝐵)
95, 6ntrclsrcomplex 45227 . . . . 5 (𝜑 → (𝐵 ∖ 𝑡) ∈ 𝒫 𝐵)
109adantr 486 . . . 4 ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → (𝐵 ∖ 𝑡) ∈ 𝒫 𝐵)
11 difeq2 4060 . . . . . 6 (𝑠 = (𝐵 ∖ 𝑡) → (𝐵 ∖ 𝑠) = (𝐵 ∖ (𝐵 ∖ 𝑡)))
1211eqeq2d 2774 . . . . 5 (𝑠 = (𝐵 ∖ 𝑡) → (𝑡 = (𝐵 ∖ 𝑠) ↔ 𝑡 = (𝐵 ∖ (𝐵 ∖ 𝑡))))
1312adantl 487 . . . 4 (((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵 ∖ 𝑡)) → (𝑡 = (𝐵 ∖ 𝑠) ↔ 𝑡 = (𝐵 ∖ (𝐵 ∖ 𝑡))))
14 elpwi 4567 . . . . . . 7 (𝑡 ∈ 𝒫 𝐵 → 𝑡 ⊆ 𝐵)
15 dfss4 4217 . . . . . . 7 (𝑡 ⊆ 𝐵 ↔ (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡)
1614, 15sylib 221 . . . . . 6 (𝑡 ∈ 𝒫 𝐵 → (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡)
1716adantl 487 . . . . 5 ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡)
1817eqcomd 2769 . . . 4 ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → 𝑡 = (𝐵 ∖ (𝐵 ∖ 𝑡)))
1910, 13, 18rspcedvd 3582 . . 3 ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → ∃𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵 ∖ 𝑠))
20 fveq2 6908 . . . . . 6 (𝑡 = (𝐵 ∖ 𝑠) → (𝐼‘𝑡) = (𝐼‘(𝐵 ∖ 𝑠)))
21 id 23 . . . . . 6 (𝑡 = (𝐵 ∖ 𝑠) → 𝑡 = (𝐵 ∖ 𝑠))
2220, 21sseq12d 3946 . . . . 5 (𝑡 = (𝐵 ∖ 𝑠) → ((𝐼‘𝑡) ⊆ 𝑡 ↔ (𝐼‘(𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ 𝑠)))
23223ad2ant3 1153 . . . 4 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐼‘𝑡) ⊆ 𝑡 ↔ (𝐼‘(𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ 𝑠)))
24 ntrcls.o . . . . . . . . . . . 12 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗))))))
2524, 5, 6ntrclsiex 45245 . . . . . . . . . . 11 (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
26 elmapi 8897 . . . . . . . . . . 11 (𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
2725, 26syl 18 . . . . . . . . . 10 (𝜑 → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
28273ad2ant1 1151 . . . . . . . . 9 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
2973ad2ant1 1151 . . . . . . . . 9 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝐵 ∖ 𝑠) ∈ 𝒫 𝐵)
3028, 29ffvelcdmd 7109 . . . . . . . 8 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝐼‘(𝐵 ∖ 𝑠)) ∈ 𝒫 𝐵)
3130elpwid 4569 . . . . . . 7 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝐼‘(𝐵 ∖ 𝑠)) ⊆ 𝐵)
32 difssd 4076 . . . . . . 7 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝐵 ∖ 𝑠) ⊆ 𝐵)
33 sscon34b 4252 . . . . . . 7 (((𝐼‘(𝐵 ∖ 𝑠)) ⊆ 𝐵 ∧ (𝐵 ∖ 𝑠) ⊆ 𝐵) → ((𝐼‘(𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ 𝑠) ↔ (𝐵 ∖ (𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
3431, 32, 33syl2anc 596 . . . . . 6 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐼‘(𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ 𝑠) ↔ (𝐵 ∖ (𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
35 simp2 1155 . . . . . . 7 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → 𝑠 ∈ 𝒫 𝐵)
36 elpwi 4567 . . . . . . . . 9 (𝑠 ∈ 𝒫 𝐵 → 𝑠 ⊆ 𝐵)
37 dfss4 4217 . . . . . . . . 9 (𝑠 ⊆ 𝐵 ↔ (𝐵 ∖ (𝐵 ∖ 𝑠)) = 𝑠)
3836, 37sylib 221 . . . . . . . 8 (𝑠 ∈ 𝒫 𝐵 → (𝐵 ∖ (𝐵 ∖ 𝑠)) = 𝑠)
3938sseq1d 3944 . . . . . . 7 (𝑠 ∈ 𝒫 𝐵 → ((𝐵 ∖ (𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠))) ↔ 𝑠 ⊆ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
4035, 39syl 18 . . . . . 6 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐵 ∖ (𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠))) ↔ 𝑠 ⊆ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
4134, 40bitrd 282 . . . . 5 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐼‘(𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ 𝑠) ↔ 𝑠 ⊆ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
425, 6ntrclsbex 45226 . . . . . . . 8 (𝜑 → 𝐵 ∈ V)
43423ad2ant1 1151 . . . . . . 7 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → 𝐵 ∈ V)
44253ad2ant1 1151 . . . . . . 7 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
45 eqid 2763 . . . . . . 7 (𝐷‘𝐼) = (𝐷‘𝐼)
46 eqid 2763 . . . . . . 7 ((𝐷‘𝐼)‘𝑠) = ((𝐷‘𝐼)‘𝑠)
4724, 5, 43, 44, 45, 35, 46dssmapfv3d 45211 . . . . . 6 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐷‘𝐼)‘𝑠) = (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠))))
4847sseq2d 3945 . . . . 5 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝑠 ⊆ ((𝐷‘𝐼)‘𝑠) ↔ 𝑠 ⊆ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
4924, 5, 6ntrclsfv1 45247 . . . . . . . 8 (𝜑 → (𝐷‘𝐼) = 𝐾)
5049fveq1d 6910 . . . . . . 7 (𝜑 → ((𝐷‘𝐼)‘𝑠) = (𝐾‘𝑠))
5150sseq2d 3945 . . . . . 6 (𝜑 → (𝑠 ⊆ ((𝐷‘𝐼)‘𝑠) ↔ 𝑠 ⊆ (𝐾‘𝑠)))
52513ad2ant1 1151 . . . . 5 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝑠 ⊆ ((𝐷‘𝐼)‘𝑠) ↔ 𝑠 ⊆ (𝐾‘𝑠)))
5341, 48, 523bitr2d 310 . . . 4 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐼‘(𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ 𝑠) ↔ 𝑠 ⊆ (𝐾‘𝑠)))
5423, 53bitrd 282 . . 3 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐼‘𝑡) ⊆ 𝑡 ↔ 𝑠 ⊆ (𝐾‘𝑠)))
558, 19, 54ralxfrd2 5378 . 2 (𝜑 → (∀𝑡 ∈ 𝒫 𝐵(𝐼‘𝑡) ⊆ 𝑡 ↔ ∀𝑠 ∈ 𝒫 𝐵𝑠 ⊆ (𝐾‘𝑠)))
564, 55bitrid 286 1 (𝜑 → (∀𝑠 ∈ 𝒫 𝐵(𝐼‘𝑠) ⊆ 𝑠 ↔ ∀𝑠 ∈ 𝒫 𝐵𝑠 ⊆ (𝐾‘𝑠)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048  𝒫 cpw 4560   class class class wbr 5106   ↦ cmpt 5189  ⟶wf 6554  ‘cfv 6558  (class class class)co 7443   ↑m cmap 8875
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 7775
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 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-1st 8025  df-2nd 8026  df-map 8877
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator