Theorem difpr 4748

Description: Removing two elements as pair of elements corresponds to removing each of the two elements as singletons. (Contributed by Alexander van der Vekens, 13-Jul-2018.)

Assertion

Ref	Expression
difpr	⊢ (𝐴 ∖ {𝐵, 𝐶}) = ((𝐴 ∖ {𝐵}) ∖ {𝐶})

Proof of Theorem difpr

Step	Hyp	Ref	Expression
1		df-pr 4570	. . 3 ⊢ {𝐵, 𝐶} = ({𝐵} ∪ {𝐶})
2	1	difeq2i 4063	. 2 ⊢ (𝐴 ∖ {𝐵, 𝐶}) = (𝐴 ∖ ({𝐵} ∪ {𝐶}))
3		difun1 4239	. 2 ⊢ (𝐴 ∖ ({𝐵} ∪ {𝐶})) = ((𝐴 ∖ {𝐵}) ∖ {𝐶})
4	2, 3	eqtri 2759	1 ⊢ (𝐴 ∖ {𝐵, 𝐶}) = ((𝐴 ∖ {𝐵}) ∖ {𝐶})

Syntax hints:   = wceq 1542   ∖ cdif 3886   ∪ cun 3887  {csn 4567  {cpr 4569

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-pr 4570

This theorem is referenced by:  hashdifpr  14377  chnccat  18592  nbgrssvwo2  29431  nbupgrres  29433  nbupgruvtxres  29476  uvtxupgrres  29477  pmtrcnelor  33152