Theorem nfnfc1 2928

Description: The setvar 𝑥 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 2912	. 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴)
2		nfnf1 2193	. . 3 ⊢ Ⅎ𝑥Ⅎ𝑥 𝑦 ∈ 𝐴
3	2	nfal 2356	. 2 ⊢ Ⅎ𝑥∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴
4	1, 3	nfxfr 1885	1 ⊢ Ⅎ𝑥Ⅎ𝑥𝐴

This proof depends on syntax axioms:  ∀wal 1567  Ⅎwnf 1815   ∈ wcel 2146  Ⅎwnfc 2910

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 1944  ax-6 2001  ax-7 2042  ax-10 2179  ax-11 2196  ax-12 2215

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1812  df-nf 1816  df-nfc 2912

This theorem is used by:  cbvexeqsetf  3468  sbcralt  3822  sbcrext  3823  csbiebt  3879  nfopd  4852  nfimad  6070  nffvd  6905  wl-issetft  38654  nfded  40164  nfded2  40165  nfunidALT2  40166