Theorem nfrexd 3381

Description: Deduction version of nfrex 3383. Usage of this theorem is discouraged because it depends on ax-13 2380. See nfrexdw 3316 for a version with a disjoint variable condition, but not requiring ax-13 2380. (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 3079	. 2 ⊢ (∃𝑦 ∈ 𝐴 𝜓 ↔ ¬ ∀𝑦 ∈ 𝐴 ¬ 𝜓)
2		nfrald.1	. . . 4 ⊢ Ⅎ𝑦𝜑
3		nfrald.2	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝐴)
4		nfrald.3	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝜓)
5	4	nfnd 1857	. . . 4 ⊢ (𝜑 → Ⅎ𝑥 ¬ 𝜓)
6	2, 3, 5	nfrald 3380	. . 3 ⊢ (𝜑 → Ⅎ𝑥∀𝑦 ∈ 𝐴 ¬ 𝜓)
7	6	nfnd 1857	. 2 ⊢ (𝜑 → Ⅎ𝑥 ¬ ∀𝑦 ∈ 𝐴 ¬ 𝜓)
8	1, 7	nfxfrd 1852	1 ⊢ (𝜑 → Ⅎ𝑥∃𝑦 ∈ 𝐴 𝜓)

Syntax hints:  ¬ wn 3   → wi 4  Ⅎwnf 1781  Ⅎwnfc 2893  ∀wral 3067  ∃wrex 3076

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-13 2380  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-ex 1778  df-nf 1782  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ral 3068  df-rex 3077

This theorem is referenced by:  nfrex  3383  nfiundg  48767