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

Theorem difeqri 4065
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 4049 . . 3 (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
2 difeqri.1 . . 3 ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) ↔ 𝑥 ∈ 𝐶)
31, 2bitri 278 . 2 (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ 𝑥 ∈ 𝐶)
43eqriv 2757 1 (𝐴 ∖ 𝐵) = 𝐶
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ∖ cdif 4045
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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-dif 4047
This theorem is used by:  difdif  4071  ddif  4077  dfss4  4214  difin  4217  difab  4255
  Copyright terms: Public domain W3C validator