Theorem rmobida 3396

Description: Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 16-Jun-2017.)

Hypotheses

Ref	Expression
rmobida.1	⊢ Ⅎ𝑥𝜑
rmobida.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
rmobida	⊢ (𝜑 → (∃*𝑥 ∈ 𝐴 𝜓 ↔ ∃*𝑥 ∈ 𝐴 𝜒))

Proof of Theorem rmobida

Step	Hyp	Ref	Expression
1		rmobida.1	. . 3 ⊢ Ⅎ𝑥𝜑
2		rmobida.2	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝜒))
3	2	pm5.32da 578	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐴 ∧ 𝜒)))
4	1, 3	mobid 2538	. 2 ⊢ (𝜑 → (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜓) ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜒)))
5		df-rmo 3370	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜓 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
6		df-rmo 3370	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜒 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜒))
7	4, 5, 6	3bitr4g 314	1 ⊢ (𝜑 → (∃*𝑥 ∈ 𝐴 𝜓 ↔ ∃*𝑥 ∈ 𝐴 𝜒))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395  Ⅎwnf 1777   ∈ wcel 2098  ∃*wmo 2526  ∃*wrmo 3369

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-12 2163

This theorem depends on definitions:  df-bi 206  df-an 396  df-ex 1774  df-nf 1778  df-mo 2528  df-rmo 3370

This theorem is referenced by:  rmobidvaOLD  3398  reuan  3885