Metamath Proof Explorer


Theorem elexOLD

Description: Obsolete version of elex as of 28-May-2025. (Contributed by NM, 26-May-1993) (Proof shortened by Andrew Salmon, 8-Jun-2011) (Proof modification is discouraged.) (New usage is discouraged.)

Ref Expression
Assertion elexOLD ( 𝐴𝐵𝐴 ∈ V )

Proof

Step Hyp Ref Expression
1 exsimpl ( ∃ 𝑥 ( 𝑥 = 𝐴𝑥𝐵 ) → ∃ 𝑥 𝑥 = 𝐴 )
2 dfclel ( 𝐴𝐵 ↔ ∃ 𝑥 ( 𝑥 = 𝐴𝑥𝐵 ) )
3 isset ( 𝐴 ∈ V ↔ ∃ 𝑥 𝑥 = 𝐴 )
4 1 2 3 3imtr4i ( 𝐴𝐵𝐴 ∈ V )