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

Theorem nfpr 3582
 Description: Bound-variable hypothesis builder for unordered pairs. (Contributed by NM, 14-Nov-1995.)
Hypotheses
Ref Expression
nfpr.1 𝑥𝐴
nfpr.2 𝑥𝐵
Assertion
Ref Expression
nfpr 𝑥{𝐴, 𝐵}

Proof of Theorem nfpr
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 dfpr2 3552 . 2 {𝐴, 𝐵} = {𝑦 ∣ (𝑦 = 𝐴𝑦 = 𝐵)}
2 nfpr.1 . . . . 5 𝑥𝐴
32nfeq2 2294 . . . 4 𝑥 𝑦 = 𝐴
4 nfpr.2 . . . . 5 𝑥𝐵
54nfeq2 2294 . . . 4 𝑥 𝑦 = 𝐵
63, 5nfor 1554 . . 3 𝑥(𝑦 = 𝐴𝑦 = 𝐵)
76nfab 2287 . 2 𝑥{𝑦 ∣ (𝑦 = 𝐴𝑦 = 𝐵)}
81, 7nfcxfr 2279 1 𝑥{𝐴, 𝐵}
 Colors of variables: wff set class Syntax hints:   ∨ wo 698   = wceq 1332  {cab 2126  Ⅎwnfc 2269  {cpr 3534 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 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122 This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-v 2692  df-un 3081  df-sn 3539  df-pr 3540 This theorem is referenced by:  nfsn  3592  nfop  3730
 Copyright terms: Public domain W3C validator