This is an inofficial mirror of http://metamath.tirix.org for personal testing of a visualizer extension only.

Metamath Proof Explorer

Theorem rexbidv

Description: Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 20-Nov-1994) Reduce dependencies on axioms. (Revised by Wolf Lammen, 6-Dec-2019)

		Ref	Expression
	Hypothesis	ralbidv.1	⊢ ( 𝜑 → ( 𝜓 ↔ 𝜒 ) )
	Assertion	rexbidv	⊢ ( 𝜑 → ( ∃ 𝑥 ∈ 𝐴 𝜓 ↔ ∃ 𝑥 ∈ 𝐴 𝜒 ) )

Proof

Step	Hyp	Ref	Expression
1		ralbidv.1	⊢ ( 𝜑 → ( 𝜓 ↔ 𝜒 ) )
2	1	adantr	⊢ ( ( 𝜑 ∧ 𝑥 ∈ 𝐴 ) → ( 𝜓 ↔ 𝜒 ) )
3	2	rexbidva	⊢ ( 𝜑 → ( ∃ 𝑥 ∈ 𝐴 𝜓 ↔ ∃ 𝑥 ∈ 𝐴 𝜒 ) )