Mathbox for Thierry Arnoux < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  difres Structured version   Visualization version   GIF version

Theorem difres 29741
 Description: Case when class difference in unaffected by restriction. (Contributed by Thierry Arnoux, 1-Jan-2020.)
Assertion
Ref Expression
difres (𝐴 ⊆ (𝐵 × V) → (𝐴 ∖ (𝐶𝐵)) = (𝐴𝐶))

Proof of Theorem difres
StepHypRef Expression
1 df-res 5278 . . 3 (𝐶𝐵) = (𝐶 ∩ (𝐵 × V))
21difeq2i 3868 . 2 (𝐴 ∖ (𝐶𝐵)) = (𝐴 ∖ (𝐶 ∩ (𝐵 × V)))
3 difindi 4024 . . . 4 (𝐴 ∖ (𝐶 ∩ (𝐵 × V))) = ((𝐴𝐶) ∪ (𝐴 ∖ (𝐵 × V)))
4 ssdif 3888 . . . . . . 7 (𝐴 ⊆ (𝐵 × V) → (𝐴 ∖ (𝐵 × V)) ⊆ ((𝐵 × V) ∖ (𝐵 × V)))
5 difid 4091 . . . . . . 7 ((𝐵 × V) ∖ (𝐵 × V)) = ∅
64, 5syl6sseq 3792 . . . . . 6 (𝐴 ⊆ (𝐵 × V) → (𝐴 ∖ (𝐵 × V)) ⊆ ∅)
7 ss0 4117 . . . . . 6 ((𝐴 ∖ (𝐵 × V)) ⊆ ∅ → (𝐴 ∖ (𝐵 × V)) = ∅)
86, 7syl 17 . . . . 5 (𝐴 ⊆ (𝐵 × V) → (𝐴 ∖ (𝐵 × V)) = ∅)
98uneq2d 3910 . . . 4 (𝐴 ⊆ (𝐵 × V) → ((𝐴𝐶) ∪ (𝐴 ∖ (𝐵 × V))) = ((𝐴𝐶) ∪ ∅))
103, 9syl5eq 2806 . . 3 (𝐴 ⊆ (𝐵 × V) → (𝐴 ∖ (𝐶 ∩ (𝐵 × V))) = ((𝐴𝐶) ∪ ∅))
11 un0 4110 . . 3 ((𝐴𝐶) ∪ ∅) = (𝐴𝐶)
1210, 11syl6eq 2810 . 2 (𝐴 ⊆ (𝐵 × V) → (𝐴 ∖ (𝐶 ∩ (𝐵 × V))) = (𝐴𝐶))
132, 12syl5eq 2806 1 (𝐴 ⊆ (𝐵 × V) → (𝐴 ∖ (𝐶𝐵)) = (𝐴𝐶))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1632  Vcvv 3340   ∖ cdif 3712   ∪ cun 3713   ∩ cin 3714   ⊆ wss 3715  ∅c0 4058   × cxp 5264   ↾ cres 5268 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ral 3055  df-rab 3059  df-v 3342  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-nul 4059  df-res 5278 This theorem is referenced by:  qtophaus  30233
 Copyright terms: Public domain W3C validator