Metamath Proof Explorer


Theorem cplem2

Description: Lemma for the Collection Principle cp . (Contributed by NM, 17-Oct-2003) Use the Scott operation. (Revised by BTernaryTau, 19-Jul-2026)

Ref Expression
Hypothesis cplem2.1 ⊢ A ∈ V
Assertion cplem2 ⊢ ∃ y ∀ x ∈ A B ≠ ∅ → B ∩ y ≠ ∅

Proof

Step Hyp Ref Expression
1 cplem2.1 ⊢ A ∈ V
2 scottex ⊢ Scott B ∈ V
3 1 2 iunex ⊢ ⋃ x ∈ A Scott B ∈ V
4 nfiu1 ⊢ Ⅎ _ x ⋃ x ∈ A Scott B
5 4 nfeq2 ⊢ Ⅎ x y = ⋃ x ∈ A Scott B
6 ineq2 ⊢ y = ⋃ x ∈ A Scott B → B ∩ y = B ∩ ⋃ x ∈ A Scott B
7 6 neeq1d ⊢ y = ⋃ x ∈ A Scott B → B ∩ y ≠ ∅ ↔ B ∩ ⋃ x ∈ A Scott B ≠ ∅
8 7 imbi2d ⊢ y = ⋃ x ∈ A Scott B → B ≠ ∅ → B ∩ y ≠ ∅ ↔ B ≠ ∅ → B ∩ ⋃ x ∈ A Scott B ≠ ∅
9 5 8 ralbid ⊢ y = ⋃ x ∈ A Scott B → ∀ x ∈ A B ≠ ∅ → B ∩ y ≠ ∅ ↔ ∀ x ∈ A B ≠ ∅ → B ∩ ⋃ x ∈ A Scott B ≠ ∅
10 eqid ⊢ ⋃ x ∈ A Scott B = ⋃ x ∈ A Scott B
11 10 cplem1 ⊢ ∀ x ∈ A B ≠ ∅ → B ∩ ⋃ x ∈ A Scott B ≠ ∅
12 3 9 11 ceqsexv2d ⊢ ∃ y ∀ x ∈ A B ≠ ∅ → B ∩ y ≠ ∅