| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > sucdifsn2 | Structured version Visualization version GIF version | ||
| Description: Absorption of union with a singleton by difference. (Contributed by Peter Mazsa, 24-Jul-2024.) |
| Ref | Expression |
|---|---|
| sucdifsn2 | ⊢ ((𝐴 ∪ {𝐴}) ∖ {𝐴}) = 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | disjcsn 9512 | . 2 ⊢ (𝐴 ∩ {𝐴}) = ∅ | |
| 2 | undif5 4437 | . 2 ⊢ ((𝐴 ∩ {𝐴}) = ∅ → ((𝐴 ∪ {𝐴}) ∖ {𝐴}) = 𝐴) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ((𝐴 ∪ {𝐴}) ∖ {𝐴}) = 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 ∖ cdif 3898 ∪ cun 3899 ∩ cin 3900 ∅c0 4285 {csn 4580 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 ax-sep 5241 ax-pr 5377 ax-reg 9497 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-nul 4286 df-sn 4581 |
| This theorem is referenced by: sucdifsn 38669 partsuc2 39048 |
| Copyright terms: Public domain | W3C validator |