Theorem nfrexg 3238

Description: Bound-variable hypothesis builder for restricted quantification. Usage of this theorem is discouraged because it depends on ax-13 2372. See nfrex 3237 for a version with a disjoint variable condition, but not requiring ax-13 2372. (Contributed by NM, 1-Sep-1999.) (Revised by Mario Carneiro, 7-Oct-2016.) (Proof shortened by Wolf Lammen, 30-Dec-2019.) (New usage is discouraged.)

Hypotheses

Ref	Expression
nfrexg.1	⊢ Ⅎ𝑥𝐴
nfrexg.2	⊢ Ⅎ𝑥𝜑

Assertion

Ref	Expression
nfrexg	⊢ Ⅎ𝑥∃𝑦 ∈ 𝐴 𝜑

Proof of Theorem nfrexg

Step	Hyp	Ref	Expression
1		nftru 1808	. . 3 ⊢ Ⅎ𝑦⊤
2		nfrexg.1	. . . 4 ⊢ Ⅎ𝑥𝐴
3	2	a1i 11	. . 3 ⊢ (⊤ → Ⅎ𝑥𝐴)
4		nfrexg.2	. . . 4 ⊢ Ⅎ𝑥𝜑
5	4	a1i 11	. . 3 ⊢ (⊤ → Ⅎ𝑥𝜑)
6	1, 3, 5	nfrexdg 3236	. 2 ⊢ (⊤ → Ⅎ𝑥∃𝑦 ∈ 𝐴 𝜑)
7	6	mptru 1546	1 ⊢ Ⅎ𝑥∃𝑦 ∈ 𝐴 𝜑

Syntax hints:  ⊤wtru 1540  Ⅎwnf 1787  Ⅎwnfc 2886  ∃wrex 3064

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-13 2372  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-tru 1542  df-ex 1784  df-nf 1788  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069

This theorem is referenced by:  nfiung  4953