text: Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  undif3 Structured version   Visualization version   GIF version
  
  Theorem undif3 4187
   Description: An equality involving class union and class difference. The first equality of Exercise 13 of [TakeutiZaring] p. 22. (Contributed by Alan Sare, 17-Apr-2012.) (Proof shortened by JJ, 13-Jul-2021.)
  Assertion
  Ref Expression
  undif3 (𝐴 ∪ (𝐵𝐶)) = ((𝐴𝐵) ∖ (𝐶𝐴))
  
  Proof of Theorem undif3
  Dummy variable 𝑥 is distinct from all other variables.
  StepHypRef Expression
  1 elun 4048 . . . 4 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
  2 pm4.53 980 . . . . 5 (¬ (𝑥𝐶 ∧ ¬ 𝑥𝐴) ↔ (¬ 𝑥𝐶𝑥𝐴))
  3 eldif 3871 . . . . 5 (𝑥 ∈ (𝐶𝐴) ↔ (𝑥𝐶 ∧ ¬ 𝑥𝐴))
  42, 3xchnxbir 334 . . . 4 𝑥 ∈ (𝐶𝐴) ↔ (¬ 𝑥𝐶𝑥𝐴))
  51, 4anbi12i 626 . . 3 ((𝑥 ∈ (𝐴𝐵) ∧ ¬ 𝑥 ∈ (𝐶𝐴)) ↔ ((𝑥𝐴𝑥𝐵) ∧ (¬ 𝑥𝐶𝑥𝐴)))
  6 eldif 3871 . . 3 (𝑥 ∈ ((𝐴𝐵) ∖ (𝐶𝐴)) ↔ (𝑥 ∈ (𝐴𝐵) ∧ ¬ 𝑥 ∈ (𝐶𝐴)))
  7 elun 4048 . . . 4 (𝑥 ∈ (𝐴 ∪ (𝐵𝐶)) ↔ (𝑥𝐴𝑥 ∈ (𝐵𝐶)))
  8 eldif 3871 . . . . 5 (𝑥 ∈ (𝐵𝐶) ↔ (𝑥𝐵 ∧ ¬ 𝑥𝐶))
  98orbi2i 907 . . . 4 ((𝑥𝐴𝑥 ∈ (𝐵𝐶)) ↔ (𝑥𝐴 ∨ (𝑥𝐵 ∧ ¬ 𝑥𝐶)))
  10 ordi 1000 . . . . 5 ((𝑥𝐴 ∨ (𝑥𝐵 ∧ ¬ 𝑥𝐶)) ↔ ((𝑥𝐴𝑥𝐵) ∧ (𝑥𝐴 ∨ ¬ 𝑥𝐶)))
  11 orcom 865 . . . . . 6 ((𝑥𝐴 ∨ ¬ 𝑥𝐶) ↔ (¬ 𝑥𝐶𝑥𝐴))
  1211anbi2i 622 . . . . 5 (((𝑥𝐴𝑥𝐵) ∧ (𝑥𝐴 ∨ ¬ 𝑥𝐶)) ↔ ((𝑥𝐴𝑥𝐵) ∧ (¬ 𝑥𝐶𝑥𝐴)))
  1310, 12bitri 276 . . . 4 ((𝑥𝐴 ∨ (𝑥𝐵 ∧ ¬ 𝑥𝐶)) ↔ ((𝑥𝐴𝑥𝐵) ∧ (¬ 𝑥𝐶𝑥𝐴)))
  147, 9, 133bitri 298 . . 3 (𝑥 ∈ (𝐴 ∪ (𝐵𝐶)) ↔ ((𝑥𝐴𝑥𝐵) ∧ (¬ 𝑥𝐶𝑥𝐴)))
  155, 6, 143bitr4ri 305 . 2 (𝑥 ∈ (𝐴 ∪ (𝐵𝐶)) ↔ 𝑥 ∈ ((𝐴𝐵) ∖ (𝐶𝐴)))
  1615eqriv 2791 1 (𝐴 ∪ (𝐵𝐶)) = ((𝐴𝐵) ∖ (𝐶𝐴))
   Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   ∧ wa 396   ∨ wo 842   = wceq 1522   ∈ wcel 2080   ∖ cdif 3858   ∪ cun 3859 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1778  ax-4 1792  ax-5 1889  ax-6 1948  ax-7 1993  ax-8 2082  ax-9 2090  ax-10 2111  ax-11 2125  ax-12 2140  ax-ext 2768 This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-tru 1525  df-ex 1763  df-nf 1767  df-sb 2042  df-clab 2775  df-cleq 2787  df-clel 2862  df-nfc 2934  df-v 3438  df-dif 3864  df-un 3866 This theorem is referenced by:  undifabs  4342  llycmpkgen2  21842  hgt750lemb  31536
   Copyright terms: Public domain W3C validator
explanation: The provided text is a formal proof in the Metamath Proof Explorer system. It describes a theorem about set theory, specifically an equality involving class union and class difference. The theorem is stated and then proven step-by-step using logical expressions and references to other theorems and axioms. The text does not contain a question or an answer to a question.
distilabel_metadata.content: Evaluate the user given text extract and determine if it contains a math question and optionally and answer to this question.
  
  Output rules:
  
  1. Briefly describe the document and mention if it contains a question or a question and answer.
  2. Finalize the output with: Label: no-question,question,question-and-answer,multiple-question,multiple-question-and-answer
distilabel_metadata.role: system
distilabel_metadata.content: Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  undif3 Structured version   Visualization version   GIF version
  
  Theorem undif3 4187
   Description: An equality involving class union and class difference. The first equality of Exercise 13 of [TakeutiZaring] p. 22. (Contributed by Alan Sare, 17-Apr-2012.) (Proof shortened by JJ, 13-Jul-2021.)
  Assertion
  Ref Expression
  undif3 (𝐴 ∪ (𝐵𝐶)) = ((𝐴𝐵) ∖ (𝐶𝐴))
  
  Proof of Theorem undif3
  Dummy variable 𝑥 is distinct from all other variables.
  StepHypRef Expression
  1 elun 4048 . . . 4 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
  2 pm4.53 980 . . . . 5 (¬ (𝑥𝐶 ∧ ¬ 𝑥𝐴) ↔ (¬ 𝑥𝐶𝑥𝐴))
  3 eldif 3871 . . . . 5 (𝑥 ∈ (𝐶𝐴) ↔ (𝑥𝐶 ∧ ¬ 𝑥𝐴))
  42, 3xchnxbir 334 . . . 4 𝑥 ∈ (𝐶𝐴) ↔ (¬ 𝑥𝐶𝑥𝐴))
  51, 4anbi12i 626 . . 3 ((𝑥 ∈ (𝐴𝐵) ∧ ¬ 𝑥 ∈ (𝐶𝐴)) ↔ ((𝑥𝐴𝑥𝐵) ∧ (¬ 𝑥𝐶𝑥𝐴)))
  6 eldif 3871 . . 3 (𝑥 ∈ ((𝐴𝐵) ∖ (𝐶𝐴)) ↔ (𝑥 ∈ (𝐴𝐵) ∧ ¬ 𝑥 ∈ (𝐶𝐴)))
  7 elun 4048 . . . 4 (𝑥 ∈ (𝐴 ∪ (𝐵𝐶)) ↔ (𝑥𝐴𝑥 ∈ (𝐵𝐶)))
  8 eldif 3871 . . . . 5 (𝑥 ∈ (𝐵𝐶) ↔ (𝑥𝐵 ∧ ¬ 𝑥𝐶))
  98orbi2i 907 . . . 4 ((𝑥𝐴𝑥 ∈ (𝐵𝐶)) ↔ (𝑥𝐴 ∨ (𝑥𝐵 ∧ ¬ 𝑥𝐶)))
  10 ordi 1000 . . . . 5 ((𝑥𝐴 ∨ (𝑥𝐵 ∧ ¬ 𝑥𝐶)) ↔ ((𝑥𝐴𝑥𝐵) ∧ (𝑥𝐴 ∨ ¬ 𝑥𝐶)))
  11 orcom 865 . . . . . 6 ((𝑥𝐴 ∨ ¬ 𝑥𝐶) ↔ (¬ 𝑥𝐶𝑥𝐴))
  1211anbi2i 622 . . . . 5 (((𝑥𝐴𝑥𝐵) ∧ (𝑥𝐴 ∨ ¬ 𝑥𝐶)) ↔ ((𝑥𝐴𝑥𝐵) ∧ (¬ 𝑥𝐶𝑥𝐴)))
  1310, 12bitri 276 . . . 4 ((𝑥𝐴 ∨ (𝑥𝐵 ∧ ¬ 𝑥𝐶)) ↔ ((𝑥𝐴𝑥𝐵) ∧ (¬ 𝑥𝐶𝑥𝐴)))
  147, 9, 133bitri 298 . . 3 (𝑥 ∈ (𝐴 ∪ (𝐵𝐶)) ↔ ((𝑥𝐴𝑥𝐵) ∧ (¬ 𝑥𝐶𝑥𝐴)))
  155, 6, 143bitr4ri 305 . 2 (𝑥 ∈ (𝐴 ∪ (𝐵𝐶)) ↔ 𝑥 ∈ ((𝐴𝐵) ∖ (𝐶𝐴)))
  1615eqriv 2791 1 (𝐴 ∪ (𝐵𝐶)) = ((𝐴𝐵) ∖ (𝐶𝐴))
   Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   ∧ wa 396   ∨ wo 842   = wceq 1522   ∈ wcel 2080   ∖ cdif 3858   ∪ cun 3859 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1778  ax-4 1792  ax-5 1889  ax-6 1948  ax-7 1993  ax-8 2082  ax-9 2090  ax-10 2111  ax-11 2125  ax-12 2140  ax-ext 2768 This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-tru 1525  df-ex 1763  df-nf 1767  df-sb 2042  df-clab 2775  df-cleq 2787  df-clel 2862  df-nfc 2934  df-v 3438  df-dif 3864  df-un 3866 This theorem is referenced by:  undifabs  4342  llycmpkgen2  21842  hgt750lemb  31536
   Copyright terms: Public domain W3C validator
distilabel_metadata.role: user
distilabel_metadata.raw_output_q_a_detector_0: The provided text is a formal proof in the Metamath Proof Explorer system. It describes a theorem about set theory, specifically an equality involving class union and class difference. The theorem is stated and then proven step-by-step using logical expressions and references to other theorems and axioms. The text does not contain a question or an answer to a question.
  
  Label: no-question