Theorem inundif 4407

Description: The intersection and class difference of a class with another class unite to give the original class. (Contributed by Paul Chapman, 5-Jun-2009.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Assertion

Ref	Expression
inundif	⊢ ((𝐴 ∩ 𝐵) ∪ (𝐴 ∖ 𝐵)) = 𝐴

Proof of Theorem inundif

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elin 3899	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
2		eldif 3893	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
3	1, 2	orbi12i 920	. . 3 ⊢ ((𝑥 ∈ (𝐴 ∩ 𝐵) ∨ 𝑥 ∈ (𝐴 ∖ 𝐵)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∨ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵)))
4		pm4.42 1059	. . 3 ⊢ (𝑥 ∈ 𝐴 ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∨ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵)))
5	3, 4	bitr4i 279	. 2 ⊢ ((𝑥 ∈ (𝐴 ∩ 𝐵) ∨ 𝑥 ∈ (𝐴 ∖ 𝐵)) ↔ 𝑥 ∈ 𝐴)
6	5	uneqri 4086	1 ⊢ ((𝐴 ∩ 𝐵) ∪ (𝐴 ∖ 𝐵)) = 𝐴

Syntax hints:  ¬ wn 3   ∧ wa 396   ∨ wo 853   = wceq 1547   ∈ wcel 2119   ∖ cdif 3880   ∪ cun 3881   ∩ cin 3882

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-tru 1550  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-v 3433  df-dif 3886  df-un 3888  df-in 3890

This theorem is referenced by:  iunxdif3  5024  partfun  6632  resasplit  6697  fresaun  6698  fresaunres2  6699  ixpfi2  9250  hashun3  14337  prmreclem2  16879  mvdco  19411  sylow2a  19585  ablfac1eu  20041  basdif0  22936  neitr  23163  cmpfi  23391  ptbasfi  23564  ptcnplem  23604  fin1aufil  23915  ismbl2  25512  volinun  25531  voliunlem2  25536  mbfeqalem2  25627  itg2cnlem2  25747  dvres2lem  25895  indifundif  32612  imadifxp  32690  ofpreima2  32758  resf1o  32822  indsumin  32940  gsummptres  33133  tocyccntz  33225  measun  34395  measunl  34400  inelcarsg  34495  carsgclctun  34505  sibfof  34524  probdif  34604  hgt750lemd  34832  mthmpps  35810  clcnvlem  44067  radcnvrat  44758  sumnnodd  46075  ovolsplit  46431  omelesplit  46961  ovnsplit  47091