Theorem nfnfc1 2311

Description: 𝑥 is bound in Ⅎ𝑥𝐴. (Contributed by Mario Carneiro, 11-Aug-2016.)

Assertion

Ref	Expression
nfnfc1	⊢ Ⅎ𝑥Ⅎ𝑥𝐴

Proof of Theorem nfnfc1

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-nfc 2297	. 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴)
2		nfnf1 1532	. . 3 ⊢ Ⅎ𝑥Ⅎ𝑥 𝑦 ∈ 𝐴
3	2	nfal 1564	. 2 ⊢ Ⅎ𝑥∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴
4	1, 3	nfxfr 1462	1 ⊢ Ⅎ𝑥Ⅎ𝑥𝐴

Syntax hints:  ∀wal 1341  Ⅎwnf 1448   ∈ wcel 2136  Ⅎwnfc 2295

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ial 1522

This theorem depends on definitions:  df-bi 116  df-nf 1449  df-nfc 2297

This theorem is referenced by:  vtoclgft  2776  sbcralt  3027  sbcrext  3028  csbiebt  3084  nfopd  3775  nfimad  4955  nffvd  5498