Metamath Proof Explorer


Theorem rexbidvALT

Description: Alternate proof of rexbidv , shorter but requires more axioms. (Contributed by NM, 20-Nov-1994) (New usage is discouraged.) (Proof modification is discouraged.)

Ref Expression
Hypothesis rexbidvALT.1 ⊢ φ → ψ ↔ χ
Assertion rexbidvALT ⊢ φ → ∃ x ∈ A ψ ↔ ∃ x ∈ A χ

Proof

Step Hyp Ref Expression
1 rexbidvALT.1 ⊢ φ → ψ ↔ χ
2 nfv ⊢ Ⅎ x φ
3 2 1 rexbid ⊢ φ → ∃ x ∈ A ψ ↔ ∃ x ∈ A χ