Theorem rmobii 3367

Description: Formula-building rule for restricted at-most-one quantifier (inference form). (Contributed by NM, 16-Jun-2017.)

Hypothesis

Ref	Expression
rmobii.1	⊢ (𝜑 ↔ 𝜓)

Assertion

Ref	Expression
rmobii	⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥 ∈ 𝐴 𝜓)

Proof of Theorem rmobii

Step	Hyp	Ref	Expression
1		rmobii.1	. . 3 ⊢ (𝜑 ↔ 𝜓)
2	1	a1i 11	. 2 ⊢ (𝑥 ∈ 𝐴 → (𝜑 ↔ 𝜓))
3	2	rmobiia 3365	1 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥 ∈ 𝐴 𝜓)

Syntax hints:   ↔ wb 206   ∈ wcel 2108  ∃*wrmo 3358

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1780  df-mo 2539  df-rmo 3359

This theorem is referenced by:  2reu5a  3727  reuxfrd  3731  brdom7disj  10545  2sqreulem4  27417  nomaxmo  27662  reuxfrdf  32472  cvmlift2lem13  35337  ineccnvmo  38375  dfeldisj5  38739  lubeldm2  48930  glbeldm2  48931