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

Theorem nffvd 5570
Description: Deduction version of bound-variable hypothesis builder nffv 5568. (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 2345 . . 3  |-  F/_ x { z  |  A. x  z  e.  F }
2 nfaba1 2345 . . 3  |-  F/_ x { z  |  A. x  z  e.  A }
31, 2nffv 5568 . 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 2342 . . . . 5  |-  F/ x F/_ x F
7 nfnfc1 2342 . . . . 5  |-  F/ x F/_ x A
86, 7nfan 1579 . . . 4  |-  F/ x
( F/_ x F  /\  F/_ x A )
9 abidnf 2932 . . . . . 6  |-  ( F/_ x F  ->  { z  |  A. x  z  e.  F }  =  F )
109adantr 276 . . . . 5  |-  ( (
F/_ x F  /\  F/_ x A )  ->  { z  |  A. x  z  e.  F }  =  F )
11 abidnf 2932 . . . . . 6  |-  ( F/_ x A  ->  { z  |  A. x  z  e.  A }  =  A )
1211adantl 277 . . . . 5  |-  ( (
F/_ x F  /\  F/_ x A )  ->  { z  |  A. x  z  e.  A }  =  A )
1310, 12fveq12d 5565 . . . 4  |-  ( (
F/_ x F  /\  F/_ x A )  -> 
( { z  | 
A. x  z  e.  F } `  {
z  |  A. x  z  e.  A }
)  =  ( F `
 A ) )
148, 13nfceqdf 2338 . . 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 411 . 2  |-  ( ph  ->  ( F/_ x ( { z  |  A. x  z  e.  F } `  { z  |  A. x  z  e.  A } )  <->  F/_ x ( F `  A ) ) )
163, 15mpbii 148 1  |-  ( ph  -> 
F/_ x ( F `
 A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1362    = wceq 1364    e. wcel 2167   {cab 2182   F/_wnfc 2326   ` cfv 5258
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-rex 2481  df-v 2765  df-un 3161  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-iota 5219  df-fv 5266
This theorem is referenced by:  nfovd  5951  nfixpxy  6776
  Copyright terms: Public domain W3C validator