Theorem nfrald 3357

Description: Deduction version of nfral 3359. Usage of this theorem is discouraged because it depends on ax-13 2401. Use the weaker nfraldw 3307 when possible. (Contributed by NM, 15-Feb-2013.) (Revised by Mario Carneiro, 7-Oct-2016.) (New usage is discouraged.)

Hypotheses

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

Assertion

Ref	Expression
nfrald	⊢ (𝜑 → Ⅎ𝑥∀𝑦 ∈ 𝐴 𝜓)

Proof of Theorem nfrald

Step	Hyp	Ref	Expression
1		df-ral 3077	. 2 ⊢ (∀𝑦 ∈ 𝐴 𝜓 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝜓))
2		nfrald.1	. . 3 ⊢ Ⅎ𝑦𝜑
3		nfcvf 2948	. . . . . 6 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝑦)
4	3	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥𝑦)
5		nfrald.2	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑥𝐴)
6	5	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥𝐴)
7	4, 6	nfeld 2933	. . . 4 ⊢ ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥 𝑦 ∈ 𝐴)
8		nfrald.3	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝜓)
9	8	adantr 486	. . . 4 ⊢ ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥𝜓)
10	7, 9	nfimd 1926	. . 3 ⊢ ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥(𝑦 ∈ 𝐴 → 𝜓))
11	2, 10	nfald2 2474	. 2 ⊢ (𝜑 → Ⅎ𝑥∀𝑦(𝑦 ∈ 𝐴 → 𝜓))
12	1, 11	nfxfrd 1886	1 ⊢ (𝜑 → Ⅎ𝑥∀𝑦 ∈ 𝐴 𝜓)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401  ∀wal 1567  Ⅎwnf 1815   ∈ wcel 2144  Ⅎwnfc 2907  ∀wral 3076

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-13 2401  ax-ext 2732

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

This theorem is used by:  nfrexd  3358  nfral  3359