![]() |
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 4633 | . 2 ⊢ {𝐵, 𝐶, 𝐴} = ({𝐵, 𝐶} ∪ {𝐴}) | |
2 | tprot 4753 | . 2 ⊢ {𝐴, 𝐵, 𝐶} = {𝐵, 𝐶, 𝐴} | |
3 | uncom 4153 | . 2 ⊢ ({𝐴} ∪ {𝐵, 𝐶}) = ({𝐵, 𝐶} ∪ {𝐴}) | |
4 | 1, 2, 3 | 3eqtr4i 2769 | 1 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴} ∪ {𝐵, 𝐶}) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1540 ∪ cun 3946 {csn 4628 {cpr 4630 {ctp 4632 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-tru 1543 df-ex 1781 df-sb 2067 df-clab 2709 df-cleq 2723 df-clel 2809 df-v 3475 df-un 3953 df-sn 4629 df-pr 4631 df-tp 4633 |
This theorem is referenced by: qdassr 4758 en3 9288 wuntp 10712 symgvalstruct 19312 symgvalstructOLD 19313 ex-pw 30115 |
Copyright terms: Public domain | W3C validator |