Theorem ntrneik13 44190

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 3918	. . . . . . . . 9 ⊢ ((𝐼‘(𝑠 ∩ 𝑡)) ⊆ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡))𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)))
2		ntrnei.o	. . . . . . . . . . . . . . 15 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
3		ntrnei.f	. . . . . . . . . . . . . . 15 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
4		ntrnei.r	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐼𝐹𝑁)
5	2, 3, 4	ntrneiiex 44168	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
6		elmapi 8773	. . . . . . . . . . . . . 14 ⊢ (𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
7	5, 6	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
8	7	ad2antrr 726	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
9	2, 3, 4	ntrneibex 44165	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐵 ∈ V)
10	9	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝐵 ∈ V)
11		simplr 768	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝑠 ∈ 𝒫 𝐵)
12		elpwi 4554	. . . . . . . . . . . . . 14 ⊢ (𝑠 ∈ 𝒫 𝐵 → 𝑠 ⊆ 𝐵)
13		ssinss1 4193	. . . . . . . . . . . . . 14 ⊢ (𝑠 ⊆ 𝐵 → (𝑠 ∩ 𝑡) ⊆ 𝐵)
14	11, 12, 13	3syl 18	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (𝑠 ∩ 𝑡) ⊆ 𝐵)
15	10, 14	sselpwd 5264	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (𝑠 ∩ 𝑡) ∈ 𝒫 𝐵)
16	8, 15	ffvelcdmd 7018	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (𝐼‘(𝑠 ∩ 𝑡)) ∈ 𝒫 𝐵)
17	16	elpwid 4556	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (𝐼‘(𝑠 ∩ 𝑡)) ⊆ 𝐵)
18		ralss 4004	. . . . . . . . . 10 ⊢ ((𝐼‘(𝑠 ∩ 𝑡)) ⊆ 𝐵 → (∀𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡))𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) → 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)))))
19	17, 18	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (∀𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡))𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) → 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)))))
20	1, 19	bitrid 283	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → ((𝐼‘(𝑠 ∩ 𝑡)) ⊆ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) → 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)))))
21		dfss3 3918	. . . . . . . . 9 ⊢ (((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ⊆ (𝐼‘(𝑠 ∩ 𝑡)) ↔ ∀𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡))𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)))
22	7	ffvelcdmda 7017	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐼‘𝑠) ∈ 𝒫 𝐵)
23	22	elpwid 4556	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝐼‘𝑠) ⊆ 𝐵)
24		ssinss1 4193	. . . . . . . . . . . 12 ⊢ ((𝐼‘𝑠) ⊆ 𝐵 → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ⊆ 𝐵)
25	23, 24	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ⊆ 𝐵)
26	25	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ⊆ 𝐵)
27		ralss 4004	. . . . . . . . . 10 ⊢ (((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ⊆ 𝐵 → (∀𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡))𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) → 𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)))))
28	26, 27	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (∀𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡))𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) → 𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)))))
29	21, 28	bitrid 283	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ⊆ (𝐼‘(𝑠 ∩ 𝑡)) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) → 𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)))))
30	20, 29	anbi12d 632	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (((𝐼‘(𝑠 ∩ 𝑡)) ⊆ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ∧ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ⊆ (𝐼‘(𝑠 ∩ 𝑡))) ↔ (∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) → 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡))) ∧ ∀𝑥 ∈ 𝐵 (𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) → 𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡))))))
31		eqss 3945	. . . . . . 7 ⊢ ((𝐼‘(𝑠 ∩ 𝑡)) = ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ((𝐼‘(𝑠 ∩ 𝑡)) ⊆ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ∧ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ⊆ (𝐼‘(𝑠 ∩ 𝑡))))
32		ralbiim 3094	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) ↔ 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡))) ↔ (∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) → 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡))) ∧ ∀𝑥 ∈ 𝐵 (𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) → 𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)))))
33	30, 31, 32	3bitr4g 314	. . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → ((𝐼‘(𝑠 ∩ 𝑡)) = ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) ↔ 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)))))
34	4	ad3antrrr 730	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝐼𝐹𝑁)
35		simpr 484	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
36	9	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝐵 ∈ V)
37		simpr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑠 ∈ 𝒫 𝐵)
38	37	elpwid 4556	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑠 ⊆ 𝐵)
39	38, 13	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝑠 ∩ 𝑡) ⊆ 𝐵)
40	36, 39	sselpwd 5264	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝑠 ∩ 𝑡) ∈ 𝒫 𝐵)
41	40	ad2antrr 726	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑠 ∩ 𝑡) ∈ 𝒫 𝐵)
42	2, 3, 34, 35, 41	ntrneiel 44173	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) ↔ (𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥)))
43		elin 3913	. . . . . . . . 9 ⊢ (𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ (𝑥 ∈ (𝐼‘𝑠) ∧ 𝑥 ∈ (𝐼‘𝑡)))
44		simpllr 775	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑠 ∈ 𝒫 𝐵)
45	2, 3, 34, 35, 44	ntrneiel 44173	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ (𝐼‘𝑠) ↔ 𝑠 ∈ (𝑁‘𝑥)))
46		simplr 768	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑡 ∈ 𝒫 𝐵)
47	2, 3, 34, 35, 46	ntrneiel 44173	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ (𝐼‘𝑡) ↔ 𝑡 ∈ (𝑁‘𝑥)))
48	45, 47	anbi12d 632	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥 ∈ (𝐼‘𝑠) ∧ 𝑥 ∈ (𝐼‘𝑡)) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥))))
49	43, 48	bitrid 283	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥))))
50	42, 49	bibi12d 345	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) ↔ 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡))) ↔ ((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥)))))
51	50	ralbidva 3153	. . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∩ 𝑡)) ↔ 𝑥 ∈ ((𝐼‘𝑠) ∩ (𝐼‘𝑡))) ↔ ∀𝑥 ∈ 𝐵 ((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥)))))
52	33, 51	bitrd 279	. . . . 5 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → ((𝐼‘(𝑠 ∩ 𝑡)) = ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 ((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥)))))
53	52	ralbidva 3153	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠 ∩ 𝑡)) = ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑡 ∈ 𝒫 𝐵∀𝑥 ∈ 𝐵 ((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥)))))
54		ralcom 3260	. . . 4 ⊢ (∀𝑡 ∈ 𝒫 𝐵∀𝑥 ∈ 𝐵 ((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥))) ↔ ∀𝑥 ∈ 𝐵 ∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥))))
55	53, 54	bitrdi 287	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠 ∩ 𝑡)) = ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥)))))
56	55	ralbidva 3153	. 2 ⊢ (𝜑 → (∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠 ∩ 𝑡)) = ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑠 ∈ 𝒫 𝐵∀𝑥 ∈ 𝐵 ∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥)))))
57		ralcom 3260	. 2 ⊢ (∀𝑠 ∈ 𝒫 𝐵∀𝑥 ∈ 𝐵 ∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥))) ↔ ∀𝑥 ∈ 𝐵 ∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥))))
58	56, 57	bitrdi 287	1 ⊢ (𝜑 → (∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠 ∩ 𝑡)) = ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) ∈ (𝑁‘𝑥) ↔ (𝑠 ∈ (𝑁‘𝑥) ∧ 𝑡 ∈ (𝑁‘𝑥)))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2111  ∀wral 3047  {crab 3395  Vcvv 3436   ∩ cin 3896   ⊆ wss 3897  𝒫 cpw 4547   class class class wbr 5089   ↦ cmpt 5170  ⟶wf 6477  ‘cfv 6481  (class class class)co 7346   ∈ cmpo 7348   ↑_m cmap 8750

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 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-oprab 7350  df-mpo 7351  df-1st 7921  df-2nd 7922  df-map 8752

This theorem is referenced by: (None)