Theorem spcimegf 3522

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 1890	. . . 4 ⊢ Ⅎ𝑥 ¬ 𝜓
4		spcimegf.3	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝜓 → 𝜑))
5	4	con3d 153	. . . 4 ⊢ (𝑥 = 𝐴 → (¬ 𝜑 → ¬ 𝜓))
6	1, 3, 5	spcimgf 3521	. . 3 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥 ¬ 𝜑 → ¬ 𝜓))
7	6	con2d 135	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝜓 → ¬ ∀𝑥 ¬ 𝜑))
8		df-ex 1813	. 2 ⊢ (∃𝑥𝜑 ↔ ¬ ∀𝑥 ¬ 𝜑)
9	7, 8	imbitrrdi 255	1 ⊢ (𝐴 ∈ 𝑉 → (𝜓 → ∃𝑥𝜑))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4  ∀wal 1568   = wceq 1570  ∃wex 1812  Ⅎwnf 1816   ∈ wcel 2146  Ⅎwnfc 2913

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817  df-cleq 2758  df-clel 2841  df-nfc 2915

This theorem is used by: (None)