Theorem r19.9rzv 4461

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

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ≠ wne 2959  ∀wral 3078  ∃wrex 3088  ∅c0 4287

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-9 2154  ax-ext 2736

This theorem depends on definitions:  df-bi 209  df-an 400  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-ne 2960  df-ral 3079  df-rex 3089  df-dif 3909  df-nul 4288

This theorem is referenced by:  r19.45zv  4464  r19.44zv  4465  r19.36zv  4468  iunconst  4961  lcmgcdlem  16642  pmtrprfvalrn  19530  dvdsr02  20423  voliune  34528  dya2iocuni  34582  filnetlem4  36746  prmunb2  44892