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

Theorem nfoprab1 6017
Description: The abstraction variables in an operation class abstraction are not free. (Contributed by NM, 25-Apr-1995.) (Revised by David Abernethy, 19-Jun-2012.)
Assertion
Ref Expression
nfoprab1  |-  F/_ x { <. <. x ,  y
>. ,  z >.  | 
ph }

Proof of Theorem nfoprab1
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 df-oprab 5971 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { w  |  E. x E. y E. z ( w  = 
<. <. x ,  y
>. ,  z >.  /\ 
ph ) }
2 nfe1 1520 . . 3  |-  F/ x E. x E. y E. z ( w  = 
<. <. x ,  y
>. ,  z >.  /\ 
ph )
32nfab 2355 . 2  |-  F/_ x { w  |  E. x E. y E. z
( w  =  <. <.
x ,  y >. ,  z >.  /\  ph ) }
41, 3nfcxfr 2347 1  |-  F/_ x { <. <. x ,  y
>. ,  z >.  | 
ph }
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1373   E.wex 1516   {cab 2193   F/_wnfc 2337   <.cop 3646   {coprab 5968
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189
This theorem depends on definitions:  df-bi 117  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-oprab 5971
This theorem is referenced by:  ssoprab2b  6025  nfmpo1  6035  ovi3  6106  tposoprab  6389
  Copyright terms: Public domain W3C validator