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

Theorem nfcjust 2420
Description: Justification theorem for df-nfc 2421. (Contributed by Mario Carneiro, 13-Oct-2016.)
Assertion
Ref Expression
nfcjust  |-  ( A. y F/ x  y  e.  A  <->  A. z F/ x  z  e.  A )
Distinct variable groups:    x, y,
z    y, A, z
Allowed substitution hint:    A( x)

Proof of Theorem nfcjust
StepHypRef Expression
1 nfv 1609 . . 3  |-  F/ x  y  =  z
2 eleq1 2356 . . 3  |-  ( y  =  z  ->  (
y  e.  A  <->  z  e.  A ) )
31, 2nfbidf 1766 . 2  |-  ( y  =  z  ->  ( F/ x  y  e.  A 
<->  F/ x  z  e.  A ) )
43cbvalv 1955 1  |-  ( A. y F/ x  y  e.  A  <->  A. z F/ x  z  e.  A )
Colors of variables: wff set class
Syntax hints:    <-> wb 176   A.wal 1530   F/wnf 1534    = wceq 1632    e. wcel 1696
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1310  df-ex 1532  df-nf 1535  df-cleq 2289  df-clel 2292
  Copyright terms: Public domain W3C validator