MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nffvd Structured version   Unicode version

Theorem nffvd 5881
Description: Deduction version of bound-variable hypothesis builder nffv 5879. (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 2587 . . 3  |-  F/_ x { z  |  A. x  z  e.  F }
2 nfaba1 2587 . . 3  |-  F/_ x { z  |  A. x  z  e.  A }
31, 2nffv 5879 . 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 2585 . . . . 5  |-  F/ x F/_ x F
7 nfnfc1 2585 . . . . 5  |-  F/ x F/_ x A
86, 7nfan 1983 . . . 4  |-  F/ x
( F/_ x F  /\  F/_ x A )
9 abidnf 3237 . . . . . 6  |-  ( F/_ x F  ->  { z  |  A. x  z  e.  F }  =  F )
109adantr 466 . . . . 5  |-  ( (
F/_ x F  /\  F/_ x A )  ->  { z  |  A. x  z  e.  F }  =  F )
11 abidnf 3237 . . . . . 6  |-  ( F/_ x A  ->  { z  |  A. x  z  e.  A }  =  A )
1211adantl 467 . . . . 5  |-  ( (
F/_ x F  /\  F/_ x A )  ->  { z  |  A. x  z  e.  A }  =  A )
1310, 12fveq12d 5878 . . . 4  |-  ( (
F/_ x F  /\  F/_ x A )  -> 
( { z  | 
A. x  z  e.  F } `  {
z  |  A. x  z  e.  A }
)  =  ( F `
 A ) )
148, 13nfceqdf 2577 . . 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 665 . 2  |-  ( ph  ->  ( F/_ x ( { z  |  A. x  z  e.  F } `  { z  |  A. x  z  e.  A } )  <->  F/_ x ( F `  A ) ) )
163, 15mpbii 214 1  |-  ( ph  -> 
F/_ x ( F `
 A ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 187    /\ wa 370   A.wal 1435    = wceq 1437    e. wcel 1867   {cab 2405   F/_wnfc 2568   ` cfv 5592
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1665  ax-4 1678  ax-5 1748  ax-6 1794  ax-7 1838  ax-10 1886  ax-11 1891  ax-12 1904  ax-13 2052  ax-ext 2398
This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-3an 984  df-tru 1440  df-ex 1660  df-nf 1664  df-sb 1787  df-clab 2406  df-cleq 2412  df-clel 2415  df-nfc 2570  df-ral 2778  df-rex 2779  df-rab 2782  df-v 3080  df-dif 3436  df-un 3438  df-in 3440  df-ss 3447  df-nul 3759  df-if 3907  df-sn 3994  df-pr 3996  df-op 4000  df-uni 4214  df-br 4418  df-iota 5556  df-fv 5600
This theorem is referenced by:  nfovd  6321  nfixp  7540
  Copyright terms: Public domain W3C validator