Theorem r19.9rzv 4436

Description: Restricted quantification of wff not containing quantified variable. (Contributed by NM, 27-May-1998.)

Assertion

Ref	Expression
r19.9rzv	⊢ (𝐴 ≠ ∅ → (𝜑 ↔ ∃𝑥 ∈ 𝐴 𝜑))

Distinct variable groups:   𝑥,𝐴   𝜑,𝑥

Proof of Theorem r19.9rzv

Step	Hyp	Ref	Expression
1		dfrex2 3068	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ¬ ∀𝑥 ∈ 𝐴 ¬ 𝜑)
2		r19.3rzv 4434	. . 3 ⊢ (𝐴 ≠ ∅ → (¬ 𝜑 ↔ ∀𝑥 ∈ 𝐴 ¬ 𝜑))
3	2	con1bid 357	. 2 ⊢ (𝐴 ≠ ∅ → (¬ ∀𝑥 ∈ 𝐴 ¬ 𝜑 ↔ 𝜑))
4	1, 3	bitr2id 286	1 ⊢ (𝐴 ≠ ∅ → (𝜑 ↔ ∃𝑥 ∈ 𝐴 𝜑))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ≠ wne 2936  ∀wral 3055  ∃wrex 3065  ∅c0 4264

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-9 2131  ax-ext 2713

This theorem depends on definitions:  df-bi 209  df-an 398  df-tru 1551  df-fal 1561  df-ex 1788  df-sb 2075  df-clab 2720  df-cleq 2733  df-ne 2937  df-ral 3056  df-rex 3066  df-dif 3888  df-nul 4265

This theorem is referenced by:  r19.45zv  4439  r19.44zv  4440  r19.36zv  4443  iunconst  4934  lcmgcdlem  16570  pmtrprfvalrn  19458  dvdsr02  20347  voliune  34425  dya2iocuni  34479  filnetlem4  36624  prmunb2  44770