Theorem nfsuc 6397

Description: Bound-variable hypothesis builder for successor. (Contributed by NM, 15-Sep-2003.)

Hypothesis

Ref	Expression
nfsuc.1	⊢ Ⅎ𝑥𝐴

Assertion

Ref	Expression
nfsuc	⊢ Ⅎ𝑥 suc 𝐴

Proof of Theorem nfsuc

Step	Hyp	Ref	Expression
1		df-suc 6329	. 2 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴})
2		nfsuc.1	. . 3 ⊢ Ⅎ𝑥𝐴
3	2	nfsn 4651	. . 3 ⊢ Ⅎ𝑥{𝐴}
4	2, 3	nfun 4110	. 2 ⊢ Ⅎ𝑥(𝐴 ∪ {𝐴})
5	1, 4	nfcxfr 2896	1 ⊢ Ⅎ𝑥 suc 𝐴

Syntax hints:  Ⅎwnfc 2883   ∪ cun 3887  {csn 4567  suc csuc 6325

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-v 3431  df-un 3894  df-sn 4568  df-pr 4570  df-suc 6329

This theorem is referenced by:  ttrcltr  9637  rankidb  9724  dfon2lem3  35965