Metamath Proof Explorer


Theorem nfwsuc

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

Ref Expression
Hypotheses nfwsuc.1 ⊢ Ⅎ _ x R
nfwsuc.2 ⊢ Ⅎ _ x A
nfwsuc.3 ⊢ Ⅎ _ x X
Assertion nfwsuc ⊢ Ⅎ _ x wsuc R A X

Proof

Step Hyp Ref Expression
1 nfwsuc.1 ⊢ Ⅎ _ x R
2 nfwsuc.2 ⊢ Ⅎ _ x A
3 nfwsuc.3 ⊢ Ⅎ _ x X
4 df-wsuc ⊢ wsuc R A X = inf Pred R -1 A X A R
5 1 nfcnv ⊢ Ⅎ _ x R -1
6 5 2 3 nfpred ⊢ Ⅎ _ x Pred R -1 A X
7 6 2 1 nfinf ⊢ Ⅎ _ x inf Pred R -1 A X A R
8 4 7 nfcxfr ⊢ Ⅎ _ x wsuc R A X