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

Theorem nffvd 5679
Description: Deduction version of bound-variable hypothesis builder nffv 5677. (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 2530 . . 3  |-  F/_ x { z  |  A. x  z  e.  F }
2 nfaba1 2530 . . 3  |-  F/_ x { z  |  A. x  z  e.  A }
31, 2nffv 5677 . 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 2528 . . . . 5  |-  F/ x F/_ x F
7 nfnfc1 2528 . . . . 5  |-  F/ x F/_ x A
86, 7nfan 1836 . . . 4  |-  F/ x
( F/_ x F  /\  F/_ x A )
9 abidnf 3048 . . . . . 6  |-  ( F/_ x F  ->  { z  |  A. x  z  e.  F }  =  F )
109adantr 452 . . . . 5  |-  ( (
F/_ x F  /\  F/_ x A )  ->  { z  |  A. x  z  e.  F }  =  F )
11 abidnf 3048 . . . . . 6  |-  ( F/_ x A  ->  { z  |  A. x  z  e.  A }  =  A )
1211adantl 453 . . . . 5  |-  ( (
F/_ x F  /\  F/_ x A )  ->  { z  |  A. x  z  e.  A }  =  A )
1310, 12fveq12d 5676 . . . 4  |-  ( (
F/_ x F  /\  F/_ x A )  -> 
( { z  | 
A. x  z  e.  F } `  {
z  |  A. x  z  e.  A }
)  =  ( F `
 A ) )
148, 13nfceqdf 2524 . . 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 643 . 2  |-  ( ph  ->  ( F/_ x ( { z  |  A. x  z  e.  F } `  { z  |  A. x  z  e.  A } )  <->  F/_ x ( F `  A ) ) )
163, 15mpbii 203 1  |-  ( ph  -> 
F/_ x ( F `
 A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    /\ wa 359   A.wal 1546    = wceq 1649    e. wcel 1717   {cab 2375   F/_wnfc 2512   ` cfv 5396
This theorem is referenced by:  nfovd  6044  nfriotad  6496  nfixp  7019
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2370
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2376  df-cleq 2382  df-clel 2385  df-nfc 2514  df-ral 2656  df-rex 2657  df-rab 2660  df-v 2903  df-dif 3268  df-un 3270  df-in 3272  df-ss 3279  df-nul 3574  df-if 3685  df-sn 3765  df-pr 3766  df-op 3768  df-uni 3960  df-br 4156  df-iota 5360  df-fv 5404
  Copyright terms: Public domain W3C validator