Theorem ntrneiel2 42513

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 42503	. . . . 5 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
6		elmapi 8809	. . . . 5 ⊢ (𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
7	5, 6	syl 17	. . . 4 ⊢ (𝜑 → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
8		ntrneiel2.s	. . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵)
9	7, 8	ffvelcdmd 7056	. . 3 ⊢ (𝜑 → (𝐼‘𝑆) ∈ 𝒫 𝐵)
10	1, 2, 3, 4, 9	ntrneiel 42508	. 2 ⊢ (𝜑 → (𝑋 ∈ (𝐼‘(𝐼‘𝑆)) ↔ (𝐼‘𝑆) ∈ (𝑁‘𝑋)))
11	1, 2, 3, 8	ntrneifv4 42512	. . . 4 ⊢ (𝜑 → (𝐼‘𝑆) = {𝑦 ∈ 𝐵 ∣ 𝑆 ∈ (𝑁‘𝑦)})
12		df-rab 3419	. . . 4 ⊢ {𝑦 ∈ 𝐵 ∣ 𝑆 ∈ (𝑁‘𝑦)} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))}
13	11, 12	eqtrdi 2787	. . 3 ⊢ (𝜑 → (𝐼‘𝑆) = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))})
14	13	eleq1d 2817	. 2 ⊢ (𝜑 → ((𝐼‘𝑆) ∈ (𝑁‘𝑋) ↔ {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))} ∈ (𝑁‘𝑋)))
15		clabel 2880	. . . 4 ⊢ ({𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))} ∈ (𝑁‘𝑋) ↔ ∃𝑢(𝑢 ∈ (𝑁‘𝑋) ∧ ∀𝑦(𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))))
16		df-rex 3070	. . . 4 ⊢ (∃𝑢 ∈ (𝑁‘𝑋)∀𝑦(𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))) ↔ ∃𝑢(𝑢 ∈ (𝑁‘𝑋) ∧ ∀𝑦(𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))))
17	15, 16	bitr4i 277	. . 3 ⊢ ({𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))} ∈ (𝑁‘𝑋) ↔ ∃𝑢 ∈ (𝑁‘𝑋)∀𝑦(𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))))
18		ibar 529	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐵 → (𝑆 ∈ (𝑁‘𝑦) ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))))
19	18	bibi2d 342	. . . . . . 7 ⊢ (𝑦 ∈ 𝐵 → ((𝑦 ∈ 𝑢 ↔ 𝑆 ∈ (𝑁‘𝑦)) ↔ (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))))
20	19	ralbiia 3090	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ 𝑆 ∈ (𝑁‘𝑦)) ↔ ∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))))
21		ssv 3986	. . . . . . . 8 ⊢ 𝐵 ⊆ V
22	21	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → 𝐵 ⊆ V)
23		vex 3463	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
24		eldif 3938	. . . . . . . . . 10 ⊢ (𝑦 ∈ (V ∖ 𝐵) ↔ (𝑦 ∈ V ∧ ¬ 𝑦 ∈ 𝐵))
25	23, 24	mpbiran 707	. . . . . . . . 9 ⊢ (𝑦 ∈ (V ∖ 𝐵) ↔ ¬ 𝑦 ∈ 𝐵)
26	1, 2, 3	ntrneinex 42504	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵))
27		elmapi 8809	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵) → 𝑁:𝐵⟶𝒫 𝒫 𝐵)
28	26, 27	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑁:𝐵⟶𝒫 𝒫 𝐵)
29	28, 4	ffvelcdmd 7056	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑁‘𝑋) ∈ 𝒫 𝒫 𝐵)
30	29	elpwid 4589	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑁‘𝑋) ⊆ 𝒫 𝐵)
31	30	sselda 3962	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → 𝑢 ∈ 𝒫 𝐵)
32	31	elpwid 4589	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → 𝑢 ⊆ 𝐵)
33	32	sseld 3961	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → (𝑦 ∈ 𝑢 → 𝑦 ∈ 𝐵))
34	33	con3dimp 409	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) ∧ ¬ 𝑦 ∈ 𝐵) → ¬ 𝑦 ∈ 𝑢)
35		pm3.14 994	. . . . . . . . . . . . 13 ⊢ ((¬ 𝑦 ∈ 𝐵 ∨ ¬ 𝑆 ∈ (𝑁‘𝑦)) → ¬ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))
36	35	orcs 873	. . . . . . . . . . . 12 ⊢ (¬ 𝑦 ∈ 𝐵 → ¬ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))
37	36	adantl 482	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) ∧ ¬ 𝑦 ∈ 𝐵) → ¬ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))
38	34, 37	2falsed 376	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) ∧ ¬ 𝑦 ∈ 𝐵) → (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))))
39	38	ex 413	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → (¬ 𝑦 ∈ 𝐵 → (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))))
40	25, 39	biimtrid 241	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → (𝑦 ∈ (V ∖ 𝐵) → (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))))
41	40	ralrimiv 3144	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → ∀𝑦 ∈ (V ∖ 𝐵)(𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))))
42	22, 41	raldifeq 4471	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → (∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))) ↔ ∀𝑦 ∈ V (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))))
43	20, 42	bitrid 282	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → (∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ 𝑆 ∈ (𝑁‘𝑦)) ↔ ∀𝑦 ∈ V (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦)))))
44		ralv 3483	. . . . 5 ⊢ (∀𝑦 ∈ V (𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))) ↔ ∀𝑦(𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))))
45	43, 44	bitr2di 287	. . . 4 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁‘𝑋)) → (∀𝑦(𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))) ↔ ∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ 𝑆 ∈ (𝑁‘𝑦))))
46	45	rexbidva 3175	. . 3 ⊢ (𝜑 → (∃𝑢 ∈ (𝑁‘𝑋)∀𝑦(𝑦 ∈ 𝑢 ↔ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))) ↔ ∃𝑢 ∈ (𝑁‘𝑋)∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ 𝑆 ∈ (𝑁‘𝑦))))
47	17, 46	bitrid 282	. 2 ⊢ (𝜑 → ({𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝑆 ∈ (𝑁‘𝑦))} ∈ (𝑁‘𝑋) ↔ ∃𝑢 ∈ (𝑁‘𝑋)∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ 𝑆 ∈ (𝑁‘𝑦))))
48	10, 14, 47	3bitrd 304	1 ⊢ (𝜑 → (𝑋 ∈ (𝐼‘(𝐼‘𝑆)) ↔ ∃𝑢 ∈ (𝑁‘𝑋)∀𝑦 ∈ 𝐵 (𝑦 ∈ 𝑢 ↔ 𝑆 ∈ (𝑁‘𝑦))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396  ∀wal 1539   = wceq 1541  ∃wex 1781   ∈ wcel 2106  {cab 2708  ∀wral 3060  ∃wrex 3069  {crab 3418  Vcvv 3459   ∖ cdif 3925   ⊆ wss 3928  𝒫 cpw 4580   class class class wbr 5125   ↦ cmpt 5208  ⟶wf 6512  ‘cfv 6516  (class class class)co 7377   ∈ cmpo 7379   ↑_m cmap 8787

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-rep 5262  ax-sep 5276  ax-nul 5283  ax-pow 5340  ax-pr 5404  ax-un 7692

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  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 3365  df-rab 3419  df-v 3461  df-sbc 3758  df-csb 3874  df-dif 3931  df-un 3933  df-in 3935  df-ss 3945  df-nul 4303  df-if 4507  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4886  df-iun 4976  df-br 5126  df-opab 5188  df-mpt 5209  df-id 5551  df-xp 5659  df-rel 5660  df-cnv 5661  df-co 5662  df-dm 5663  df-rn 5664  df-res 5665  df-ima 5666  df-iota 6468  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-ov 7380  df-oprab 7381  df-mpo 7382  df-1st 7941  df-2nd 7942  df-map 8789

This theorem is referenced by:  ntrneik4  42528