Theorem rmoeqbidv 37132

Description: Formula-building rule for restricted at-most-one quantifier. Deduction form. General version of rmobidv 3384. (Contributed by GG, 1-Sep-2025.)

Hypotheses

Ref	Expression
rmoeqbidv.1	⊢ (𝜑 → 𝐴 = 𝐵)
rmoeqbidv.2	⊢ (𝜑 → (𝜓 ↔ 𝜒))

Assertion

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

Distinct variable group:   𝜑,𝑥

Allowed substitution hints:   𝜓(𝑥)   𝜒(𝑥)   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem rmoeqbidv

Step	Hyp	Ref	Expression
1		rmoeqbidv.1	. . . . 5 ⊢ (𝜑 → 𝐴 = 𝐵)
2	1	eleq2d 2850	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
3		rmoeqbidv.2	. . . 4 ⊢ (𝜑 → (𝜓 ↔ 𝜒))
4	2, 3	anbi12d 644	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐵 ∧ 𝜒)))
5	4	mobidv 2577	. 2 ⊢ (𝜑 → (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜓) ↔ ∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝜒)))
6		df-rmo 3369	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜓 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
7		df-rmo 3369	. 2 ⊢ (∃*𝑥 ∈ 𝐵 𝜒 ↔ ∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝜒))
8	5, 6, 7	3bitr4g 317	1 ⊢ (𝜑 → (∃*𝑥 ∈ 𝐴 𝜓 ↔ ∃*𝑥 ∈ 𝐵 𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ∃*wmo 2565  ∃*wrmo 3368

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-mo 2567  df-cleq 2755  df-clel 2839  df-rmo 3369

This theorem is used by: (None)