Metamath Proof Explorer


Theorem ssexg

Description: A subclass of a set is a set. Exercise 3 of TakeutiZaring p. 22 (generalized). (Contributed by NM, 14-Aug-1994) (Proof shortened by BJ, 18-Jul-2026)

Ref Expression
Assertion ssexg ⊢ A ⊆ B ∧ B ∈ C → A ∈ V

Proof

Step Hyp Ref Expression
1 dfss2 ⊢ A ⊆ B ↔ A ∩ B = A
2 inex2g ⊢ B ∈ C → A ∩ B ∈ V
3 eleq1 ⊢ A ∩ B = A → A ∩ B ∈ V ↔ A ∈ V
4 3 biimpa ⊢ A ∩ B = A ∧ A ∩ B ∈ V → A ∈ V
5 2 4 sylan2 ⊢ A ∩ B = A ∧ B ∈ C → A ∈ V
6 1 5 sylanb ⊢ A ⊆ B ∧ B ∈ C → A ∈ V