Theorem ntrneiel2 45276

Description: Membership in iterated interior of a set is equivalent to there existing a particular neighborhood of that member such that points are members of that neighborhood if and only if the set is a neighborhood of each of those points. (Contributed by RP, 11-Jul-2021.)

Hypotheses

Ref	Expression
ntrnei.o	⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
ntrnei.f	⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
ntrnei.r	⊢ (𝜑 → 𝐼𝐹𝑁)
ntrneiel2.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
ntrneiel2.s	⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵)

Assertion

Ref	Expression
ntrneiel2	⊢ (𝜑 → (𝑋 ∈ (𝐼‘(𝐼‘𝑆)) ↔ ∃𝑢 ∈ (𝑁‘𝑋)∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ 𝑆 ∈ (𝑁‘𝑦))))

Distinct variable groups:   𝐵,𝑖,𝑗,𝑘,𝑙,𝑚,𝑦   𝑢,𝐵,𝑦   𝑘,𝐼,𝑙,𝑚,𝑦   𝑢,𝑁,𝑦   𝑆,𝑚,𝑦   𝑢,𝑆   𝑋,𝑙,𝑚,𝑦   𝑢,𝑋   𝜑,𝑖,𝑗,𝑘,𝑙,𝑦   𝜑,𝑢

Allowed substitution hints:   𝜑(𝑚)   𝑆(𝑖, 𝑗, 𝑘, 𝑙)   𝐹(𝑦, 𝑢, 𝑖, 𝑗, 𝑘, 𝑚, 𝑙)   𝐼(𝑢, 𝑖, 𝑗)   𝑁(𝑖, 𝑗, 𝑘, 𝑚, 𝑙)   𝑂(𝑦, 𝑢, 𝑖, 𝑗, 𝑘, 𝑚, 𝑙)   𝑋(𝑖, 𝑗, 𝑘)

Proof of Theorem ntrneiel2

