![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > difprsn1 | Structured version Visualization version GIF version |
Description: Removal of a singleton from an unordered pair. (Contributed by Thierry Arnoux, 4-Feb-2017.) |
Ref | Expression |
---|---|
difprsn1 | ⊢ (𝐴 ≠ 𝐵 → ({𝐴, 𝐵} ∖ {𝐴}) = {𝐵}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | necom 2994 | . 2 ⊢ (𝐵 ≠ 𝐴 ↔ 𝐴 ≠ 𝐵) | |
2 | df-pr 4630 | . . . . . 6 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
3 | 2 | equncomi 4154 | . . . . 5 ⊢ {𝐴, 𝐵} = ({𝐵} ∪ {𝐴}) |
4 | 3 | difeq1i 4117 | . . . 4 ⊢ ({𝐴, 𝐵} ∖ {𝐴}) = (({𝐵} ∪ {𝐴}) ∖ {𝐴}) |
5 | difun2 4479 | . . . 4 ⊢ (({𝐵} ∪ {𝐴}) ∖ {𝐴}) = ({𝐵} ∖ {𝐴}) | |
6 | 4, 5 | eqtri 2760 | . . 3 ⊢ ({𝐴, 𝐵} ∖ {𝐴}) = ({𝐵} ∖ {𝐴}) |
7 | disjsn2 4715 | . . . 4 ⊢ (𝐵 ≠ 𝐴 → ({𝐵} ∩ {𝐴}) = ∅) | |
8 | disj3 4452 | . . . 4 ⊢ (({𝐵} ∩ {𝐴}) = ∅ ↔ {𝐵} = ({𝐵} ∖ {𝐴})) | |
9 | 7, 8 | sylib 217 | . . 3 ⊢ (𝐵 ≠ 𝐴 → {𝐵} = ({𝐵} ∖ {𝐴})) |
10 | 6, 9 | eqtr4id 2791 | . 2 ⊢ (𝐵 ≠ 𝐴 → ({𝐴, 𝐵} ∖ {𝐴}) = {𝐵}) |
11 | 1, 10 | sylbir 234 | 1 ⊢ (𝐴 ≠ 𝐵 → ({𝐴, 𝐵} ∖ {𝐴}) = {𝐵}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1541 ≠ wne 2940 ∖ cdif 3944 ∪ cun 3945 ∩ cin 3946 ∅c0 4321 {csn 4627 {cpr 4629 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2703 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2710 df-cleq 2724 df-clel 2810 df-ne 2941 df-ral 3062 df-rab 3433 df-v 3476 df-dif 3950 df-un 3952 df-in 3954 df-nul 4322 df-sn 4628 df-pr 4630 |
This theorem is referenced by: difprsn2 4803 f12dfv 7267 pmtrprfval 19349 nbgr2vtx1edg 28596 nbuhgr2vtx1edgb 28598 nfrgr2v 29514 mptprop 31907 cycpm2tr 32265 eulerpartlemgf 33366 coinflippvt 33471 ldepsnlinc 47142 |
Copyright terms: Public domain | W3C validator |