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

Theorem nfbidf 1432
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 1412 . . 3  |-  ( ph  ->  A. x ph )
3 nfbidf.2 . . . 4  |-  ( ph  ->  ( ps  <->  ch )
)
42, 3albidh 1369 . . . 4  |-  ( ph  ->  ( A. x ps  <->  A. x ch ) )
53, 4imbi12d 223 . . 3  |-  ( ph  ->  ( ( ps  ->  A. x ps )  <->  ( ch  ->  A. x ch )
) )
62, 5albidh 1369 . 2  |-  ( ph  ->  ( A. x ( ps  ->  A. x ps )  <->  A. x ( ch 
->  A. x ch )
) )
7 df-nf 1350 . 2  |-  ( F/ x ps  <->  A. x
( ps  ->  A. x ps ) )
8 df-nf 1350 . 2  |-  ( F/ x ch  <->  A. x
( ch  ->  A. x ch ) )
96, 7, 83bitr4g 212 1  |-  ( ph  ->  ( F/ x ps  <->  F/ x ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 98   A.wal 1241   F/wnf 1349
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-5 1336  ax-gen 1338  ax-4 1400
This theorem depends on definitions:  df-bi 110  df-nf 1350
This theorem is referenced by:  dvelimdf  1892  nfcjust  2166  nfceqdf  2177
  Copyright terms: Public domain W3C validator