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 44822
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 6881 . . . 4 (𝑠 = 𝑡 → (𝐼𝑠) = (𝐼𝑡))
2 id 23 . . . 4 (𝑠 = 𝑡𝑠 = 𝑡)
31, 2sseq12d 3969 . . 3 (𝑠 = 𝑡 → ((𝐼𝑠) ⊆ 𝑠 ↔ (𝐼𝑡) ⊆ 𝑡))
43cbvralvw 3242 . 2 (∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠 ↔ ∀𝑡 ∈ 𝒫 𝐵(𝐼𝑡) ⊆ 𝑡)
5 ntrcls.d . . . . 5 𝐷 = (𝑂𝐵)
6 ntrcls.r . . . . 5 (𝜑𝐼𝐷𝐾)
75, 6ntrclsrcomplex 44789 . . . 4 (𝜑 → (𝐵𝑠) ∈ 𝒫 𝐵)
87adantr 485 . . 3 ((𝜑𝑠 ∈ 𝒫 𝐵) → (𝐵𝑠) ∈ 𝒫 𝐵)
95, 6ntrclsrcomplex 44789 . . . . 5 (𝜑 → (𝐵𝑡) ∈ 𝒫 𝐵)
109adantr 485 . . . 4 ((𝜑𝑡 ∈ 𝒫 𝐵) → (𝐵𝑡) ∈ 𝒫 𝐵)
11 difeq2 4074 . . . . . 6 (𝑠 = (𝐵𝑡) → (𝐵𝑠) = (𝐵 ∖ (𝐵𝑡)))
1211eqeq2d 2773 . . . . 5 (𝑠 = (𝐵𝑡) → (𝑡 = (𝐵𝑠) ↔ 𝑡 = (𝐵 ∖ (𝐵𝑡))))
1312adantl 486 . . . 4 (((𝜑𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵𝑡)) → (𝑡 = (𝐵𝑠) ↔ 𝑡 = (𝐵 ∖ (𝐵𝑡))))
14 elpwi 4568 . . . . . . 7 (𝑡 ∈ 𝒫 𝐵𝑡𝐵)
15 dfss4 4221 . . . . . . 7 (𝑡𝐵 ↔ (𝐵 ∖ (𝐵𝑡)) = 𝑡)
1614, 15sylib 221 . . . . . 6 (𝑡 ∈ 𝒫 𝐵 → (𝐵 ∖ (𝐵𝑡)) = 𝑡)
1716adantl 486 . . . . 5 ((𝜑𝑡 ∈ 𝒫 𝐵) → (𝐵 ∖ (𝐵𝑡)) = 𝑡)
1817eqcomd 2768 . . . 4 ((𝜑𝑡 ∈ 𝒫 𝐵) → 𝑡 = (𝐵 ∖ (𝐵𝑡)))
1910, 13, 18rspcedvd 3582 . . 3 ((𝜑𝑡 ∈ 𝒫 𝐵) → ∃𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠))
20 fveq2 6881 . . . . . 6 (𝑡 = (𝐵𝑠) → (𝐼𝑡) = (𝐼‘(𝐵𝑠)))
21 id 23 . . . . . 6 (𝑡 = (𝐵𝑠) → 𝑡 = (𝐵𝑠))
2220, 21sseq12d 3969 . . . . 5 (𝑡 = (𝐵𝑠) → ((𝐼𝑡) ⊆ 𝑡 ↔ (𝐼‘(𝐵𝑠)) ⊆ (𝐵𝑠)))
23223ad2ant3 1152 . . . 4 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → ((𝐼𝑡) ⊆ 𝑡 ↔ (𝐼‘(𝐵𝑠)) ⊆ (𝐵𝑠)))
24 ntrcls.o . . . . . . . . . . . 12 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖𝑗))))))
2524, 5, 6ntrclsiex 44807 . . . . . . . . . . 11 (𝜑𝐼 ∈ (𝒫 𝐵m 𝒫 𝐵))
26 elmapi 8844 . . . . . . . . . . 11 (𝐼 ∈ (𝒫 𝐵m 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
2725, 26syl 18 . . . . . . . . . 10 (𝜑𝐼:𝒫 𝐵⟶𝒫 𝐵)
28273ad2ant1 1150 . . . . . . . . 9 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
2973ad2ant1 1150 . . . . . . . . 9 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → (𝐵𝑠) ∈ 𝒫 𝐵)
3028, 29ffvelcdmd 7080 . . . . . . . 8 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → (𝐼‘(𝐵𝑠)) ∈ 𝒫 𝐵)
3130elpwid 4570 . . . . . . 7 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → (𝐼‘(𝐵𝑠)) ⊆ 𝐵)
32 difssd 4090 . . . . . . 7 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → (𝐵𝑠) ⊆ 𝐵)
33 sscon34b 4256 . . . . . . 7 (((𝐼‘(𝐵𝑠)) ⊆ 𝐵 ∧ (𝐵𝑠) ⊆ 𝐵) → ((𝐼‘(𝐵𝑠)) ⊆ (𝐵𝑠) ↔ (𝐵 ∖ (𝐵𝑠)) ⊆ (𝐵 ∖ (𝐼‘(𝐵𝑠)))))
3431, 32, 33syl2anc 595 . . . . . 6 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → ((𝐼‘(𝐵𝑠)) ⊆ (𝐵𝑠) ↔ (𝐵 ∖ (𝐵𝑠)) ⊆ (𝐵 ∖ (𝐼‘(𝐵𝑠)))))
35 simp2 1154 . . . . . . 7 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → 𝑠 ∈ 𝒫 𝐵)
36 elpwi 4568 . . . . . . . . 9 (𝑠 ∈ 𝒫 𝐵𝑠𝐵)
37 dfss4 4221 . . . . . . . . 9 (𝑠𝐵 ↔ (𝐵 ∖ (𝐵𝑠)) = 𝑠)
3836, 37sylib 221 . . . . . . . 8 (𝑠 ∈ 𝒫 𝐵 → (𝐵 ∖ (𝐵𝑠)) = 𝑠)
3938sseq1d 3967 . . . . . . 7 (𝑠 ∈ 𝒫 𝐵 → ((𝐵 ∖ (𝐵𝑠)) ⊆ (𝐵 ∖ (𝐼‘(𝐵𝑠))) ↔ 𝑠 ⊆ (𝐵 ∖ (𝐼‘(𝐵𝑠)))))
4035, 39syl 18 . . . . . 6 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → ((𝐵 ∖ (𝐵𝑠)) ⊆ (𝐵 ∖ (𝐼‘(𝐵𝑠))) ↔ 𝑠 ⊆ (𝐵 ∖ (𝐼‘(𝐵𝑠)))))
4134, 40bitrd 282 . . . . 5 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → ((𝐼‘(𝐵𝑠)) ⊆ (𝐵𝑠) ↔ 𝑠 ⊆ (𝐵 ∖ (𝐼‘(𝐵𝑠)))))
425, 6ntrclsbex 44788 . . . . . . . 8 (𝜑𝐵 ∈ V)
43423ad2ant1 1150 . . . . . . 7 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → 𝐵 ∈ V)
44253ad2ant1 1150 . . . . . . 7 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → 𝐼 ∈ (𝒫 𝐵m 𝒫 𝐵))
45 eqid 2762 . . . . . . 7 (𝐷𝐼) = (𝐷𝐼)
46 eqid 2762 . . . . . . 7 ((𝐷𝐼)‘𝑠) = ((𝐷𝐼)‘𝑠)
4724, 5, 43, 44, 45, 35, 46dssmapfv3d 44773 . . . . . 6 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → ((𝐷𝐼)‘𝑠) = (𝐵 ∖ (𝐼‘(𝐵𝑠))))
4847sseq2d 3968 . . . . 5 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → (𝑠 ⊆ ((𝐷𝐼)‘𝑠) ↔ 𝑠 ⊆ (𝐵 ∖ (𝐼‘(𝐵𝑠)))))
4924, 5, 6ntrclsfv1 44809 . . . . . . . 8 (𝜑 → (𝐷𝐼) = 𝐾)
5049fveq1d 6883 . . . . . . 7 (𝜑 → ((𝐷𝐼)‘𝑠) = (𝐾𝑠))
5150sseq2d 3968 . . . . . 6 (𝜑 → (𝑠 ⊆ ((𝐷𝐼)‘𝑠) ↔ 𝑠 ⊆ (𝐾𝑠)))
52513ad2ant1 1150 . . . . 5 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → (𝑠 ⊆ ((𝐷𝐼)‘𝑠) ↔ 𝑠 ⊆ (𝐾𝑠)))
5341, 48, 523bitr2d 310 . . . 4 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → ((𝐼‘(𝐵𝑠)) ⊆ (𝐵𝑠) ↔ 𝑠 ⊆ (𝐾𝑠)))
5423, 53bitrd 282 . . 3 ((𝜑𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵𝑠)) → ((𝐼𝑡) ⊆ 𝑡𝑠 ⊆ (𝐾𝑠)))
558, 19, 54ralxfrd2 5382 . 2 (𝜑 → (∀𝑡 ∈ 𝒫 𝐵(𝐼𝑡) ⊆ 𝑡 ↔ ∀𝑠 ∈ 𝒫 𝐵𝑠 ⊆ (𝐾𝑠)))
564, 55bitrid 286 1 (𝜑 → (∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠 ↔ ∀𝑠 ∈ 𝒫 𝐵𝑠 ⊆ (𝐾𝑠)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 400  w3a 1102   = wceq 1569  wcel 2142  wral 3078  Vcvv 3454  cdif 3901  wss 3904  𝒫 cpw 4561   class class class wbr 5108  cmpt 5191  wf 6532  cfv 6536  (class class class)co 7412  m cmap 8822
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7984  df-2nd 7985  df-map 8824
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator