Theorem nfsuc 6441

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 6375	. 2 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴})
2		nfsuc.1	. . 3 ⊢ Ⅎ𝑥𝐴
3	2	nfsn 4712	. . 3 ⊢ Ⅎ𝑥{𝐴}
4	2, 3	nfun 4164	. 2 ⊢ Ⅎ𝑥(𝐴 ∪ {𝐴})
5	1, 4	nfcxfr 2897	1 ⊢ Ⅎ𝑥 suc 𝐴

Syntax hints:  Ⅎwnfc 2879   ∪ cun 3945  {csn 4629  suc csuc 6371

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-tru 1537  df-ex 1775  df-nf 1779  df-sb 2061  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-v 3473  df-un 3952  df-sn 4630  df-pr 4632  df-suc 6375

This theorem is referenced by:  ttrcltr  9740  rankidb  9824  dfon2lem3  35381

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »