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

Theorem sneqi 3595
Description: Equality inference for singletons. (Contributed by NM, 22-Jan-2004.)
Hypothesis
Ref Expression
sneqi.1  |-  A  =  B
Assertion
Ref Expression
sneqi  |-  { A }  =  { B }

Proof of Theorem sneqi
StepHypRef Expression
1 sneqi.1 . 2  |-  A  =  B
2 sneq 3594 . 2  |-  ( A  =  B  ->  { A }  =  { B } )
31, 2ax-mp 5 1  |-  { A }  =  { B }
Colors of variables: wff set class
Syntax hints:    = wceq 1348   {csn 3583
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-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-11 1499  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-sn 3589
This theorem is referenced by:  fnressn  5682  fressnfv  5683  snriota  5838  xpassen  6808  ennnfonelem1  12362  strle1g  12508
  Copyright terms: Public domain W3C validator