Metamath Proof Explorer


Theorem bj-opelid

Description: Characterization of the ordered pair elements of the identity relation when the intersection of their components are sets. The antecedent is more general than either component being a set. (Contributed by BJ, 29-Mar-2020)

Ref Expression
Assertion bj-opelid ⊢ A ∩ B ∈ V → A B ∈ I ↔ A = B

Proof

Step Hyp Ref Expression
1 bj-inexeqex ⊢ A ∩ B ∈ V ∧ A = B → A ∈ V ∧ B ∈ V
2 1 ex ⊢ A ∩ B ∈ V → A = B → A ∈ V ∧ B ∈ V
3 bj-opelidb ⊢ A B ∈ I ↔ A ∈ V ∧ B ∈ V ∧ A = B
4 simpr ⊢ A ∈ V ∧ B ∈ V ∧ A = B → A = B
5 ancr ⊢ A = B → A ∈ V ∧ B ∈ V → A = B → A ∈ V ∧ B ∈ V ∧ A = B
6 4 5 impbid2 ⊢ A = B → A ∈ V ∧ B ∈ V → A ∈ V ∧ B ∈ V ∧ A = B ↔ A = B
7 3 6 bitrid ⊢ A = B → A ∈ V ∧ B ∈ V → A B ∈ I ↔ A = B
8 2 7 syl ⊢ A ∩ B ∈ V → A B ∈ I ↔ A = B