Theorem ntrclsk4 40429

Description: Idempotence of the interior function is equivalent to idempotence of the closure function. (Contributed by RP, 10-Jul-2021.)

Hypotheses

Ref	Expression
ntrcls.o	⊢ 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗))))))
ntrcls.d	⊢ 𝐷 = (𝑂‘𝐵)
ntrcls.r	⊢ (𝜑 → 𝐼𝐷𝐾)

Assertion

Ref	Expression
ntrclsk4	⊢ (𝜑 → (∀𝑠 ∈ 𝒫 𝐵(𝐼‘(𝐼‘𝑠)) = (𝐼‘𝑠) ↔ ∀𝑠 ∈ 𝒫 𝐵(𝐾‘(𝐾‘𝑠)) = (𝐾‘𝑠)))

Distinct variable groups:   𝐵,𝑖,𝑗,𝑘,𝑠   𝑗,𝐼,𝑘,𝑠   𝑗,𝐾   𝜑,𝑖,𝑗,𝑘,𝑠

Allowed substitution hints:   𝐷(𝑖,𝑗,𝑘,𝑠)   𝐼(𝑖)   𝐾(𝑖,𝑘,𝑠)   𝑂(𝑖,𝑗,𝑘,𝑠)

Proof of Theorem ntrclsk4

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		2fveq3 6677	. . . 4 ⊢ (𝑠 = 𝑡 → (𝐼‘(𝐼‘𝑠)) = (𝐼‘(𝐼‘𝑡)))
2		fveq2 6672	. . . 4 ⊢ (𝑠 = 𝑡 → (𝐼‘𝑠) = (𝐼‘𝑡))
3	1, 2	eqeq12d 2839	. . 3 ⊢ (𝑠 = 𝑡 → ((𝐼‘(𝐼‘𝑠)) = (𝐼‘𝑠) ↔ (𝐼‘(𝐼‘𝑡)) = (𝐼‘𝑡)))
4	3	cbvralvw 3451	. 2 ⊢ (∀𝑠 ∈ 𝒫 𝐵(𝐼‘(𝐼‘𝑠)) = (𝐼‘𝑠) ↔ ∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝐼‘𝑡)) = (𝐼‘𝑡))
5		ntrcls.d	. . . . 5 ⊢ 𝐷 = (𝑂‘𝐵)
6		ntrcls.r	. . . . 5 ⊢ (𝜑 → 𝐼𝐷𝐾)
7	5, 6	ntrclsrcomplex 40392	. . . 4 ⊢ (𝜑 → (𝐵 ∖ 𝑠) ∈ 𝒫 𝐵)
8	7	adantr 483	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐵 ∖ 𝑠) ∈ 𝒫 𝐵)
9	5, 6	ntrclsrcomplex 40392	. . . . 5 ⊢ (𝜑 → (𝐵 ∖ 𝑡) ∈ 𝒫 𝐵)
10	9	adantr 483	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → (𝐵 ∖ 𝑡) ∈ 𝒫 𝐵)
11		difeq2 4095	. . . . . 6 ⊢ (𝑠 = (𝐵 ∖ 𝑡) → (𝐵 ∖ 𝑠) = (𝐵 ∖ (𝐵 ∖ 𝑡)))
12	11	eqeq2d 2834	. . . . 5 ⊢ (𝑠 = (𝐵 ∖ 𝑡) → (𝑡 = (𝐵 ∖ 𝑠) ↔ 𝑡 = (𝐵 ∖ (𝐵 ∖ 𝑡))))
13	12	adantl 484	. . . 4 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑠 = (𝐵 ∖ 𝑡)) → (𝑡 = (𝐵 ∖ 𝑠) ↔ 𝑡 = (𝐵 ∖ (𝐵 ∖ 𝑡))))
14		elpwi 4550	. . . . . . 7 ⊢ (𝑡 ∈ 𝒫 𝐵 → 𝑡 ⊆ 𝐵)
15		dfss4 4237	. . . . . . 7 ⊢ (𝑡 ⊆ 𝐵 ↔ (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡)
16	14, 15	sylib 220	. . . . . 6 ⊢ (𝑡 ∈ 𝒫 𝐵 → (𝐵 ∖ (𝐵 ∖ 𝑡)) = 𝑡)
17	16	eqcomd 2829	. . . . 5 ⊢ (𝑡 ∈ 𝒫 𝐵 → 𝑡 = (𝐵 ∖ (𝐵 ∖ 𝑡)))
18	17	adantl 484	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → 𝑡 = (𝐵 ∖ (𝐵 ∖ 𝑡)))
19	10, 13, 18	rspcedvd 3628	. . 3 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝒫 𝐵) → ∃𝑠 ∈ 𝒫 𝐵𝑡 = (𝐵 ∖ 𝑠))
20		2fveq3 6677	. . . . . 6 ⊢ (𝑡 = (𝐵 ∖ 𝑠) → (𝐼‘(𝐼‘𝑡)) = (𝐼‘(𝐼‘(𝐵 ∖ 𝑠))))
21		fveq2 6672	. . . . . 6 ⊢ (𝑡 = (𝐵 ∖ 𝑠) → (𝐼‘𝑡) = (𝐼‘(𝐵 ∖ 𝑠)))
22	20, 21	eqeq12d 2839	. . . . 5 ⊢ (𝑡 = (𝐵 ∖ 𝑠) → ((𝐼‘(𝐼‘𝑡)) = (𝐼‘𝑡) ↔ (𝐼‘(𝐼‘(𝐵 ∖ 𝑠))) = (𝐼‘(𝐵 ∖ 𝑠))))
23	22	3ad2ant3 1131	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐼‘(𝐼‘𝑡)) = (𝐼‘𝑡) ↔ (𝐼‘(𝐼‘(𝐵 ∖ 𝑠))) = (𝐼‘(𝐵 ∖ 𝑠))))
24		ntrcls.o	. . . . . . . . . . . 12 ⊢ 𝑂 = (𝑖 ∈ V ↦ (𝑘 ∈ (𝒫 𝑖 ↑m 𝒫 𝑖) ↦ (𝑗 ∈ 𝒫 𝑖 ↦ (𝑖 ∖ (𝑘‘(𝑖 ∖ 𝑗))))))
25	24, 5, 6	ntrclsiex 40410	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
26		elmapi 8430	. . . . . . . . . . 11 ⊢ (𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
27	25, 26	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
28	27, 7	ffvelrnd 6854	. . . . . . . . . 10 ⊢ (𝜑 → (𝐼‘(𝐵 ∖ 𝑠)) ∈ 𝒫 𝐵)
29	27, 28	ffvelrnd 6854	. . . . . . . . 9 ⊢ (𝜑 → (𝐼‘(𝐼‘(𝐵 ∖ 𝑠))) ∈ 𝒫 𝐵)
30	29	elpwid 4552	. . . . . . . 8 ⊢ (𝜑 → (𝐼‘(𝐼‘(𝐵 ∖ 𝑠))) ⊆ 𝐵)
31	28	elpwid 4552	. . . . . . . 8 ⊢ (𝜑 → (𝐼‘(𝐵 ∖ 𝑠)) ⊆ 𝐵)
32		rcompleq 40377	. . . . . . . 8 ⊢ (((𝐼‘(𝐼‘(𝐵 ∖ 𝑠))) ⊆ 𝐵 ∧ (𝐼‘(𝐵 ∖ 𝑠)) ⊆ 𝐵) → ((𝐼‘(𝐼‘(𝐵 ∖ 𝑠))) = (𝐼‘(𝐵 ∖ 𝑠)) ↔ (𝐵 ∖ (𝐼‘(𝐼‘(𝐵 ∖ 𝑠)))) = (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
33	30, 31, 32	syl2anc 586	. . . . . . 7 ⊢ (𝜑 → ((𝐼‘(𝐼‘(𝐵 ∖ 𝑠))) = (𝐼‘(𝐵 ∖ 𝑠)) ↔ (𝐵 ∖ (𝐼‘(𝐼‘(𝐵 ∖ 𝑠)))) = (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
34	33	adantr 483	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → ((𝐼‘(𝐼‘(𝐵 ∖ 𝑠))) = (𝐼‘(𝐵 ∖ 𝑠)) ↔ (𝐵 ∖ (𝐼‘(𝐼‘(𝐵 ∖ 𝑠)))) = (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
35	24, 5, 6	ntrclsnvobr 40409	. . . . . . . . . 10 ⊢ (𝜑 → 𝐾𝐷𝐼)
36	35	adantr 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝐾𝐷𝐼)
37	24, 5, 35	ntrclsiex 40410	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐾 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
38		elmapi 8430	. . . . . . . . . . 11 ⊢ (𝐾 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐾:𝒫 𝐵⟶𝒫 𝐵)
39	37, 38	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐾:𝒫 𝐵⟶𝒫 𝐵)
40	39	ffvelrnda 6853	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐾‘𝑠) ∈ 𝒫 𝐵)
41	24, 5, 36, 40	ntrclsfv 40416	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐾‘(𝐾‘𝑠)) = (𝐵 ∖ (𝐼‘(𝐵 ∖ (𝐾‘𝑠)))))
42		simpr 487	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑠 ∈ 𝒫 𝐵)
43	24, 5, 36, 42	ntrclsfv 40416	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐾‘𝑠) = (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠))))
44	43	difeq2d 4101	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐵 ∖ (𝐾‘𝑠)) = (𝐵 ∖ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
45		dfss4 4237	. . . . . . . . . . . . 13 ⊢ ((𝐼‘(𝐵 ∖ 𝑠)) ⊆ 𝐵 ↔ (𝐵 ∖ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))) = (𝐼‘(𝐵 ∖ 𝑠)))
46	31, 45	sylib 220	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐵 ∖ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))) = (𝐼‘(𝐵 ∖ 𝑠)))
47	46	adantr 483	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐵 ∖ (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))) = (𝐼‘(𝐵 ∖ 𝑠)))
48	44, 47	eqtrd 2858	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐵 ∖ (𝐾‘𝑠)) = (𝐼‘(𝐵 ∖ 𝑠)))
49	48	fveq2d 6676	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐼‘(𝐵 ∖ (𝐾‘𝑠))) = (𝐼‘(𝐼‘(𝐵 ∖ 𝑠))))
50	49	difeq2d 4101	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐵 ∖ (𝐼‘(𝐵 ∖ (𝐾‘𝑠)))) = (𝐵 ∖ (𝐼‘(𝐼‘(𝐵 ∖ 𝑠)))))
51	41, 50	eqtrd 2858	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐾‘(𝐾‘𝑠)) = (𝐵 ∖ (𝐼‘(𝐼‘(𝐵 ∖ 𝑠)))))
52	51, 43	eqeq12d 2839	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → ((𝐾‘(𝐾‘𝑠)) = (𝐾‘𝑠) ↔ (𝐵 ∖ (𝐼‘(𝐼‘(𝐵 ∖ 𝑠)))) = (𝐵 ∖ (𝐼‘(𝐵 ∖ 𝑠)))))
53	34, 52	bitr4d 284	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → ((𝐼‘(𝐼‘(𝐵 ∖ 𝑠))) = (𝐼‘(𝐵 ∖ 𝑠)) ↔ (𝐾‘(𝐾‘𝑠)) = (𝐾‘𝑠)))
54	53	3adant3 1128	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐼‘(𝐼‘(𝐵 ∖ 𝑠))) = (𝐼‘(𝐵 ∖ 𝑠)) ↔ (𝐾‘(𝐾‘𝑠)) = (𝐾‘𝑠)))
55	23, 54	bitrd 281	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵 ∧ 𝑡 = (𝐵 ∖ 𝑠)) → ((𝐼‘(𝐼‘𝑡)) = (𝐼‘𝑡) ↔ (𝐾‘(𝐾‘𝑠)) = (𝐾‘𝑠)))
56	8, 19, 55	ralxfrd2 5315	. 2 ⊢ (𝜑 → (∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝐼‘𝑡)) = (𝐼‘𝑡) ↔ ∀𝑠 ∈ 𝒫 𝐵(𝐾‘(𝐾‘𝑠)) = (𝐾‘𝑠)))
57	4, 56	syl5bb 285	1 ⊢ (𝜑 → (∀𝑠 ∈ 𝒫 𝐵(𝐼‘(𝐼‘𝑠)) = (𝐼‘𝑠) ↔ ∀𝑠 ∈ 𝒫 𝐵(𝐾‘(𝐾‘𝑠)) = (𝐾‘𝑠)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114  ∀wral 3140  Vcvv 3496   ∖ cdif 3935   ⊆ wss 3938  𝒫 cpw 4541   class class class wbr 5068   ↦ cmpt 5148  ⟶wf 6353  ‘cfv 6357  (class class class)co 7158   ↑_m cmap 8408

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 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-ov 7161  df-oprab 7162  df-mpo 7163  df-1st 7691  df-2nd 7692  df-map 8410

This theorem is referenced by: (None)