| 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 9518 | . 2 ⊢ (𝐴 ∩ {𝐴}) = ∅ | |
| 2 | undif5 4425 | . 2 ⊢ ((𝐴 ∩ {𝐴}) = ∅ → ((𝐴 ∪ {𝐴}) ∖ {𝐴}) = 𝐴) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ((𝐴 ∪ {𝐴}) ∖ {𝐴}) = 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∖ cdif 3887 ∪ cun 3888 ∩ cin 3889 ∅c0 4274 {csn 4568 |
| 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 ax-sep 5232 ax-pr 5371 ax-reg 9501 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-nul 4275 df-sn 4569 |
| This theorem is referenced by: sucdifsn 38824 partsuc2 39220 |
| Copyright terms: Public domain | W3C validator |