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

Theorem nfpw 3684
Description: Bound-variable hypothesis builder for power class. (Contributed by NM, 28-Oct-2003.) (Revised by Mario Carneiro, 13-Oct-2016.)
Hypothesis
Ref Expression
nfpw.1  |-  F/_ x A
Assertion
Ref Expression
nfpw  |-  F/_ x ~P A

Proof of Theorem nfpw
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 df-pw 3670 . 2  |-  ~P A  =  { y  |  y 
C_  A }
2 nfcv 2384 . . . 4  |-  F/_ x
y
3 nfpw.1 . . . 4  |-  F/_ x A
42, 3nfss 3230 . . 3  |-  F/ x  y  C_  A
54nfab 2389 . 2  |-  F/_ x { y  |  y 
C_  A }
61, 5nfcxfr 2381 1  |-  F/_ x ~P A
Colors of variables: wff set class
Syntax hints:   {cab 2218   F/_wnfc 2371    C_ wss 3210   ~Pcpw 3668
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214
This theorem depends on definitions:  df-bi 117  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-in 3216  df-ss 3223  df-pw 3670
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator