Theorem reueq1 3380

Description: Equality theorem for restricted unique existential quantifier. (Contributed by NM, 5-Apr-2004.) Remove usage of ax-10 2146, ax-11 2162, and ax-12 2182. (Revised by Steven Nguyen, 30-Apr-2023.) Avoid ax-8 2115. (Revised by Wolf Lammen, 12-Mar-2025.)

Assertion

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

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem reueq1

Step	Hyp	Ref	Expression
1		rexeq 3290	. . 3 ⊢ (𝐴 = 𝐵 → (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥 ∈ 𝐵 𝜑))
2		rmoeq1 3379	. . 3 ⊢ (𝐴 = 𝐵 → (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥 ∈ 𝐵 𝜑))
3	1, 2	anbi12d 632	. 2 ⊢ (𝐴 = 𝐵 → ((∃𝑥 ∈ 𝐴 𝜑 ∧ ∃*𝑥 ∈ 𝐴 𝜑) ↔ (∃𝑥 ∈ 𝐵 𝜑 ∧ ∃*𝑥 ∈ 𝐵 𝜑)))
4		reu5 3350	. 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃*𝑥 ∈ 𝐴 𝜑))
5		reu5 3350	. 2 ⊢ (∃!𝑥 ∈ 𝐵 𝜑 ↔ (∃𝑥 ∈ 𝐵 𝜑 ∧ ∃*𝑥 ∈ 𝐵 𝜑))
6	3, 4, 5	3bitr4g 314	1 ⊢ (𝐴 = 𝐵 → (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥 ∈ 𝐵 𝜑))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541  ∃wrex 3058  ∃!wreu 3346  ∃*wrmo 3347

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-9 2123  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1781  df-mo 2537  df-eu 2567  df-cleq 2726  df-rex 3059  df-rmo 3348  df-reu 3349

This theorem is referenced by:  reueqd  3384  reueqdv  3385  lubfval  18269  glbfval  18282  uspgredg2vlem  29245  uspgredg2v  29246  isfrgr  30284  frgr1v  30295  nfrgr2v  30296  frgr3v  30299  1vwmgr  30300  3vfriswmgr  30302  isplig  30500  hdmap14lem4a  42070  hdmap14lem15  42081