| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tpass | Structured version Visualization version GIF version | ||
| Description: Split off the first element of an unordered triple. (Contributed by Mario Carneiro, 5-Jan-2016.) |
| Ref | Expression |
|---|---|
| tpass | ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴} ∪ {𝐵, 𝐶}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-tp 4589 | . 2 ⊢ {𝐵, 𝐶, 𝐴} = ({𝐵, 𝐶} ∪ {𝐴}) | |
| 2 | tprot 4710 | . 2 ⊢ {𝐴, 𝐵, 𝐶} = {𝐵, 𝐶, 𝐴} | |
| 3 | uncom 4105 | . 2 ⊢ ({𝐴} ∪ {𝐵, 𝐶}) = ({𝐵, 𝐶} ∪ {𝐴}) | |
| 4 | 1, 2, 3 | 3eqtr4i 2794 | 1 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴} ∪ {𝐵, 𝐶}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∪ cun 3897 {csn 4584 {cpr 4586 {ctp 4588 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-v 3453 df-un 3904 df-sn 4585 df-pr 4587 df-tp 4589 |
| This theorem is used by: qdassr 4715 en3 9256 wuntp 10777 symgvalstruct 19591 ex-pw 31012 |
| Copyright terms: Public domain | W3C validator |