| 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 9568 | . 2 ⊢ (𝐴 ∩ {𝐴}) = ∅ | |
| 2 | undif5 4445 | . 2 ⊢ ((𝐴 ∩ {𝐴}) = ∅ → ((𝐴 ∪ {𝐴}) ∖ {𝐴}) = 𝐴) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ((𝐴 ∪ {𝐴}) ∖ {𝐴}) = 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1570 ∖ cdif 3902 ∪ cun 3903 ∩ cin 3904 ∅c0 4286 {csn 4589 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-reg 9550 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-nul 4287 df-sn 4590 |
| This theorem is referenced by: sucdifsn 39155 partsuc2 39551 |
| Copyright terms: Public domain | W3C validator |