![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > tpidm12 | 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 |
---|---|
tpidm12 | ⊢ {𝐴, 𝐴, 𝐵} = {𝐴, 𝐵} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfsn2 4538 | . . 3 ⊢ {𝐴} = {𝐴, 𝐴} | |
2 | 1 | uneq1i 4086 | . 2 ⊢ ({𝐴} ∪ {𝐵}) = ({𝐴, 𝐴} ∪ {𝐵}) |
3 | df-pr 4528 | . 2 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
4 | df-tp 4530 | . 2 ⊢ {𝐴, 𝐴, 𝐵} = ({𝐴, 𝐴} ∪ {𝐵}) | |
5 | 2, 3, 4 | 3eqtr4ri 2832 | 1 ⊢ {𝐴, 𝐴, 𝐵} = {𝐴, 𝐵} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1538 ∪ cun 3879 {csn 4525 {cpr 4527 {ctp 4529 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-v 3443 df-un 3886 df-pr 4528 df-tp 4530 |
This theorem is referenced by: tpidm13 4652 tpidm23 4653 tpidm 4654 fntpb 6949 hashtpg 13839 |
Copyright terms: Public domain | W3C validator |