Theorem reueqbidva 49388

Description: Formula-building rule for restricted existential uniqueness quantifier. Deduction form. General version of reueqbidv 3402. (Contributed by Zhi Wang, 20-Nov-2025.)

Hypotheses

Ref	Expression
reueqbidva.1	⊢ (𝜑 → 𝐴 = 𝐵)
reueqbidva.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
reueqbidva	⊢ (𝜑 → (∃!𝑥 ∈ 𝐴 𝜓 ↔ ∃!𝑥 ∈ 𝐵 𝜒))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜑,𝑥

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

Proof of Theorem reueqbidva

Step	Hyp	Ref	Expression
1		reueqbidva.2	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝜒))
2	1	reubidva 3380	. 2 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐴 𝜓 ↔ ∃!𝑥 ∈ 𝐴 𝜒))
3		reueqbidva.1	. . 3 ⊢ (𝜑 → 𝐴 = 𝐵)
4	3	reueqdv 3401	. 2 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐴 𝜒 ↔ ∃!𝑥 ∈ 𝐵 𝜒))
5	2, 4	bitrd 281	1 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐴 𝜓 ↔ ∃!𝑥 ∈ 𝐵 𝜒))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1559   ∈ wcel 2141  ∃!wreu 3364

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-9 2151  ax-ext 2733

This theorem depends on definitions:  df-bi 209  df-an 400  df-ex 1799  df-mo 2565  df-eu 2595  df-cleq 2753  df-rex 3086  df-rmo 3366  df-reu 3367

This theorem is referenced by:  uppropd  49763