ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nffr Unicode version

Theorem nffr 4489
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.
StepHypRef Expression
1 df-frind 4472 . 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 2392 . . . 4  |-  F/_ x
s
52, 3, 4nffrfor 4488 . . 3  |-  F/ xFrFor  R A s
65nfal 1629 . 2  |-  F/ x A. sFrFor  R A s
71, 6nfxfr 1527 1  |-  F/ x  R  Fr  A
Colors of variables: wff set class
Syntax hints:   A.wal 1400   F/wnf 1513   F/_wnfc 2379  FrFor wfrfor 4467    Fr wfr 4468
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-frfor 4471  df-frind 4472
This theorem is referenced by:  nfwe  4495
  Copyright terms: Public domain W3C validator