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

Theorem preqsn 4821
Description: Equivalence for a pair equal to a singleton. (Contributed by NM, 3-Jun-2008.) (Revised by AV, 12-Jun-2022.)
Hypotheses
Ref Expression
preqsn.1 𝐴 ∈ V
preqsn.2 𝐵 ∈ V
Assertion
Ref Expression
preqsn ({𝐴, 𝐵} = {𝐶} ↔ (𝐴 = 𝐵 ∧ 𝐵 = 𝐶))

Proof of Theorem preqsn
StepHypRef Expression
1 preqsn.1 . . 3 𝐴 ∈ V
2 id 23 . . . 4 (𝐴 ∈ V → 𝐴 ∈ V)
3 preqsn.2 . . . . 5 𝐵 ∈ V
43a1i 11 . . . 4 (𝐴 ∈ V → 𝐵 ∈ V)
52, 4preqsnd 4818 . . 3 (𝐴 ∈ V → ({𝐴, 𝐵} = {𝐶} ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐶)))
61, 5ax-mp 5 . 2 ({𝐴, 𝐵} = {𝐶} ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐶))
7 eqeq2 2778 . . 3 (𝐵 = 𝐶 → (𝐴 = 𝐵 ↔ 𝐴 = 𝐶))
87pm5.32ri 586 . 2 ((𝐴 = 𝐵 ∧ 𝐵 = 𝐶) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐶))
96, 8bitr4i 281 1 ({𝐴, 𝐵} = {𝐶} ↔ (𝐴 = 𝐵 ∧ 𝐵 = 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1572   ∈ wcel 2150  Vcvv 3453  {csn 4587  {cpr 4589
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ne 2963  df-v 3455  df-dif 4049  df-un 4153  df-nul 4281  df-sn 4588  df-pr 4590
This theorem is used by:  opeqsng  5481  propeqop  5485  propssopi  5486  relop  5837  hash2prde  14655  symg2bas  19660
  Copyright terms: Public domain W3C validator