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

Theorem difeqri 4068
Description: Inference from membership to difference. (Contributed by NM, 17-May-1998.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
Hypothesis
Ref Expression
difeqri.1 ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) ↔ 𝑥 ∈ 𝐶)
Assertion
Ref Expression
difeqri (𝐴 ∖ 𝐵) = 𝐶
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶

Proof of Theorem difeqri
StepHypRef Expression
1 eldif 4052 . . 3 (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
2 difeqri.1 . . 3 ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) ↔ 𝑥 ∈ 𝐶)
31, 2bitri 278 . 2 (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ 𝑥 ∈ 𝐶)
43eqriv 2760 1 (𝐴 ∖ 𝐵) = 𝐶
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ∖ cdif 4048
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-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-dif 4050
This theorem is used by:  difdif  4074  ddif  4080  dfss4  4217  difin  4220  difab  4258
  Copyright terms: Public domain W3C validator