Theorem reueq1 3344

Description: Equality theorem for restricted unique existential quantifier. (Contributed by NM, 5-Apr-2004.) Remove usage of ax-10 2137, ax-11 2154, and ax-12 2171. (Revised by Steven Nguyen, 30-Apr-2023.)

Assertion

Ref	Expression
reueq1	⊢ (𝐴 = 𝐵 → (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥 ∈ 𝐵 𝜑))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem reueq1

Step	Hyp	Ref	Expression
1		eleq2 2827	. . . 4 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
2	1	anbi1d 630	. . 3 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐵 ∧ 𝜑)))
3	2	eubidv 2586	. 2 ⊢ (𝐴 = 𝐵 → (∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃!𝑥(𝑥 ∈ 𝐵 ∧ 𝜑)))
4		df-reu 3072	. 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
5		df-reu 3072	. 2 ⊢ (∃!𝑥 ∈ 𝐵 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))
6	3, 4, 5	3bitr4g 314	1 ⊢ (𝐴 = 𝐵 → (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥 ∈ 𝐵 𝜑))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2106  ∃!weu 2568  ∃!wreu 3066

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1783  df-mo 2540  df-eu 2569  df-cleq 2730  df-clel 2816  df-reu 3072

This theorem is referenced by:  reueqd  3350  lubfval  18068  glbfval  18081  uspgredg2vlem  27590  uspgredg2v  27591  isfrgr  28624  frgr1v  28635  nfrgr2v  28636  frgr3v  28639  1vwmgr  28640  3vfriswmgr  28642  isplig  28838  hdmap14lem4a  39885  hdmap14lem15  39896