Theorem reueqbidv 3405

Description: Formula-building rule for restricted existential uniqueness quantifier. Deduction form. General version of reubidv 3385. (Contributed by GG, 1-Sep-2025.)

Hypotheses

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

Assertion

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

Distinct variable group:   𝜑,𝑥

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

Proof of Theorem reueqbidv

Step	Hyp	Ref	Expression
1		reueqbidv.1	. . . . 5 ⊢ (𝜑 → 𝐴 = 𝐵)
2	1	eleq2d 2850	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
3		reueqbidv.2	. . . 4 ⊢ (𝜑 → (𝜓 ↔ 𝜒))
4	2, 3	anbi12d 644	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐵 ∧ 𝜒)))
5	4	eubidv 2614	. 2 ⊢ (𝜑 → (∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜓) ↔ ∃!𝑥(𝑥 ∈ 𝐵 ∧ 𝜒)))
6		df-reu 3370	. 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜓 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
7		df-reu 3370	. 2 ⊢ (∃!𝑥 ∈ 𝐵 𝜒 ↔ ∃!𝑥(𝑥 ∈ 𝐵 ∧ 𝜒))
8	5, 6, 7	3bitr4g 317	1 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐴 𝜓 ↔ ∃!𝑥 ∈ 𝐵 𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃!weu 2596  ∃!wreu 3367

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-mo 2567  df-eu 2597  df-cleq 2755  df-clel 2839  df-reu 3370

This theorem is used by:  upciclem1  50613  upfval  50623  isuplem  50626  upeu3  50642  oppcup3lem  50653  oppcup  50654