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

Theorem nfopab1 4195
Description: The first abstraction variable in an ordered-pair class abstraction (class builder) is effectively not free. (Contributed by NM, 16-May-1995.) (Revised by Mario Carneiro, 14-Oct-2016.)
Assertion
Ref Expression
nfopab1  |-  F/_ x { <. x ,  y
>.  |  ph }

Proof of Theorem nfopab1
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 df-opab 4188 . 2  |-  { <. x ,  y >.  |  ph }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ph ) }
2 nfe1 1549 . . 3  |-  F/ x E. x E. y ( z  =  <. x ,  y >.  /\  ph )
32nfab 2397 . 2  |-  F/_ x { z  |  E. x E. y ( z  =  <. x ,  y
>.  /\  ph ) }
41, 3nfcxfr 2389 1  |-  F/_ x { <. x ,  y
>.  |  ph }
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1402   E.wex 1545   {cab 2224   F/_wnfc 2379   <.cop 3708   {copab 4186
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-opab 4188
This theorem is referenced by:  nfmpt1  4219  opelopabsb  4397  ssopab2b  4414  dmopab  4987  rnopab  5024  funopab  5407  0neqopab  6123
  Copyright terms: Public domain W3C validator