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

Theorem nfbidf 1519
Description: An equality theorem for effectively not free. (Contributed by Mario Carneiro, 4-Oct-2016.)
Hypotheses
Ref Expression
nfbidf.1  |-  F/ x ph
nfbidf.2  |-  ( ph  ->  ( ps  <->  ch )
)
Assertion
Ref Expression
nfbidf  |-  ( ph  ->  ( F/ x ps  <->  F/ x ch ) )

Proof of Theorem nfbidf
StepHypRef Expression
1 nfbidf.1 . . . 4  |-  F/ x ph
21nfri 1499 . . 3  |-  ( ph  ->  A. x ph )
3 nfbidf.2 . . . 4  |-  ( ph  ->  ( ps  <->  ch )
)
42, 3albidh 1456 . . . 4  |-  ( ph  ->  ( A. x ps  <->  A. x ch ) )
53, 4imbi12d 233 . . 3  |-  ( ph  ->  ( ( ps  ->  A. x ps )  <->  ( ch  ->  A. x ch )
) )
62, 5albidh 1456 . 2  |-  ( ph  ->  ( A. x ( ps  ->  A. x ps )  <->  A. x ( ch 
->  A. x ch )
) )
7 df-nf 1437 . 2  |-  ( F/ x ps  <->  A. x
( ps  ->  A. x ps ) )
8 df-nf 1437 . 2  |-  ( F/ x ch  <->  A. x
( ch  ->  A. x ch ) )
96, 7, 83bitr4g 222 1  |-  ( ph  ->  ( F/ x ps  <->  F/ x ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104   A.wal 1329   F/wnf 1436
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1423  ax-gen 1425  ax-4 1487
This theorem depends on definitions:  df-bi 116  df-nf 1437
This theorem is referenced by:  dvelimdf  1991  nfcjust  2269  nfceqdf  2280
  Copyright terms: Public domain W3C validator