Metamath Proof Explorer


Theorem cplem1

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 cplem1.1 ⊢ C = ⋃ x ∈ A Scott B
Assertion cplem1 ⊢ ∀ x ∈ A B ≠ ∅ → B ∩ C ≠ ∅

Proof

Step Hyp Ref Expression
1 cplem1.1 ⊢ C = ⋃ x ∈ A Scott B
2 scott0b ⊢ B = ∅ ↔ Scott B = ∅
3 2 necon3bii ⊢ B ≠ ∅ ↔ Scott B ≠ ∅
4 n0 ⊢ Scott B ≠ ∅ ↔ ∃ y y ∈ Scott B
5 3 4 bitri ⊢ B ≠ ∅ ↔ ∃ y y ∈ Scott B
6 scottss ⊢ Scott B ⊆ B
7 6 sseli ⊢ y ∈ Scott B → y ∈ B
8 7 a1i ⊢ x ∈ A → y ∈ Scott B → y ∈ B
9 ssiun2 ⊢ x ∈ A → Scott B ⊆ ⋃ x ∈ A Scott B
10 9 1 sseqtrrdi ⊢ x ∈ A → Scott B ⊆ C
11 10 sseld ⊢ x ∈ A → y ∈ Scott B → y ∈ C
12 8 11 jcad ⊢ x ∈ A → y ∈ Scott B → y ∈ B ∧ y ∈ C
13 inelcm ⊢ y ∈ B ∧ y ∈ C → B ∩ C ≠ ∅
14 12 13 syl6 ⊢ x ∈ A → y ∈ Scott B → B ∩ C ≠ ∅
15 14 exlimdv ⊢ x ∈ A → ∃ y y ∈ Scott B → B ∩ C ≠ ∅
16 5 15 biimtrid ⊢ x ∈ A → B ≠ ∅ → B ∩ C ≠ ∅
17 16 rgen ⊢ ∀ x ∈ A B ≠ ∅ → B ∩ C ≠ ∅