| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > difprsn2 | Structured version Visualization version GIF version | ||
| Description: Removal of a singleton from an unordered pair. (Contributed by Alexander van der Vekens, 5-Oct-2017.) |
| Ref | Expression |
|---|---|
| difprsn2 | ⊢ (𝐴 ≠ 𝐵 → ({𝐴, 𝐵} ∖ {𝐵}) = {𝐴}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prcom 4684 | . . 3 ⊢ {𝐴, 𝐵} = {𝐵, 𝐴} | |
| 2 | 1 | difeq1i 4071 | . 2 ⊢ ({𝐴, 𝐵} ∖ {𝐵}) = ({𝐵, 𝐴} ∖ {𝐵}) |
| 3 | necom 2982 | . . 3 ⊢ (𝐴 ≠ 𝐵 ↔ 𝐵 ≠ 𝐴) | |
| 4 | difprsn1 4751 | . . 3 ⊢ (𝐵 ≠ 𝐴 → ({𝐵, 𝐴} ∖ {𝐵}) = {𝐴}) | |
| 5 | 3, 4 | sylbi 217 | . 2 ⊢ (𝐴 ≠ 𝐵 → ({𝐵, 𝐴} ∖ {𝐵}) = {𝐴}) |
| 6 | 2, 5 | eqtrid 2780 | 1 ⊢ (𝐴 ≠ 𝐵 → ({𝐴, 𝐵} ∖ {𝐵}) = {𝐴}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ≠ wne 2929 ∖ cdif 3895 {csn 4575 {cpr 4577 |
| 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 2705 |
| 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 2712 df-cleq 2725 df-clel 2808 df-ne 2930 df-ral 3049 df-rab 3397 df-v 3439 df-dif 3901 df-un 3903 df-in 3905 df-nul 4283 df-sn 4576 df-pr 4578 |
| This theorem is referenced by: f12dfv 7213 pmtrprfval 19401 nbgr2vtx1edg 29330 nbuhgr2vtx1edgb 29332 nfrgr2v 30254 indsupp 32855 cycpm2tr 33095 drngmxidl 33449 ldepsnlinc 48633 |
| Copyright terms: Public domain | W3C validator |