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 4574 | . . 3 ⊢ {𝐴} = {𝐴, 𝐴} | |
2 | 1 | uneq1i 4135 | . 2 ⊢ ({𝐴} ∪ {𝐵}) = ({𝐴, 𝐴} ∪ {𝐵}) |
3 | df-pr 4564 | . 2 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
4 | df-tp 4566 | . 2 ⊢ {𝐴, 𝐴, 𝐵} = ({𝐴, 𝐴} ∪ {𝐵}) | |
5 | 2, 3, 4 | 3eqtr4ri 2855 | 1 ⊢ {𝐴, 𝐴, 𝐵} = {𝐴, 𝐵} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 ∪ cun 3934 {csn 4561 {cpr 4563 {ctp 4565 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-v 3497 df-un 3941 df-pr 4564 df-tp 4566 |
This theorem is referenced by: tpidm13 4686 tpidm23 4687 tpidm 4688 fntpb 6966 hashtpg 13837 |
Copyright terms: Public domain | W3C validator |