Theorem nfrexd 3369

Description: Deduction version of nfrex 3371. Usage of this theorem is discouraged because it depends on ax-13 2410. See nfrexdw 3317 for a version with a disjoint variable condition, but not requiring ax-13 2410. (Contributed by Mario Carneiro, 14-Oct-2016.) (New usage is discouraged.)

Hypotheses

Ref	Expression
nfrald.1	⊢ Ⅎ𝑦𝜑
nfrald.2	⊢ (𝜑 → Ⅎ𝑥𝐴)
nfrald.3	⊢ (𝜑 → Ⅎ𝑥𝜓)

Assertion

Ref	Expression
nfrexd	⊢ (𝜑 → Ⅎ𝑥∃𝑦 ∈ 𝐴 𝜓)

Proof of Theorem nfrexd

Step	Hyp	Ref	Expression
1		dfrex2 3098	. 2 ⊢ (∃𝑦 ∈ 𝐴 𝜓 ↔ ¬ ∀𝑦 ∈ 𝐴 ¬ 𝜓)
2		nfrald.1	. . . 4 ⊢ Ⅎ𝑦𝜑
3		nfrald.2	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝐴)
4		nfrald.3	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝜓)
5	4	nfnd 1885	. . . 4 ⊢ (𝜑 → Ⅎ𝑥 ¬ 𝜓)
6	2, 3, 5	nfrald 3368	. . 3 ⊢ (𝜑 → Ⅎ𝑥∀𝑦 ∈ 𝐴 ¬ 𝜓)
7	6	nfnd 1885	. 2 ⊢ (𝜑 → Ⅎ𝑥 ¬ ∀𝑦 ∈ 𝐴 ¬ 𝜓)
8	1, 7	nfxfrd 1881	1 ⊢ (𝜑 → Ⅎ𝑥∃𝑦 ∈ 𝐴 𝜓)

Syntax hints:  ¬ wn 3   → wi 4  Ⅎwnf 1810  Ⅎwnfc 2916  ∀wral 3085  ∃wrex 3095

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-13 2410  ax-ext 2741

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1570  df-ex 1807  df-nf 1811  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ral 3086  df-rex 3096

This theorem is referenced by:  nfrex  3371  nfiundg  50375