Theorem nffr 4086

Description: Bound-variable hypothesis builder for well-founded relations. (Contributed by Stefan O'Rear, 20-Jan-2015.) (Revised by Mario Carneiro, 14-Oct-2016.)

Hypotheses

Ref	Expression
nffr.r	|- F/_ x R
nffr.a	|- F/_ x A

Assertion

Ref	Expression
nffr	|- F/ x R Fr A

Proof of Theorem nffr

Dummy variable s is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-frind 4069	. 2 |- ( R Fr A <-> A. sFrFor R A s )
2		nffr.r	. . . 4 |- F/_ x R
3		nffr.a	. . . 4 |- F/_ x A
4		nfcv 2178	. . . 4 |- F/_ x s
5	2, 3, 4	nffrfor 4085	. . 3 |- F/ xFrFor R A s
6	5	nfal 1468	. 2 |- F/ x A. sFrFor R A s
7	1, 6	nfxfr 1363	1 |- F/ x R Fr A

Syntax hints:   A.wal 1241   F/wnf 1349   F/_wnfc 2165  FrFor wfrfor 4064   Fr wfr 4065

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022

This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-v 2559  df-un 2922  df-in 2924  df-ss 2931  df-sn 3381  df-pr 3382  df-op 3384  df-br 3765  df-frfor 4068  df-frind 4069

This theorem is referenced by:  nfwe  4092