Theorem bj-0int 34395

Description: If 𝐴 is a collection of subsets of 𝑋, like a Moore collection or a topology, two equivalent ways to say that arbitrary intersections of elements of 𝐴 relative to 𝑋 belong to some class 𝐵: the LHS singles out the empty intersection (the empty intersection relative to 𝑋 is 𝑋 and the intersection of a nonempty family of subsets of 𝑋 is included in 𝑋, so there is no need to intersect it with 𝑋). In typical applications, 𝐵 is 𝐴 itself. (Contributed by BJ, 7-Dec-2021.)

Assertion

Ref	Expression
bj-0int	⊢ (𝐴 ⊆ 𝒫 𝑋 → ((𝑋 ∈ 𝐵 ∧ ∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})∩ 𝑥 ∈ 𝐵) ↔ ∀𝑥 ∈ 𝒫 𝐴(𝑋 ∩ ∩ 𝑥) ∈ 𝐵))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑋

Proof of Theorem bj-0int

Step	Hyp	Ref	Expression
1		ssv 3993	. . . . . . . . 9 ⊢ 𝑋 ⊆ V
2		int0 4892	. . . . . . . . 9 ⊢ ∩ ∅ = V
3	1, 2	sseqtrri 4006	. . . . . . . 8 ⊢ 𝑋 ⊆ ∩ ∅
4		df-ss 3954	. . . . . . . 8 ⊢ (𝑋 ⊆ ∩ ∅ ↔ (𝑋 ∩ ∩ ∅) = 𝑋)
5	3, 4	mpbi 232	. . . . . . 7 ⊢ (𝑋 ∩ ∩ ∅) = 𝑋
6	5	eqcomi 2832	. . . . . 6 ⊢ 𝑋 = (𝑋 ∩ ∩ ∅)
7	6	eleq1i 2905	. . . . 5 ⊢ (𝑋 ∈ 𝐵 ↔ (𝑋 ∩ ∩ ∅) ∈ 𝐵)
8	7	a1i 11	. . . 4 ⊢ (𝐴 ⊆ 𝒫 𝑋 → (𝑋 ∈ 𝐵 ↔ (𝑋 ∩ ∩ ∅) ∈ 𝐵))
9		eldifsn 4721	. . . . . . . 8 ⊢ (𝑥 ∈ (𝒫 𝐴 ∖ {∅}) ↔ (𝑥 ∈ 𝒫 𝐴 ∧ 𝑥 ≠ ∅))
10		sstr2 3976	. . . . . . . . . . 11 ⊢ (𝑥 ⊆ 𝐴 → (𝐴 ⊆ 𝒫 𝑋 → 𝑥 ⊆ 𝒫 𝑋))
11		bj-intss 34393	. . . . . . . . . . 11 ⊢ (𝑥 ⊆ 𝒫 𝑋 → (𝑥 ≠ ∅ → ∩ 𝑥 ⊆ 𝑋))
12	10, 11	syl6 35	. . . . . . . . . 10 ⊢ (𝑥 ⊆ 𝐴 → (𝐴 ⊆ 𝒫 𝑋 → (𝑥 ≠ ∅ → ∩ 𝑥 ⊆ 𝑋)))
13		elpwi 4550	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝒫 𝐴 → 𝑥 ⊆ 𝐴)
14	12, 13	syl11 33	. . . . . . . . 9 ⊢ (𝐴 ⊆ 𝒫 𝑋 → (𝑥 ∈ 𝒫 𝐴 → (𝑥 ≠ ∅ → ∩ 𝑥 ⊆ 𝑋)))
15	14	impd 413	. . . . . . . 8 ⊢ (𝐴 ⊆ 𝒫 𝑋 → ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ⊆ 𝑋))
16	9, 15	syl5bi 244	. . . . . . 7 ⊢ (𝐴 ⊆ 𝒫 𝑋 → (𝑥 ∈ (𝒫 𝐴 ∖ {∅}) → ∩ 𝑥 ⊆ 𝑋))
17		df-ss 3954	. . . . . . . . 9 ⊢ (∩ 𝑥 ⊆ 𝑋 ↔ (∩ 𝑥 ∩ 𝑋) = ∩ 𝑥)
18		incom 4180	. . . . . . . . . . 11 ⊢ (∩ 𝑥 ∩ 𝑋) = (𝑋 ∩ ∩ 𝑥)
19	18	eqeq1i 2828	. . . . . . . . . 10 ⊢ ((∩ 𝑥 ∩ 𝑋) = ∩ 𝑥 ↔ (𝑋 ∩ ∩ 𝑥) = ∩ 𝑥)
20		eqcom 2830	. . . . . . . . . 10 ⊢ ((𝑋 ∩ ∩ 𝑥) = ∩ 𝑥 ↔ ∩ 𝑥 = (𝑋 ∩ ∩ 𝑥))
21	19, 20	sylbb 221	. . . . . . . . 9 ⊢ ((∩ 𝑥 ∩ 𝑋) = ∩ 𝑥 → ∩ 𝑥 = (𝑋 ∩ ∩ 𝑥))
22	17, 21	sylbi 219	. . . . . . . 8 ⊢ (∩ 𝑥 ⊆ 𝑋 → ∩ 𝑥 = (𝑋 ∩ ∩ 𝑥))
23		eleq1 2902	. . . . . . . . 9 ⊢ (∩ 𝑥 = (𝑋 ∩ ∩ 𝑥) → (∩ 𝑥 ∈ 𝐵 ↔ (𝑋 ∩ ∩ 𝑥) ∈ 𝐵))
24	23	a1i 11	. . . . . . . 8 ⊢ (𝐴 ⊆ 𝒫 𝑋 → (∩ 𝑥 = (𝑋 ∩ ∩ 𝑥) → (∩ 𝑥 ∈ 𝐵 ↔ (𝑋 ∩ ∩ 𝑥) ∈ 𝐵)))
25	22, 24	syl5 34	. . . . . . 7 ⊢ (𝐴 ⊆ 𝒫 𝑋 → (∩ 𝑥 ⊆ 𝑋 → (∩ 𝑥 ∈ 𝐵 ↔ (𝑋 ∩ ∩ 𝑥) ∈ 𝐵)))
26	16, 25	syld 47	. . . . . 6 ⊢ (𝐴 ⊆ 𝒫 𝑋 → (𝑥 ∈ (𝒫 𝐴 ∖ {∅}) → (∩ 𝑥 ∈ 𝐵 ↔ (𝑋 ∩ ∩ 𝑥) ∈ 𝐵)))
27	26	ralrimiv 3183	. . . . 5 ⊢ (𝐴 ⊆ 𝒫 𝑋 → ∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})(∩ 𝑥 ∈ 𝐵 ↔ (𝑋 ∩ ∩ 𝑥) ∈ 𝐵))
28		ralbi 3169	. . . . 5 ⊢ (∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})(∩ 𝑥 ∈ 𝐵 ↔ (𝑋 ∩ ∩ 𝑥) ∈ 𝐵) → (∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})∩ 𝑥 ∈ 𝐵 ↔ ∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})(𝑋 ∩ ∩ 𝑥) ∈ 𝐵))
29	27, 28	syl 17	. . . 4 ⊢ (𝐴 ⊆ 𝒫 𝑋 → (∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})∩ 𝑥 ∈ 𝐵 ↔ ∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})(𝑋 ∩ ∩ 𝑥) ∈ 𝐵))
30	8, 29	anbi12d 632	. . 3 ⊢ (𝐴 ⊆ 𝒫 𝑋 → ((𝑋 ∈ 𝐵 ∧ ∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})∩ 𝑥 ∈ 𝐵) ↔ ((𝑋 ∩ ∩ ∅) ∈ 𝐵 ∧ ∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})(𝑋 ∩ ∩ 𝑥) ∈ 𝐵)))
31	30	biancomd 466	. 2 ⊢ (𝐴 ⊆ 𝒫 𝑋 → ((𝑋 ∈ 𝐵 ∧ ∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})∩ 𝑥 ∈ 𝐵) ↔ (∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})(𝑋 ∩ ∩ 𝑥) ∈ 𝐵 ∧ (𝑋 ∩ ∩ ∅) ∈ 𝐵)))
32		0elpw 5258	. . 3 ⊢ ∅ ∈ 𝒫 𝐴
33		inteq 4881	. . . . 5 ⊢ (𝑥 = ∅ → ∩ 𝑥 = ∩ ∅)
34		ineq2 4185	. . . . 5 ⊢ (∩ 𝑥 = ∩ ∅ → (𝑋 ∩ ∩ 𝑥) = (𝑋 ∩ ∩ ∅))
35		eleq1 2902	. . . . 5 ⊢ ((𝑋 ∩ ∩ 𝑥) = (𝑋 ∩ ∩ ∅) → ((𝑋 ∩ ∩ 𝑥) ∈ 𝐵 ↔ (𝑋 ∩ ∩ ∅) ∈ 𝐵))
36	33, 34, 35	3syl 18	. . . 4 ⊢ (𝑥 = ∅ → ((𝑋 ∩ ∩ 𝑥) ∈ 𝐵 ↔ (𝑋 ∩ ∩ ∅) ∈ 𝐵))
37	36	bj-raldifsn 34394	. . 3 ⊢ (∅ ∈ 𝒫 𝐴 → (∀𝑥 ∈ 𝒫 𝐴(𝑋 ∩ ∩ 𝑥) ∈ 𝐵 ↔ (∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})(𝑋 ∩ ∩ 𝑥) ∈ 𝐵 ∧ (𝑋 ∩ ∩ ∅) ∈ 𝐵)))
38	32, 37	ax-mp 5	. 2 ⊢ (∀𝑥 ∈ 𝒫 𝐴(𝑋 ∩ ∩ 𝑥) ∈ 𝐵 ↔ (∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})(𝑋 ∩ ∩ 𝑥) ∈ 𝐵 ∧ (𝑋 ∩ ∩ ∅) ∈ 𝐵))
39	31, 38	syl6bbr 291	1 ⊢ (𝐴 ⊆ 𝒫 𝑋 → ((𝑋 ∈ 𝐵 ∧ ∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})∩ 𝑥 ∈ 𝐵) ↔ ∀𝑥 ∈ 𝒫 𝐴(𝑋 ∩ ∩ 𝑥) ∈ 𝐵))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1537   ∈ wcel 2114   ≠ wne 3018  ∀wral 3140  Vcvv 3496   ∖ cdif 3935   ∩ cin 3937   ⊆ wss 3938  ∅c0 4293  𝒫 cpw 4541  {csn 4569  ∩ cint 4878

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-nul 5212

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-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-pw 4543  df-sn 4570  df-uni 4841  df-int 4879

This theorem is referenced by: (None)