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

Theorem difjust 4049
Description: Soundness justification theorem for df-dif 4050. (Contributed by Rodolfo Medina, 27-Apr-2010.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
Assertion
Ref Expression
difjust {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵)} = {𝑦 ∣ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵)}
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑦,𝐴   𝑦,𝐵

Proof of Theorem difjust
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eleq1w 2847 . . . 4 (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴))
2 eleq1w 2847 . . . . 5 (𝑥 = 𝑧 → (𝑥 ∈ 𝐵 ↔ 𝑧 ∈ 𝐵))
32notbid 321 . . . 4 (𝑥 = 𝑧 → (¬ 𝑥 ∈ 𝐵 ↔ ¬ 𝑧 ∈ 𝐵))
41, 3anbi12d 644 . . 3 (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) ↔ (𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ∈ 𝐵)))
54cbvabv 2834 . 2 {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵)} = {𝑧 ∣ (𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ∈ 𝐵)}
6 eleq1w 2847 . . . 4 (𝑧 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
7 eleq1w 2847 . . . . 5 (𝑧 = 𝑦 → (𝑧 ∈ 𝐵 ↔ 𝑦 ∈ 𝐵))
87notbid 321 . . . 4 (𝑧 = 𝑦 → (¬ 𝑧 ∈ 𝐵 ↔ ¬ 𝑦 ∈ 𝐵))
96, 8anbi12d 644 . . 3 (𝑧 = 𝑦 → ((𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ∈ 𝐵) ↔ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵)))
109cbvabv 2834 . 2 {𝑧 ∣ (𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ∈ 𝐵)} = {𝑦 ∣ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵)}
115, 10eqtri 2786 1 {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵)} = {𝑦 ∣ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵)}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {cab 2741
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator