Metamath Proof Explorer


Theorem bj-0int

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

Ref Expression
Assertion bj-0int ⊢ A ⊆ 𝒫 X → X ∈ B ∧ ∀ x ∈ 𝒫 A ∖ ∅ ⋂ x ∈ B ↔ ∀ x ∈ 𝒫 A X ∩ ⋂ x ∈ B

Proof

Step Hyp Ref Expression
1 ssv ⊢ X ⊆ V
2 int0 ⊢ ⋂ ∅ = V
3 1 2 sseqtrri ⊢ X ⊆ ⋂ ∅
4 dfss2 ⊢ X ⊆ ⋂ ∅ ↔ X ∩ ⋂ ∅ = X
5 3 4 mpbi ⊢ X ∩ ⋂ ∅ = X
6 5 eqcomi ⊢ X = X ∩ ⋂ ∅
7 6 eleq1i ⊢ X ∈ B ↔ X ∩ ⋂ ∅ ∈ B
8 7 a1i ⊢ A ⊆ 𝒫 X → X ∈ B ↔ X ∩ ⋂ ∅ ∈ B
9 eldifsn ⊢ x ∈ 𝒫 A ∖ ∅ ↔ x ∈ 𝒫 A ∧ x ≠ ∅
10 sstr2 ⊢ x ⊆ A → A ⊆ 𝒫 X → x ⊆ 𝒫 X
11 intss2 ⊢ x ⊆ 𝒫 X → x ≠ ∅ → ⋂ x ⊆ X
12 10 11 syl6 ⊢ x ⊆ A → A ⊆ 𝒫 X → x ≠ ∅ → ⋂ x ⊆ X
13 elpwi ⊢ x ∈ 𝒫 A → x ⊆ A
14 12 13 syl11 ⊢ A ⊆ 𝒫 X → x ∈ 𝒫 A → x ≠ ∅ → ⋂ x ⊆ X
15 14 impd ⊢ A ⊆ 𝒫 X → x ∈ 𝒫 A ∧ x ≠ ∅ → ⋂ x ⊆ X
16 9 15 biimtrid ⊢ A ⊆ 𝒫 X → x ∈ 𝒫 A ∖ ∅ → ⋂ x ⊆ X
17 dfss2 ⊢ ⋂ x ⊆ X ↔ ⋂ x ∩ X = ⋂ x
18 incom ⊢ ⋂ x ∩ X = X ∩ ⋂ x
19 18 eqeq1i ⊢ ⋂ x ∩ X = ⋂ x ↔ X ∩ ⋂ x = ⋂ x
20 eqcom ⊢ X ∩ ⋂ x = ⋂ x ↔ ⋂ x = X ∩ ⋂ x
21 19 20 sylbb ⊢ ⋂ x ∩ X = ⋂ x → ⋂ x = X ∩ ⋂ x
22 17 21 sylbi ⊢ ⋂ x ⊆ X → ⋂ x = X ∩ ⋂ x
23 eleq1 ⊢ ⋂ x = X ∩ ⋂ x → ⋂ x ∈ B ↔ X ∩ ⋂ x ∈ B
24 23 a1i ⊢ A ⊆ 𝒫 X → ⋂ x = X ∩ ⋂ x → ⋂ x ∈ B ↔ X ∩ ⋂ x ∈ B
25 22 24 syl5 ⊢ A ⊆ 𝒫 X → ⋂ x ⊆ X → ⋂ x ∈ B ↔ X ∩ ⋂ x ∈ B
26 16 25 syld ⊢ A ⊆ 𝒫 X → x ∈ 𝒫 A ∖ ∅ → ⋂ x ∈ B ↔ X ∩ ⋂ x ∈ B
27 26 ralrimiv ⊢ A ⊆ 𝒫 X → ∀ x ∈ 𝒫 A ∖ ∅ ⋂ x ∈ B ↔ X ∩ ⋂ x ∈ B
28 ralbi ⊢ ∀ x ∈ 𝒫 A ∖ ∅ ⋂ x ∈ B ↔ X ∩ ⋂ x ∈ B → ∀ x ∈ 𝒫 A ∖ ∅ ⋂ x ∈ B ↔ ∀ x ∈ 𝒫 A ∖ ∅ X ∩ ⋂ x ∈ B
29 27 28 syl ⊢ A ⊆ 𝒫 X → ∀ x ∈ 𝒫 A ∖ ∅ ⋂ x ∈ B ↔ ∀ x ∈ 𝒫 A ∖ ∅ X ∩ ⋂ x ∈ B
30 8 29 anbi12d ⊢ A ⊆ 𝒫 X → X ∈ B ∧ ∀ x ∈ 𝒫 A ∖ ∅ ⋂ x ∈ B ↔ X ∩ ⋂ ∅ ∈ B ∧ ∀ x ∈ 𝒫 A ∖ ∅ X ∩ ⋂ x ∈ B
31 30 biancomd ⊢ A ⊆ 𝒫 X → X ∈ B ∧ ∀ x ∈ 𝒫 A ∖ ∅ ⋂ x ∈ B ↔ ∀ x ∈ 𝒫 A ∖ ∅ X ∩ ⋂ x ∈ B ∧ X ∩ ⋂ ∅ ∈ B
32 0elpw ⊢ ∅ ∈ 𝒫 A
33 inteq ⊢ x = ∅ → ⋂ x = ⋂ ∅
34 ineq2 ⊢ ⋂ x = ⋂ ∅ → X ∩ ⋂ x = X ∩ ⋂ ∅
35 eleq1 ⊢ X ∩ ⋂ x = X ∩ ⋂ ∅ → X ∩ ⋂ x ∈ B ↔ X ∩ ⋂ ∅ ∈ B
36 33 34 35 3syl ⊢ x = ∅ → X ∩ ⋂ x ∈ B ↔ X ∩ ⋂ ∅ ∈ B
37 36 bj-raldifsn ⊢ ∅ ∈ 𝒫 A → ∀ x ∈ 𝒫 A X ∩ ⋂ x ∈ B ↔ ∀ x ∈ 𝒫 A ∖ ∅ X ∩ ⋂ x ∈ B ∧ X ∩ ⋂ ∅ ∈ B
38 32 37 ax-mp ⊢ ∀ x ∈ 𝒫 A X ∩ ⋂ x ∈ B ↔ ∀ x ∈ 𝒫 A ∖ ∅ X ∩ ⋂ x ∈ B ∧ X ∩ ⋂ ∅ ∈ B
39 31 38 bitr4di ⊢ A ⊆ 𝒫 X → X ∈ B ∧ ∀ x ∈ 𝒫 A ∖ ∅ ⋂ x ∈ B ↔ ∀ x ∈ 𝒫 A X ∩ ⋂ x ∈ B