Theorem spcimegf 3514

Description: Existential specialization, using implicit substitution. (Contributed by Mario Carneiro, 4-Jan-2017.)

Hypotheses

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

Assertion

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

Proof of Theorem spcimegf

Step	Hyp	Ref	Expression
1		spcimgf.1	. . . 4 ⊢ Ⅎ𝑥𝐴
2		spcimgf.2	. . . . 5 ⊢ Ⅎ𝑥𝜓
3	2	nfn 1889	. . . 4 ⊢ Ⅎ𝑥 ¬ 𝜓
4		spcimegf.3	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝜓 → 𝜑))
5	4	con3d 153	. . . 4 ⊢ (𝑥 = 𝐴 → (¬ 𝜑 → ¬ 𝜓))
6	1, 3, 5	spcimgf 3513	. . 3 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥 ¬ 𝜑 → ¬ 𝜓))
7	6	con2d 135	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝜓 → ¬ ∀𝑥 ¬ 𝜑))
8		df-ex 1812	. 2 ⊢ (∃𝑥𝜑 ↔ ¬ ∀𝑥 ¬ 𝜑)
9	7, 8	imbitrrdi 255	1 ⊢ (𝐴 ∈ 𝑉 → (𝜓 → ∃𝑥𝜑))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4  ∀wal 1567   = wceq 1569  ∃wex 1811  Ⅎwnf 1815   ∈ wcel 2144  Ⅎwnfc 2907

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-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1812  df-nf 1816  df-cleq 2752  df-clel 2835  df-nfc 2909

This theorem is used by: (None)