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

Theorem dfsn2ALT 4652
Description: Alternate definition of singleton, based on the (alternate) definition of pair. Definition 5.1 of [TakeutiZaring] p. 15. (Contributed by AV, 12-Jun-2022.) (New usage is discouraged.) (Proof modification is discouraged.)
Assertion
Ref Expression
dfsn2ALT {𝐴} = {𝐴, 𝐴}

Proof of Theorem dfsn2ALT
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 oridm 904 . . 3 ((𝑥 = 𝐴𝑥 = 𝐴) ↔ 𝑥 = 𝐴)
21abbii 2807 . 2 {𝑥 ∣ (𝑥 = 𝐴𝑥 = 𝐴)} = {𝑥𝑥 = 𝐴}
3 dfpr2 4651 . 2 {𝐴, 𝐴} = {𝑥 ∣ (𝑥 = 𝐴𝑥 = 𝐴)}
4 df-sn 4632 . 2 {𝐴} = {𝑥𝑥 = 𝐴}
52, 3, 43eqtr4ri 2774 1 {𝐴} = {𝐴, 𝐴}
Colors of variables: wff setvar class
Syntax hints:  wo 847   = wceq 1537  {cab 2712  {csn 4631  {cpr 4633
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1540  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-v 3480  df-un 3968  df-sn 4632  df-pr 4634
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator