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

Theorem snopeqopsnid 5491
Description: Equivalence for an ordered pair of two identical singletons equal to a singleton of an ordered pair. (Contributed by AV, 24-Sep-2020.) (Revised by AV, 15-Jul-2022.) (Avoid depending on this detail.)
Hypothesis
Ref Expression
snopeqopsnid.a 𝐴 ∈ V
Assertion
Ref Expression
snopeqopsnid {⟨𝐴, 𝐴⟩} = ⟨{𝐴}, {𝐴}⟩

Proof of Theorem snopeqopsnid
StepHypRef Expression
1 eqid 2762 . 2 𝐴 = 𝐴
2 eqid 2762 . 2 {𝐴} = {𝐴}
3 snopeqopsnid.a . . 3 𝐴 ∈ V
43, 3snopeqop 5488 . 2 ({⟨𝐴, 𝐴⟩} = ⟨{𝐴}, {𝐴}⟩ ↔ (𝐴 = 𝐴 ∧ {𝐴} = {𝐴} ∧ {𝐴} = {𝐴}))
51, 2, 2, 4mpbir3an 1359 1 {⟨𝐴, 𝐴⟩} = ⟨{𝐴}, {𝐴}⟩
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1569  wcel 2142  Vcvv 3454  {csn 4588  cop 4594
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-pr 5403
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595
This theorem is used by:  funsneqopb  7149  vtxvalsnop  29402  iedgvalsnop  29403
  Copyright terms: Public domain W3C validator