Theorem r19.9rzv 4460

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 3089	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ¬ ∀𝑥 ∈ 𝐴 ¬ 𝜑)
2		r19.3rzv 4458	. . 3 ⊢ (𝐴 ≠ ∅ → (¬ 𝜑 ↔ ∀𝑥 ∈ 𝐴 ¬ 𝜑))
3	2	con1bid 358	. 2 ⊢ (𝐴 ≠ ∅ → (¬ ∀𝑥 ∈ 𝐴 ¬ 𝜑 ↔ 𝜑))
4	1, 3	bitr2id 287	1 ⊢ (𝐴 ≠ ∅ → (𝜑 ↔ ∃𝑥 ∈ 𝐴 𝜑))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ≠ wne 2955  ∀wral 3076  ∃wrex 3086  ∅c0 4278

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-ne 2956  df-ral 3077  df-rex 3087  df-dif 4047  df-nul 4279

This theorem is used by:  r19.45zv  4463  r19.44zv  4464  r19.36zv  4467  iunconst  4960  lcmgcdlem  16781  pmtrprfvalrn  19702  dvdsr02  20602  voliune  34862  dya2iocuni  34915  filnetlem4  37169  prmunb2  45295