Theorem spcegf 3577

Description: Existential specialization, using implicit substitution. (Contributed by NM, 2-Feb-1997.)

Hypotheses

Ref	Expression
spcgf.1	⊢ Ⅎ𝑥𝐴
spcgf.2	⊢ Ⅎ𝑥𝜓
spcgf.3	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
spcegf	⊢ (𝐴 ∈ 𝑉 → (𝜓 → ∃𝑥𝜑))

Proof of Theorem spcegf

Step	Hyp	Ref	Expression
1		spcgf.1	. . . 4 ⊢ Ⅎ𝑥𝐴
2		spcgf.2	. . . . 5 ⊢ Ⅎ𝑥𝜓
3	2	nfn 1853	. . . 4 ⊢ Ⅎ𝑥 ¬ 𝜓
4		spcgf.3	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
5	4	notbid 318	. . . 4 ⊢ (𝑥 = 𝐴 → (¬ 𝜑 ↔ ¬ 𝜓))
6	1, 3, 5	spcgf 3576	. . 3 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥 ¬ 𝜑 → ¬ 𝜓))
7	6	con2d 134	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝜓 → ¬ ∀𝑥 ¬ 𝜑))
8		df-ex 1775	. 2 ⊢ (∃𝑥𝜑 ↔ ¬ ∀𝑥 ¬ 𝜑)
9	7, 8	imbitrrdi 251	1 ⊢ (𝐴 ∈ 𝑉 → (𝜓 → ∃𝑥𝜑))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205  ∀wal 1532   = wceq 1534  ∃wex 1774  Ⅎwnf 1778   ∈ wcel 2099  Ⅎwnfc 2878

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2164  ax-ext 2698

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-tru 1537  df-ex 1775  df-nf 1779  df-sb 2061  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-v 3471

This theorem is referenced by:  rspce  3596  euotd  5509  bnj607  34537  bnj1491  34678  rspcegf  44357  stoweidlem36  45396  stoweidlem46  45406  ichnreuop  46784  ichreuopeq  46785