| 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 4694 | . . 3 ⊢ {𝐴, 𝐵} = {𝐵, 𝐴} | |
| 2 | 1 | difeq1i 4079 | . 2 ⊢ ({𝐴, 𝐵} ∖ {𝐵}) = ({𝐵, 𝐴} ∖ {𝐵}) |
| 3 | necom 3013 | . . 3 ⊢ (𝐴 ≠ 𝐵 ↔ 𝐵 ≠ 𝐴) | |
| 4 | difprsn1 4763 | . . 3 ⊢ (𝐵 ≠ 𝐴 → ({𝐵, 𝐴} ∖ {𝐵}) = {𝐴}) | |
| 5 | 3, 4 | sylbi 220 | . 2 ⊢ (𝐴 ≠ 𝐵 → ({𝐵, 𝐴} ∖ {𝐵}) = {𝐴}) |
| 6 | 2, 5 | eqtrid 2812 | 1 ⊢ (𝐴 ≠ 𝐵 → ({𝐴, 𝐵} ∖ {𝐵}) = {𝐴}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1563 ≠ wne 2960 ∖ cdif 3904 {csn 4585 {cpr 4587 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1566 df-fal 1576 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3080 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-nul 4289 df-sn 4586 df-pr 4588 |
| This theorem is referenced by: f12dfv 7261 pmtrprfval 19548 nbgr2vtx1edg 29609 nbuhgr2vtx1edgb 29611 nfrgr2v 30532 indsupp 33100 cycpm2tr 33352 drngmxidl 33676 ldepsnlinc 49139 |
| Copyright terms: Public domain | W3C validator |