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

Theorem nffrfor 4383
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
nffrfor.r  |-  F/_ x R
nffrfor.a  |-  F/_ x A
nffrfor.s  |-  F/_ x S
Assertion
Ref Expression
nffrfor  |-  F/ xFrFor  R A S

Proof of Theorem nffrfor
Dummy variables  u  v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-frfor 4366 . 2  |-  (FrFor  R A S  <->  ( A. u  e.  A  ( A. v  e.  A  (
v R u  -> 
v  e.  S )  ->  u  e.  S
)  ->  A  C_  S
) )
2 nffrfor.a . . . 4  |-  F/_ x A
3 nfcv 2339 . . . . . . . 8  |-  F/_ x
v
4 nffrfor.r . . . . . . . 8  |-  F/_ x R
5 nfcv 2339 . . . . . . . 8  |-  F/_ x u
63, 4, 5nfbr 4079 . . . . . . 7  |-  F/ x  v R u
7 nffrfor.s . . . . . . . 8  |-  F/_ x S
87nfcri 2333 . . . . . . 7  |-  F/ x  v  e.  S
96, 8nfim 1586 . . . . . 6  |-  F/ x
( v R u  ->  v  e.  S
)
102, 9nfralxy 2535 . . . . 5  |-  F/ x A. v  e.  A  ( v R u  ->  v  e.  S
)
117nfcri 2333 . . . . 5  |-  F/ x  u  e.  S
1210, 11nfim 1586 . . . 4  |-  F/ x
( A. v  e.  A  ( v R u  ->  v  e.  S )  ->  u  e.  S )
132, 12nfralxy 2535 . . 3  |-  F/ x A. u  e.  A  ( A. v  e.  A  ( v R u  ->  v  e.  S
)  ->  u  e.  S )
142, 7nfss 3176 . . 3  |-  F/ x  A  C_  S
1513, 14nfim 1586 . 2  |-  F/ x
( A. u  e.  A  ( A. v  e.  A  ( v R u  ->  v  e.  S )  ->  u  e.  S )  ->  A  C_  S )
161, 15nfxfr 1488 1  |-  F/ xFrFor  R A S
Colors of variables: wff set class
Syntax hints:    -> wi 4   F/wnf 1474    e. wcel 2167   F/_wnfc 2326   A.wral 2475    C_ wss 3157   class class class wbr 4033  FrFor wfrfor 4362
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-sn 3628  df-pr 3629  df-op 3631  df-br 4034  df-frfor 4366
This theorem is referenced by:  nffr  4384
  Copyright terms: Public domain W3C validator