Theorem nfwsuc 36757

Description: Bound-variable hypothesis builder for well-founded successor. (Contributed by Scott Fenton, 13-Jun-2018.) (Proof shortened by AV, 10-Oct-2021.)

Hypotheses

Ref	Expression
nfwsuc.1	⊢ Ⅎ𝑥𝑅
nfwsuc.2	⊢ Ⅎ𝑥𝐴
nfwsuc.3	⊢ Ⅎ𝑥𝑋

Assertion

Ref	Expression
nfwsuc	⊢ Ⅎ𝑥wsuc(𝑅, 𝐴, 𝑋)

Proof of Theorem nfwsuc

Step	Hyp	Ref	Expression
1		df-wsuc 36751	. 2 ⊢ wsuc(𝑅, 𝐴, 𝑋) = inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅)
2		nfwsuc.1	. . . . 5 ⊢ Ⅎ𝑥𝑅
3	2	nfcnv 5862	. . . 4 ⊢ Ⅎ𝑥◡𝑅
4		nfwsuc.2	. . . 4 ⊢ Ⅎ𝑥𝐴
5		nfwsuc.3	. . . 4 ⊢ Ⅎ𝑥𝑋
6	3, 4, 5	nfpred 6324	. . 3 ⊢ Ⅎ𝑥Pred(◡𝑅, 𝐴, 𝑋)
7	6, 4, 2	nfinf 9499	. 2 ⊢ Ⅎ𝑥inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅)
8	1, 7	nfcxfr 2924	1 ⊢ Ⅎ𝑥wsuc(𝑅, 𝐴, 𝑋)

This proof depends on syntax axioms:  Ⅎwnfc 2911  ^◡ccnv 5654  Predcpred 6318  infcinf 9457  wsuccwsuc 36749

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-xp 5661  df-cnv 5663  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-sup 9458  df-inf 9459  df-wsuc 36751

This theorem is used by: (None)