![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > tpidm23 | Structured version Visualization version GIF version |
Description: Unordered triple {𝐴, 𝐵, 𝐵} is just an overlong way to write {𝐴, 𝐵}. (Contributed by David A. Wheeler, 10-May-2015.) |
Ref | Expression |
---|---|
tpidm23 | ⊢ {𝐴, 𝐵, 𝐵} = {𝐴, 𝐵} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tprot 4746 | . 2 ⊢ {𝐴, 𝐵, 𝐵} = {𝐵, 𝐵, 𝐴} | |
2 | tpidm12 4752 | . 2 ⊢ {𝐵, 𝐵, 𝐴} = {𝐵, 𝐴} | |
3 | prcom 4729 | . 2 ⊢ {𝐵, 𝐴} = {𝐴, 𝐵} | |
4 | 1, 2, 3 | 3eqtri 2763 | 1 ⊢ {𝐴, 𝐵, 𝐵} = {𝐴, 𝐵} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1541 {cpr 4624 {ctp 4626 |
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 2702 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-tru 1544 df-ex 1782 df-sb 2068 df-clab 2709 df-cleq 2723 df-clel 2809 df-v 3475 df-un 3949 df-sn 4623 df-pr 4625 df-tp 4627 |
This theorem is referenced by: tppreq3 4756 fntpb 7195 hashtpg 14428 |
Copyright terms: Public domain | W3C validator |