ntrclsk2 - Mathbox for Richard Penner

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

Theorem ntrclsk2 43122

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.

Step	Hyp	Ref	Expression
1		fveq2 6891	. . . 4 ⊢ (𝑠 = 𝑡 → (𝐼‘𝑠) = (𝐼‘𝑡))
2		id 22	. . . 4 ⊢ (𝑠 = 𝑡 → 𝑠 = 𝑡)
3	1, 2	sseq12d 4015	. . 3 ⊢ (𝑠 = 𝑡 → ((𝐼‘𝑠) ⊆ 𝑠 ↔ (𝐼‘𝑡) ⊆ 𝑡))
4	3	cbvralvw 3233	. 2 ⊢ (∀𝑠 ∈ 𝒫 𝐵(𝐼‘𝑠) ⊆ 𝑠 ↔ ∀𝑡 ∈ 𝒫 𝐵(𝐼‘𝑡) ⊆ 𝑡)
5		ntrcls.d	. . . . 5 ⊢ 𝐷 = (𝑂‘𝐵)
6		ntrcls.r	. . . . 5 ⊢ (𝜑 → 𝐼𝐷𝐾)
7	5, 6	ntrclsrcomplex 43089	. . . 4 ⊢ (𝜑 → (𝐵 ∖ 𝑠) ∈ 𝒫 𝐵)
8	7	adantr 480	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐵 ∖ 𝑠) ∈ 𝒫 𝐵)
9	5, 6	ntrclsrcomplex 43089	. . . . 5 ⊢ (𝜑 → (𝐵 ∖ 𝑡) ∈ 𝒫 𝐵)
10	9	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → (𝐵 ∖ 𝑡) ∈ 𝒫 𝐵)
11		difeq2 4116	. . . . . 6 ⊢ (𝑠 = (𝐵 ∖ 𝑡) → (𝐵 ∖ 𝑠) = (𝐵 ∖ (𝐵 ∖ 𝑡)))
12	11	eqeq2d 2742	. . . . 5 ⊢ (𝑠 = (𝐵 ∖ 𝑡) → (𝑡 = (𝐵 ∖ 𝑠) ↔ 𝑡 = (𝐵 ∖ (𝐵 ∖ 𝑡))))
13	12	adantl 481	. . . 4 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵 ∖ 𝑡)) → (𝑡 = (𝐵 ∖ 𝑠) ↔ 𝑡 = (𝐵 ∖ (𝐵 ∖ 𝑡))))
14		elpwi 4609	. . . . . . 7 ⊢ (𝑡 ∈ 𝒫 𝐵 → 𝑡 ⊆ 𝐵)
15		dfss4 4258	. . . . . . 7 ⊢ (𝑡 ⊆ 𝐵 ↔ (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡)
16	14, 15	sylib 217	. . . . . 6 ⊢ (𝑡 ∈ 𝒫 𝐵 → (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡)
17	16	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡)
18	17	eqcomd 2737	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → 𝑡 = (𝐵 ∖ (𝐵 ∖ 𝑡)))
19	10, 13, 18	rspcedvd 3614	. . 3 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → ∃𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵 ∖ 𝑠))
20		fveq2 6891	. . . . . 6 ⊢ (𝑡 = (𝐵 ∖ 𝑠) → (𝐼‘𝑡) = (𝐼‘(𝐵 ∖ 𝑠)))
21		id 22	. . . . . 6 ⊢ (𝑡 = (𝐵 ∖ 𝑠) → 𝑡 = (𝐵 ∖ 𝑠))
22	20, 21	sseq12d 4015	. . . . 5 ⊢ (𝑡 = (𝐵 ∖ 𝑠) → ((𝐼‘𝑡) ⊆ 𝑡 ↔ (𝐼‘(𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ 𝑠)))
23	22	3ad2ant3 1134	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐼‘𝑡) ⊆ 𝑡 ↔ (𝐼‘(𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ 𝑠)))
24		ntrcls.o	. . . . . . . . . . . 12 ⊢ 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑_m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗))))))
25	24, 5, 6	ntrclsiex 43107	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑_m 𝒫 𝐵))
26		elmapi 8846	. . . . . . . . . . 11 ⊢ (𝐼 ∈ (𝒫 𝐵 ↑_m 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
27	25, 26	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
28	27	3ad2ant1 1132	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
29	7	3ad2ant1 1132	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝐵 ∖ 𝑠) ∈ 𝒫 𝐵)
30	28, 29	ffvelcdmd 7087	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝐼‘(𝐵 ∖ 𝑠)) ∈ 𝒫 𝐵)
31	30	elpwid 4611	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝐼‘(𝐵 ∖ 𝑠)) ⊆ 𝐵)
32		difssd 4132	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝐵 ∖ 𝑠) ⊆ 𝐵)
33		sscon34b 4294	. . . . . . 7 ⊢ (((𝐼‘(𝐵 ∖ 𝑠)) ⊆ 𝐵 ∧ (𝐵 ∖ 𝑠) ⊆ 𝐵) → ((𝐼‘(𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ 𝑠) ↔ (𝐵 ∖ (𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
34	31, 32, 33	syl2anc 583	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐼‘(𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ 𝑠) ↔ (𝐵 ∖ (𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
35		simp2 1136	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → 𝑠 ∈ 𝒫 𝐵)
36		elpwi 4609	. . . . . . . . 9 ⊢ (𝑠 ∈ 𝒫 𝐵 → 𝑠 ⊆ 𝐵)
37		dfss4 4258	. . . . . . . . 9 ⊢ (𝑠 ⊆ 𝐵 ↔ (𝐵 ∖ (𝐵 ∖ 𝑠)) = 𝑠)
38	36, 37	sylib 217	. . . . . . . 8 ⊢ (𝑠 ∈ 𝒫 𝐵 → (𝐵 ∖ (𝐵 ∖ 𝑠)) = 𝑠)
39	38	sseq1d 4013	. . . . . . 7 ⊢ (𝑠 ∈ 𝒫 𝐵 → ((𝐵 ∖ (𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠))) ↔ 𝑠 ⊆ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
40	35, 39	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐵 ∖ (𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠))) ↔ 𝑠 ⊆ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
41	34, 40	bitrd 279	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐼‘(𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ 𝑠) ↔ 𝑠 ⊆ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
42	5, 6	ntrclsbex 43088	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ V)
43	42	3ad2ant1 1132	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → 𝐵 ∈ V)
44	25	3ad2ant1 1132	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → 𝐼 ∈ (𝒫 𝐵 ↑_m 𝒫 𝐵))
45		eqid 2731	. . . . . . 7 ⊢ (𝐷‘𝐼) = (𝐷‘𝐼)
46		eqid 2731	. . . . . . 7 ⊢ ((𝐷‘𝐼)‘𝑠) = ((𝐷‘𝐼)‘𝑠)
47	24, 5, 43, 44, 45, 35, 46	dssmapfv3d 43073	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐷‘𝐼)‘𝑠) = (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠))))
48	47	sseq2d 4014	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝑠 ⊆ ((𝐷‘𝐼)‘𝑠) ↔ 𝑠 ⊆ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
49	24, 5, 6	ntrclsfv1 43109	. . . . . . . 8 ⊢ (𝜑 → (𝐷‘𝐼) = 𝐾)
50	49	fveq1d 6893	. . . . . . 7 ⊢ (𝜑 → ((𝐷‘𝐼)‘𝑠) = (𝐾‘𝑠))
51	50	sseq2d 4014	. . . . . 6 ⊢ (𝜑 → (𝑠 ⊆ ((𝐷‘𝐼)‘𝑠) ↔ 𝑠 ⊆ (𝐾‘𝑠)))
52	51	3ad2ant1 1132	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → (𝑠 ⊆ ((𝐷‘𝐼)‘𝑠) ↔ 𝑠 ⊆ (𝐾‘𝑠)))
53	41, 48, 52	3bitr2d 307	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐼‘(𝐵 ∖ 𝑠)) ⊆ (𝐵 ∖ 𝑠) ↔ 𝑠 ⊆ (𝐾‘𝑠)))
54	23, 53	bitrd 279	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐼‘𝑡) ⊆ 𝑡 ↔ 𝑠 ⊆ (𝐾‘𝑠)))
55	8, 19, 54	ralxfrd2 5410	. 2 ⊢ (𝜑 → (∀𝑡 ∈ 𝒫 𝐵(𝐼‘𝑡) ⊆ 𝑡 ↔ ∀𝑠 ∈ 𝒫 𝐵𝑠 ⊆ (𝐾‘𝑠)))
56	4, 55	bitrid 283	1 ⊢ (𝜑 → (∀𝑠 ∈ 𝒫 𝐵(𝐼‘𝑠) ⊆ 𝑠 ↔ ∀𝑠 ∈ 𝒫 𝐵𝑠 ⊆ (𝐾‘𝑠)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2105 ∀wral 3060 Vcvv 3473 ∖ cdif 3945 ⊆ wss 3948 𝒫 cpw 4602 class class class wbr 5148 ↦ cmpt 5231 ⟶wf 6539 ‘cfv 6543 (class class class)co 7412 ↑_m cmap 8823

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7728

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7978 df-2nd 7979 df-map 8825

This theorem is referenced by: (None)

W3C validator