MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  sneqr Structured version   Visualization version   GIF version

Theorem sneqr 4798
Description: If the singletons of two sets are equal, the two sets are equal. Part of Exercise 4 of [TakeutiZaring] p. 15. (Contributed by NM, 27-Aug-1993.)
Hypothesis
Ref Expression
sneqr.1 𝐴 ∈ V
Assertion
Ref Expression
sneqr ({𝐴} = {𝐵} → 𝐴 = 𝐵)

Proof of Theorem sneqr
StepHypRef Expression
1 sneqr.1 . 2 𝐴 ∈ V
2 sneqrg 4797 . 2 (𝐴 ∈ V → ({𝐴} = {𝐵} → 𝐴 = 𝐵))
31, 2ax-mp 5 1 ({𝐴} = {𝐵} → 𝐴 = 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  Vcvv 3442  {csn 4582
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-sn 4583
This theorem is referenced by:  snsssn  4799  mosneq  4800  opth1  5431  propeqop  5463  opthwiener  5470  funsndifnop  7106  canth2  9070  axcc2lem  10358  hashge3el3dif  14422  dis2ndc  23416  axlowdim1  29044  esplyfval1  33749  bj-snsetex  37208  poimirlem13  37881  poimirlem14  37882  wopprc  43384  snen1g  43877  mnuprdlem2  44626  hoidmv1le  46949  fsetsnf1  47409
  Copyright terms: Public domain W3C validator