Theorem inundif 4440

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 3921	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
2		eldif 3915	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
3	1, 2	orbi12i 927	. . 3 ⊢ ((𝑥 ∈ (𝐴 ∩ 𝐵) ∨ 𝑥 ∈ (𝐴 ∖ 𝐵)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∨ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵)))
4		pm4.42 1069	. . 3 ⊢ (𝑥 ∈ 𝐴 ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∨ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵)))
5	3, 4	bitr4i 281	. 2 ⊢ ((𝑥 ∈ (𝐴 ∩ 𝐵) ∨ 𝑥 ∈ (𝐴 ∖ 𝐵)) ↔ 𝑥 ∈ 𝐴)
6	5	uneqri 4110	1 ⊢ ((𝐴 ∩ 𝐵) ∪ (𝐴 ∖ 𝐵)) = 𝐴

Syntax hints:  ¬ wn 3   ∧ wa 400   ∨ wo 860   = wceq 1570   ∈ wcel 2143   ∖ cdif 3902   ∪ cun 3903   ∩ cin 3904

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-v 3457  df-dif 3908  df-un 3910  df-in 3912

This theorem is referenced by:  iunxdif3  5061  partfun  6682  resasplit  6748  fresaun  6749  fresaunres2  6750  ixpfi2  9303  hashun3  14416  prmreclem2  16972  mvdco  19510  sylow2a  19684  ablfac1eu  20140  basdif0  23110  neitr  23337  cmpfi  23565  ptbasfi  23738  ptcnplem  23778  fin1aufil  24089  ismbl2  25686  volinun  25705  voliunlem2  25710  mbfeqalem2  25801  itg2cnlem2  25921  dvres2lem  26069  indifundif  32870  imadifxp  32946  ofpreima2  33011  resf1o  33075  indsumin  33181  gsummptres  33372  tocyccntz  33464  measun  34601  measunl  34606  inelcarsg  34701  carsgclctun  34711  sibfof  34730  probdif  34810  hgt750lemd  35035  mthmpps  36074  clcnvlem  44349  radcnvrat  45024  sumnnodd  46346  ovolsplit  46702  omelesplit  47232  ovnsplit  47362