| 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 4690 | . . 3 ⊢ {𝐴, 𝐵} = {𝐵, 𝐴} | |
| 2 | 1 | difeq1i 4076 | . 2 ⊢ ({𝐴, 𝐵} ∖ {𝐵}) = ({𝐵, 𝐴} ∖ {𝐵}) |
| 3 | necom 3009 | . . 3 ⊢ (𝐴 ≠ 𝐵 ↔ 𝐵 ≠ 𝐴) | |
| 4 | difprsn1 4759 | . . 3 ⊢ (𝐵 ≠ 𝐴 → ({𝐵, 𝐴} ∖ {𝐵}) = {𝐴}) | |
| 5 | 3, 4 | sylbi 219 | . 2 ⊢ (𝐴 ≠ 𝐵 → ({𝐵, 𝐴} ∖ {𝐵}) = {𝐴}) |
| 6 | 2, 5 | eqtrid 2808 | 1 ⊢ (𝐴 ≠ 𝐵 → ({𝐴, 𝐵} ∖ {𝐵}) = {𝐴}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1559 ≠ wne 2956 ∖ cdif 3901 {csn 4581 {cpr 4583 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3076 df-rab 3414 df-v 3455 df-dif 3907 df-un 3909 df-in 3911 df-nul 4286 df-sn 4582 df-pr 4584 |
| This theorem is referenced by: f12dfv 7253 pmtrprfval 19510 nbgr2vtx1edg 29497 nbuhgr2vtx1edgb 29499 nfrgr2v 30420 indsupp 33006 cycpm2tr 33260 drngmxidl 33626 ldepsnlinc 49094 |
| Copyright terms: Public domain | W3C validator |