Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  difpr GIF version

Theorem difpr 3630
 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
StepHypRef Expression
1 df-pr 3502 . . 3 {𝐵, 𝐶} = ({𝐵} ∪ {𝐶})
21difeq2i 3159 . 2 (𝐴 ∖ {𝐵, 𝐶}) = (𝐴 ∖ ({𝐵} ∪ {𝐶}))
3 difun1 3304 . 2 (𝐴 ∖ ({𝐵} ∪ {𝐶})) = ((𝐴 ∖ {𝐵}) ∖ {𝐶})
42, 3eqtri 2136 1 (𝐴 ∖ {𝐵, 𝐶}) = ((𝐴 ∖ {𝐵}) ∖ {𝐶})
 Colors of variables: wff set class Syntax hints:   = wceq 1314   ∖ cdif 3036   ∪ cun 3037  {csn 3495  {cpr 3496 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097 This theorem depends on definitions:  df-bi 116  df-tru 1317  df-nf 1420  df-sb 1719  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2245  df-ral 2396  df-rab 2400  df-v 2660  df-dif 3041  df-un 3043  df-in 3045  df-pr 3502 This theorem is referenced by:  hashdifpr  10506
 Copyright terms: Public domain W3C validator