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

Theorem nffvd 5207
Description: Deduction version of bound-variable hypothesis builder nffv 5205. (Contributed by NM, 10-Nov-2005.) (Revised by Mario Carneiro, 15-Oct-2016.)
Hypotheses
Ref Expression
nffvd.2  |-  ( ph  -> 
F/_ x F )
nffvd.3  |-  ( ph  -> 
F/_ x A )
Assertion
Ref Expression
nffvd  |-  ( ph  -> 
F/_ x ( F `
 A ) )

Proof of Theorem nffvd
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 nfaba1 2224 . . 3  |-  F/_ x { z  |  A. x  z  e.  F }
2 nfaba1 2224 . . 3  |-  F/_ x { z  |  A. x  z  e.  A }
31, 2nffv 5205 . 2  |-  F/_ x
( { z  | 
A. x  z  e.  F } `  {
z  |  A. x  z  e.  A }
)
4 nffvd.2 . . 3  |-  ( ph  -> 
F/_ x F )
5 nffvd.3 . . 3  |-  ( ph  -> 
F/_ x A )
6 nfnfc1 2222 . . . . 5  |-  F/ x F/_ x F
7 nfnfc1 2222 . . . . 5  |-  F/ x F/_ x A
86, 7nfan 1497 . . . 4  |-  F/ x
( F/_ x F  /\  F/_ x A )
9 abidnf 2760 . . . . . 6  |-  ( F/_ x F  ->  { z  |  A. x  z  e.  F }  =  F )
109adantr 270 . . . . 5  |-  ( (
F/_ x F  /\  F/_ x A )  ->  { z  |  A. x  z  e.  F }  =  F )
11 abidnf 2760 . . . . . 6  |-  ( F/_ x A  ->  { z  |  A. x  z  e.  A }  =  A )
1211adantl 271 . . . . 5  |-  ( (
F/_ x F  /\  F/_ x A )  ->  { z  |  A. x  z  e.  A }  =  A )
1310, 12fveq12d 5204 . . . 4  |-  ( (
F/_ x F  /\  F/_ x A )  -> 
( { z  | 
A. x  z  e.  F } `  {
z  |  A. x  z  e.  A }
)  =  ( F `
 A ) )
148, 13nfceqdf 2218 . . 3  |-  ( (
F/_ x F  /\  F/_ x A )  -> 
( F/_ x ( { z  |  A. x  z  e.  F } `  { z  |  A. x  z  e.  A } )  <->  F/_ x ( F `  A ) ) )
154, 5, 14syl2anc 403 . 2  |-  ( ph  ->  ( F/_ x ( { z  |  A. x  z  e.  F } `  { z  |  A. x  z  e.  A } )  <->  F/_ x ( F `  A ) ) )
163, 15mpbii 146 1  |-  ( ph  -> 
F/_ x ( F `
 A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103   A.wal 1282    = wceq 1284    e. wcel 1433   {cab 2067   F/_wnfc 2206   ` cfv 4922
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-rex 2354  df-v 2603  df-un 2977  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-iota 4887  df-fv 4930
This theorem is referenced by:  nfovd  5554
  Copyright terms: Public domain W3C validator