Theorem ntrneik13 42360

Description: The interior of the intersection of any pair equals intersection of interiors if and only if the intersection of any pair belonging to the neighborhood of a point is equivalent to both of the pair belonging to the neighborhood of that point. (Contributed by RP, 19-Jun-2021.)

Hypotheses

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

Assertion

Ref	Expression
ntrneik13	⊢ (𝜑 → (∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠 ∩ 𝑡)) = ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥)))))

Distinct variable groups:   𝐵,𝑖,𝑗,𝑘,𝑙,𝑚,𝑠,𝑡,𝑥   𝑘,𝐼,𝑙,𝑚,𝑥   𝜑,𝑖,𝑗,𝑘,𝑙,𝑠,𝑡,𝑥

Allowed substitution hints:   𝜑(𝑚)   𝐹(𝑥,𝑡,𝑖,𝑗,𝑘,𝑚,𝑠,𝑙)   𝐼(𝑡,𝑖,𝑗,𝑠)   𝑁(𝑥,𝑡,𝑖,𝑗,𝑘,𝑚,𝑠,𝑙)   𝑂(𝑥,𝑡,𝑖,𝑗,𝑘,𝑚,𝑠,𝑙)

Proof of Theorem ntrneik13

Step	Hyp	Ref	Expression
1		dfss3 3932	. . . . . . . . 9 ⊢ ((𝐼‘(𝑠 ∩ 𝑡)) ⊆ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡))𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)))
2		ntrnei.o	. . . . . . . . . . . . . . 15 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
3		ntrnei.f	. . . . . . . . . . . . . . 15 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
4		ntrnei.r	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐼𝐹𝑁)
5	2, 3, 4	ntrneiiex 42338	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
6		elmapi 8787	. . . . . . . . . . . . . 14 ⊢ (𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
7	5, 6	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
8	7	ad2antrr 724	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
9	2, 3, 4	ntrneibex 42335	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐵 ∈ V)
10	9	ad2antrr 724	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝐵 ∈ V)
11		simplr 767	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝑠 ∈ 𝒫 𝐵)
12		elpwi 4567	. . . . . . . . . . . . . 14 ⊢ (𝑠 ∈ 𝒫 𝐵 → 𝑠 ⊆ 𝐵)
13		ssinss1 4197	. . . . . . . . . . . . . 14 ⊢ (𝑠 ⊆ 𝐵 → (𝑠 ∩ 𝑡) ⊆ 𝐵)
14	11, 12, 13	3syl 18	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (𝑠 ∩ 𝑡) ⊆ 𝐵)
15	10, 14	sselpwd 5283	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (𝑠 ∩ 𝑡) ∈ 𝒫 𝐵)
16	8, 15	ffvelcdmd 7036	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (𝐼‘(𝑠 ∩ 𝑡)) ∈ 𝒫 𝐵)
17	16	elpwid 4569	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (𝐼‘(𝑠 ∩ 𝑡)) ⊆ 𝐵)
18		ralss 4014	. . . . . . . . . 10 ⊢ ((𝐼‘(𝑠 ∩ 𝑡)) ⊆ 𝐵 → (∀𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡))𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) → 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)))))
19	17, 18	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (∀𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡))𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) → 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)))))
20	1, 19	bitrid 282	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → ((𝐼‘(𝑠 ∩ 𝑡)) ⊆ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) → 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)))))
21		dfss3 3932	. . . . . . . . 9 ⊢ (((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ⊆ (𝐼‘(𝑠 ∩ 𝑡)) ↔ ∀𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡))𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)))
22	7	ffvelcdmda 7035	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐼‘𝑠) ∈ 𝒫 𝐵)
23	22	elpwid 4569	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐼‘𝑠) ⊆ 𝐵)
24		ssinss1 4197	. . . . . . . . . . . 12 ⊢ ((𝐼‘𝑠) ⊆ 𝐵 → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ⊆ 𝐵)
25	23, 24	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ⊆ 𝐵)
26	25	adantr 481	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ⊆ 𝐵)
27		ralss 4014	. . . . . . . . . 10 ⊢ (((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ⊆ 𝐵 → (∀𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡))𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) → 𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)))))
28	26, 27	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (∀𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡))𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) → 𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)))))
29	21, 28	bitrid 282	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ⊆ (𝐼‘(𝑠 ∩ 𝑡)) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) → 𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)))))
30	20, 29	anbi12d 631	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (((𝐼‘(𝑠 ∩ 𝑡)) ⊆ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ∧ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ⊆ (𝐼‘(𝑠 ∩ 𝑡))) ↔ (∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) → 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡))) ∧ ∀𝑥 ∈ 𝐵 (𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) → 𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡))))))
31		eqss 3959	. . . . . . 7 ⊢ ((𝐼‘(𝑠 ∩ 𝑡)) = ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ((𝐼‘(𝑠 ∩ 𝑡)) ⊆ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ∧ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ⊆ (𝐼‘(𝑠 ∩ 𝑡))))
32		ralbiim 3116	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) ↔ 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡))) ↔ (∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) → 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡))) ∧ ∀𝑥 ∈ 𝐵 (𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) → 𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)))))
33	30, 31, 32	3bitr4g 313	. . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → ((𝐼‘(𝑠 ∩ 𝑡)) = ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) ↔ 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)))))
34	4	ad3antrrr 728	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝐼𝐹𝑁)
35		simpr 485	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
36	9	adantr 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝐵 ∈ V)
37		simpr 485	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑠 ∈ 𝒫 𝐵)
38	37	elpwid 4569	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑠 ⊆ 𝐵)
39	38, 13	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝑠 ∩ 𝑡) ⊆ 𝐵)
40	36, 39	sselpwd 5283	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝑠 ∩ 𝑡) ∈ 𝒫 𝐵)
41	40	ad2antrr 724	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑠 ∩ 𝑡) ∈ 𝒫 𝐵)
42	2, 3, 34, 35, 41	ntrneiel 42343	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) ↔ (𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥)))
43		elin 3926	. . . . . . . . 9 ⊢ (𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ (𝑥 ∈ (𝐼‘𝑠) ∧ 𝑥 ∈ (𝐼‘𝑡)))
44		simpllr 774	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑠 ∈ 𝒫 𝐵)
45	2, 3, 34, 35, 44	ntrneiel 42343	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ (𝐼‘𝑠) ↔ 𝑠 ∈ (𝑁‘𝑥)))
46		simplr 767	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑡 ∈ 𝒫 𝐵)
47	2, 3, 34, 35, 46	ntrneiel 42343	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ (𝐼‘𝑡) ↔ 𝑡 ∈ (𝑁‘𝑥)))
48	45, 47	anbi12d 631	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥 ∈ (𝐼‘𝑠) ∧ 𝑥 ∈ (𝐼‘𝑡)) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥))))
49	43, 48	bitrid 282	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥))))
50	42, 49	bibi12d 345	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) ↔ 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡))) ↔ ((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥)))))
51	50	ralbidva 3172	. . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) ↔ 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡))) ↔ ∀𝑥 ∈ 𝐵 ((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥)))))
52	33, 51	bitrd 278	. . . . 5 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → ((𝐼‘(𝑠 ∩ 𝑡)) = ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 ((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥)))))
53	52	ralbidva 3172	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠 ∩ 𝑡)) = ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑡 ∈ 𝒫 𝐵∀𝑥 ∈ 𝐵 ((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥)))))
54		ralcom 3272	. . . 4 ⊢ (∀𝑡 ∈ 𝒫 𝐵∀𝑥 ∈ 𝐵 ((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥))) ↔ ∀𝑥 ∈ 𝐵 ∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥))))
55	53, 54	bitrdi 286	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠 ∩ 𝑡)) = ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥)))))
56	55	ralbidva 3172	. 2 ⊢ (𝜑 → (∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠 ∩ 𝑡)) = ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑠 ∈ 𝒫 𝐵∀𝑥 ∈ 𝐵 ∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥)))))
57		ralcom 3272	. 2 ⊢ (∀𝑠 ∈ 𝒫 𝐵∀𝑥 ∈ 𝐵 ∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥))) ↔ ∀𝑥 ∈ 𝐵 ∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥))))
58	56, 57	bitrdi 286	1 ⊢ (𝜑 → (∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠 ∩ 𝑡)) = ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥)))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3064  {crab 3407  Vcvv 3445   ∩ cin 3909   ⊆ wss 3910  𝒫 cpw 4560   class class class wbr 5105   ↦ cmpt 5188  ⟶wf 6492  ‘cfv 6496  (class class class)co 7357   ∈ cmpo 7359   ↑_m cmap 8765

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 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672

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 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-ov 7360  df-oprab 7361  df-mpo 7362  df-1st 7921  df-2nd 7922  df-map 8767

This theorem is referenced by: (None)