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

Theorem snjust 4586
Description: Soundness justification theorem for df-sn 4588. (Contributed by Rodolfo Medina, 28-Apr-2010.) (Proof shortened by Andrew Salmon, 29-Jun-2011.)
Assertion
Ref Expression
snjust {𝑥 ∣ 𝑥 = 𝐴} = {𝑦 ∣ 𝑦 = 𝐴}
Distinct variable groups:   𝑥,𝐴   𝑦,𝐴

Proof of Theorem snjust
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eqeq1 2767 . . 3 (𝑥 = 𝑧 → (𝑥 = 𝐴 ↔ 𝑧 = 𝐴))
21cbvabv 2833 . 2 {𝑥 ∣ 𝑥 = 𝐴} = {𝑧 ∣ 𝑧 = 𝐴}
3 eqeq1 2767 . . 3 (𝑧 = 𝑦 → (𝑧 = 𝐴 ↔ 𝑦 = 𝐴))
43cbvabv 2833 . 2 {𝑧 ∣ 𝑧 = 𝐴} = {𝑦 ∣ 𝑦 = 𝐴}
52, 4eqtri 2786 1 {𝑥 ∣ 𝑥 = 𝐴} = {𝑦 ∣ 𝑦 = 𝐴}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1569  {cab 2741
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-9 2156  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator