| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dif0 | Structured version Visualization version GIF version | ||
| Description: The difference between a class and the empty set. Part of Exercise 4.4 of [Stoll] p. 16. (Contributed by NM, 17-Aug-2004.) |
| Ref | Expression |
|---|---|
| dif0 | ⊢ (𝐴 ∖ ∅) = 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | difid 4330 | . . 3 ⊢ (𝐴 ∖ 𝐴) = ∅ | |
| 2 | 1 | difeq2i 4077 | . 2 ⊢ (𝐴 ∖ (𝐴 ∖ 𝐴)) = (𝐴 ∖ ∅) |
| 3 | difdif 4089 | . 2 ⊢ (𝐴 ∖ (𝐴 ∖ 𝐴)) = 𝐴 | |
| 4 | 2, 3 | eqtr3i 2762 | 1 ⊢ (𝐴 ∖ ∅) = 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∖ cdif 3900 ∅c0 4287 |
| 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 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3402 df-v 3444 df-dif 3906 df-nul 4288 |
| This theorem is referenced by: unvdif 4429 disjdif2 4434 csbdif 4480 iinvdif 5037 symdif0 5042 dffv2 6937 2oconcl 8440 oe0m0 8457 oev2 8460 infdiffi 9579 cnfcom2lem 9622 brttrcl2 9635 ttrcltr 9637 rnttrcl 9643 m1bits 16379 mreexdomd 17584 efgi0 19661 vrgpinv 19710 frgpuptinv 19712 frgpnabllem1 19814 gsumval3 19848 gsumcllem 19849 dprddisj2 19982 0cld 22994 indiscld 23047 mretopd 23048 hauscmplem 23362 cfinfil 23849 csdfil 23850 filufint 23876 bcth3 25299 rembl 25509 volsup 25525 new0 27872 disjdifprg 32661 indconst0 32949 tocycf 33210 tocyc01 33211 prsiga 34308 sigapildsyslem 34338 sigapildsys 34339 sxbrsigalem3 34449 0elcarsg 34484 carsgclctunlem3 34497 onint1 36662 lindsdom 37862 oe0rif 43639 tfsconcat0i 43699 ntrclscls00 44419 ntrclskb 44422 compne 44793 prsal 46673 saluni 46680 caragen0 46861 carageniuncllem1 46876 iscnrm3rlem4 49299 aacllem 50157 |
| Copyright terms: Public domain | W3C validator |