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

Theorem nffvd 5875
Description: Deduction version of bound-variable hypothesis builder nffv 5873. (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 2634 . . 3  |-  F/_ x { z  |  A. x  z  e.  F }
2 nfaba1 2634 . . 3  |-  F/_ x { z  |  A. x  z  e.  A }
31, 2nffv 5873 . 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 2632 . . . . 5  |-  F/ x F/_ x F
7 nfnfc1 2632 . . . . 5  |-  F/ x F/_ x A
86, 7nfan 1875 . . . 4  |-  F/ x
( F/_ x F  /\  F/_ x A )
9 abidnf 3272 . . . . . 6  |-  ( F/_ x F  ->  { z  |  A. x  z  e.  F }  =  F )
109adantr 465 . . . . 5  |-  ( (
F/_ x F  /\  F/_ x A )  ->  { z  |  A. x  z  e.  F }  =  F )
11 abidnf 3272 . . . . . 6  |-  ( F/_ x A  ->  { z  |  A. x  z  e.  A }  =  A )
1211adantl 466 . . . . 5  |-  ( (
F/_ x F  /\  F/_ x A )  ->  { z  |  A. x  z  e.  A }  =  A )
1310, 12fveq12d 5872 . . . 4  |-  ( (
F/_ x F  /\  F/_ x A )  -> 
( { z  | 
A. x  z  e.  F } `  {
z  |  A. x  z  e.  A }
)  =  ( F `
 A ) )
148, 13nfceqdf 2624 . . 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 661 . 2  |-  ( ph  ->  ( F/_ x ( { z  |  A. x  z  e.  F } `  { z  |  A. x  z  e.  A } )  <->  F/_ x ( F `  A ) ) )
163, 15mpbii 211 1  |-  ( ph  -> 
F/_ x ( F `
 A ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369   A.wal 1377    = wceq 1379    e. wcel 1767   {cab 2452   F/_wnfc 2615   ` cfv 5588
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ral 2819  df-rex 2820  df-rab 2823  df-v 3115  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-if 3940  df-sn 4028  df-pr 4030  df-op 4034  df-uni 4246  df-br 4448  df-iota 5551  df-fv 5596
This theorem is referenced by:  nfovd  6307  nfixp  7489
  Copyright terms: Public domain W3C validator