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

Theorem nfpr 3633
Description: Bound-variable hypothesis builder for unordered pairs. (Contributed by NM, 14-Nov-1995.)
Hypotheses
Ref Expression
nfpr.1  |-  F/_ x A
nfpr.2  |-  F/_ x B
Assertion
Ref Expression
nfpr  |-  F/_ x { A ,  B }

Proof of Theorem nfpr
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 dfpr2 3602 . 2  |-  { A ,  B }  =  {
y  |  ( y  =  A  \/  y  =  B ) }
2 nfpr.1 . . . . 5  |-  F/_ x A
32nfeq2 2324 . . . 4  |-  F/ x  y  =  A
4 nfpr.2 . . . . 5  |-  F/_ x B
54nfeq2 2324 . . . 4  |-  F/ x  y  =  B
63, 5nfor 1567 . . 3  |-  F/ x
( y  =  A  \/  y  =  B )
76nfab 2317 . 2  |-  F/_ x { y  |  ( y  =  A  \/  y  =  B ) }
81, 7nfcxfr 2309 1  |-  F/_ x { A ,  B }
Colors of variables: wff set class
Syntax hints:    \/ wo 703    = wceq 1348   {cab 2156   F/_wnfc 2299   {cpr 3584
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-v 2732  df-un 3125  df-sn 3589  df-pr 3590
This theorem is referenced by:  nfsn  3643  nfop  3781
  Copyright terms: Public domain W3C validator