Step	Hyp	Ref	Expression
1		ntrnei.o	. . 3 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
2		ntrnei.f	. . 3 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
3		ntrnei.r	. . 3 ⊢ (𝜑 → 𝐼𝐹𝑁)
4		ntrneiel2.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
5	1, 2, 3	ntrneiiex 45266	. . . . 5 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
6		elmapi 8894	. . . . 5 ⊢ (𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
7	5, 6	syl 18	. . . 4 ⊢ (𝜑 → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
8		ntrneiel2.s	. . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵)
9	7, 8	ffvelcdmd 7106	. . 3 ⊢ (𝜑 → (𝐼‘𝑆) ∈ 𝒫 𝐵)
10	1, 2, 3, 4, 9	ntrneiel 45271	. 2 ⊢ (𝜑 → (𝑋 ∈ (𝐼‘(𝐼‘𝑆)) ↔ (𝐼‘𝑆) ∈ (𝑁‘𝑋)))
11	1, 2, 3, 8	ntrneifv4 45275	. . . 4 ⊢ (𝜑 → (𝐼‘𝑆) = {𝑦 ∈ 𝐵 ∣ 𝑆 ∈ (𝑁‘𝑦)})
12		df-rab 3417	. . . 4 ⊢ {𝑦 ∈ 𝐵 ∣ 𝑆 ∈ (𝑁‘𝑦)} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))}
13	11, 12	eqtrdi 2814	. . 3 ⊢ (𝜑 → (𝐼‘𝑆) = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))})
14	13	eleq1d 2849	. 2 ⊢ (𝜑 → ((𝐼‘𝑆) ∈ (𝑁‘𝑋) ↔ {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))} ∈ (𝑁‘𝑋)))
15		clabel 2909	. . . 4 ⊢ ({𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))} ∈ (𝑁‘𝑋) ↔ ∃𝑢(𝑢 ∈ (𝑁‘𝑋) ∧ ∀𝑦(𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))))
16		df-rex 3091	. . . 4 ⊢ (∃𝑢 ∈ (𝑁‘𝑋)∀𝑦(𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))) ↔ ∃𝑢(𝑢 ∈ (𝑁‘𝑋) ∧ ∀𝑦(𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))))
17	15, 16	bitr4i 281	. . 3 ⊢ ({𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))} ∈ (𝑁‘𝑋) ↔ ∃𝑢 ∈ (𝑁‘𝑋)∀𝑦(𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))))
18		ibar 538	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐵 → (𝑆 ∈ (𝑁‘𝑦) ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))))
19	18	bibi2d 345	. . . . . . 7 ⊢ (𝑦 ∈ 𝐵 → ((𝑦 ∈ 𝑢 ↔ 𝑆 ∈ (𝑁‘𝑦)) ↔ (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))))
20	19	ralbiia 3110	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ 𝑆 ∈ (𝑁‘𝑦)) ↔ ∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))))
21		ssv 3937	. . . . . . . 8 ⊢ 𝐵 ⊆ V
22	21	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → 𝐵 ⊆ V)
23		vex 3458	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
24		eldif 4052	. . . . . . . . . 10 ⊢ (𝑦 ∈ (V ∖ 𝐵) ↔ (𝑦 ∈ V ∧ ¬ 𝑦 ∈ 𝐵))
25	23, 24	mpbiran 722	. . . . . . . . 9 ⊢ (𝑦 ∈ (V ∖ 𝐵) ↔ ¬ 𝑦 ∈ 𝐵)
26	1, 2, 3	ntrneinex 45267	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵))
27		elmapi 8894	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵) → 𝑁:𝐵⟶𝒫 𝒫 𝐵)
28	26, 27	syl 18	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑁:𝐵⟶𝒫 𝒫 𝐵)
29	28, 4	ffvelcdmd 7106	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑁‘𝑋) ∈ 𝒫 𝒫 𝐵)
30	29	elpwid 4569	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑁‘𝑋) ⊆ 𝒫 𝐵)
31	30	sselda 3913	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → 𝑢 ∈ 𝒫 𝐵)
32	31	elpwid 4569	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → 𝑢 ⊆ 𝐵)
33	32	sseld 3912	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → (𝑦 ∈ 𝑢 → 𝑦 ∈ 𝐵))
34	33	con3dimp 414	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) ∧ ¬ 𝑦 ∈ 𝐵) → ¬ 𝑦 ∈ 𝑢)
35		pm3.14 1011	. . . . . . . . . . . . 13 ⊢ ((¬ 𝑦 ∈ 𝐵 ∨ ¬ 𝑆 ∈ (𝑁‘𝑦)) → ¬ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))
36	35	orcs 889	. . . . . . . . . . . 12 ⊢ (¬ 𝑦 ∈ 𝐵 → ¬ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))
37	36	adantl 487	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) ∧ ¬ 𝑦 ∈ 𝐵) → ¬ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))
38	34, 37	2falsed 379	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) ∧ ¬ 𝑦 ∈ 𝐵) → (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))))
39	38	ex 418	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → (¬ 𝑦 ∈ 𝐵 → (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))))
40	25, 39	biimtrid 245	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → (𝑦 ∈ (V ∖ 𝐵) → (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))))
41	40	ralrimiv 3157	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → ∀𝑦 ∈ (V ∖ 𝐵)(𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))))
42	22, 41	raldifeq 4452	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → (∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))) ↔ ∀𝑦 ∈ V (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))))
43	20, 42	bitrid 286	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → (∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ 𝑆 ∈ (𝑁‘𝑦)) ↔ ∀𝑦 ∈ V (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))))
44		ralv 3480	. . . . 5 ⊢ (∀𝑦 ∈ V (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))) ↔ ∀𝑦(𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))))
45	43, 44	bitr2di 291	. . . 4 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → (∀𝑦(𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))) ↔ ∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ 𝑆 ∈ (𝑁‘𝑦))))
46	45	rexbidva 3188	. . 3 ⊢ (𝜑 → (∃𝑢 ∈ (𝑁‘𝑋)∀𝑦(𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))) ↔ ∃𝑢 ∈ (𝑁‘𝑋)∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ 𝑆 ∈ (𝑁‘𝑦))))
47	17, 46	bitrid 286	. 2 ⊢ (𝜑 → ({𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))} ∈ (𝑁‘𝑋) ↔ ∃𝑢 ∈ (𝑁‘𝑋)∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ 𝑆 ∈ (𝑁‘𝑦))))
48	10, 14, 47	3bitrd 308	1 ⊢ (𝜑 → (𝑋 ∈ (𝐼‘(𝐼‘𝑆)) ↔ ∃𝑢 ∈ (𝑁‘𝑋)∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ 𝑆 ∈ (𝑁‘𝑦))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2147  {cab 2741  ∀wral 3080  ∃wrex 3090  {crab 3416  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048  𝒫 cpw 4560   class class class wbr 5106   ↦ cmpt 5189  ⟶wf 6551  ‘cfv 6555  (class class class)co 7440   ∈ cmpo 7442   ↑_m cmap 8872

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 7772

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 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-map 8874

This theorem is used by:  ntrneik4  45291