Theorem rexsng 4633

Description: Restricted existential quantification over a singleton. (Contributed by NM, 29-Jan-2012.) Avoid ax-10 2146, ax-12 2184. (Revised by GG, 30-Sep-2024.)

Hypothesis

Ref	Expression
ralsng.1	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
rexsng	⊢ (𝐴 ∈ 𝑉 → (∃𝑥 ∈ {𝐴}𝜑 ↔ 𝜓))

Distinct variable groups:   𝑥,𝐴   𝜓,𝑥

Allowed substitution hints:   𝜑(𝑥)   𝑉(𝑥)

Proof of Theorem rexsng

Step	Hyp	Ref	Expression
1		ralsng.1	. . . 4 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
2	1	notbid 318	. . 3 ⊢ (𝑥 = 𝐴 → (¬ 𝜑 ↔ ¬ 𝜓))
3	2	ralsng 4632	. 2 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥 ∈ {𝐴} ¬ 𝜑 ↔ ¬ 𝜓))
4		dfrex2 3063	. . 3 ⊢ (∃𝑥 ∈ {𝐴}𝜑 ↔ ¬ ∀𝑥 ∈ {𝐴} ¬ 𝜑)
5		bicom1 221	. . . 4 ⊢ ((∀𝑥 ∈ {𝐴} ¬ 𝜑 ↔ ¬ 𝜓) → (¬ 𝜓 ↔ ∀𝑥 ∈ {𝐴} ¬ 𝜑))
6	5	con1bid 355	. . 3 ⊢ ((∀𝑥 ∈ {𝐴} ¬ 𝜑 ↔ ¬ 𝜓) → (¬ ∀𝑥 ∈ {𝐴} ¬ 𝜑 ↔ 𝜓))
7	4, 6	bitrid 283	. 2 ⊢ ((∀𝑥 ∈ {𝐴} ¬ 𝜑 ↔ ¬ 𝜓) → (∃𝑥 ∈ {𝐴}𝜑 ↔ 𝜓))
8	3, 7	syl 17	1 ⊢ (𝐴 ∈ 𝑉 → (∃𝑥 ∈ {𝐴}𝜑 ↔ 𝜓))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   = wceq 1541   ∈ wcel 2113  ∀wral 3051  ∃wrex 3060  {csn 4580

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-8 2115  ax-9 2123  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3061  df-v 3442  df-sn 4581

This theorem is referenced by:  rexsn  4639  rextpg  4656  iunxsng  5045  frirr  5600  frsn  5712  imasng  6043  naddunif  8621  scshwfzeqfzo  14749  dvdsprmpweqnn  16813  mnd1  18704  grp1  18977  pzriprnglem3  21438  pzriprnglem10  21445  psdmul  22109  cutmax  27930  cutmin  27931  halfcut  28454  elntg2  29058  1loopgrvd0  29578  1egrvtxdg0  29585  nfrgr2v  30347  1vwmgr  30351  elgrplsmsn  33471  grplsmid  33485  ballotlemfc0  34650  ballotlemfcc  34651  bj-restsn  37287  elrnressn  38473  elpaddat  40064  elpadd2at  40066  brfvidRP  43929  mnuunid  44518  iccelpart  47679  zlidlring  48480  lco0  48673