Metamath Proof Explorer


Theorem bj-inexeqex

Description: Lemma for bj-opelid (but not specific to the identity relation): if the intersection of two classes is a set and the two classes are equal, then both are sets (all three classes are equal, so they all belong to V , but it is more convenient to have _V in the consequent for theorems using it). (Contributed by BJ, 27-Dec-2023)

Ref Expression
Assertion bj-inexeqex ⊢ A ∩ B ∈ V ∧ A = B → A ∈ V ∧ B ∈ V

Proof

Step Hyp Ref Expression
1 eqimss ⊢ A = B → A ⊆ B
2 dfss2 ⊢ A ⊆ B ↔ A ∩ B = A
3 1 2 sylib ⊢ A = B → A ∩ B = A
4 eleq1 ⊢ A ∩ B = A → A ∩ B ∈ V ↔ A ∈ V
5 4 biimpac ⊢ A ∩ B ∈ V ∧ A ∩ B = A → A ∈ V
6 3 5 sylan2 ⊢ A ∩ B ∈ V ∧ A = B → A ∈ V
7 6 elexd ⊢ A ∩ B ∈ V ∧ A = B → A ∈ V
8 eqimss2 ⊢ A = B → B ⊆ A
9 sseqin2 ⊢ B ⊆ A ↔ A ∩ B = B
10 8 9 sylib ⊢ A = B → A ∩ B = B
11 eleq1 ⊢ A ∩ B = B → A ∩ B ∈ V ↔ B ∈ V
12 11 biimpac ⊢ A ∩ B ∈ V ∧ A ∩ B = B → B ∈ V
13 10 12 sylan2 ⊢ A ∩ B ∈ V ∧ A = B → B ∈ V
14 13 elexd ⊢ A ∩ B ∈ V ∧ A = B → B ∈ V
15 7 14 jca ⊢ A ∩ B ∈ V ∧ A = B → A ∈ V ∧ B ∈ V