![]() |
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 4653 | . 2 ⊢ {𝐵, 𝐶, 𝐴} = ({𝐵, 𝐶} ∪ {𝐴}) | |
2 | tprot 4774 | . 2 ⊢ {𝐴, 𝐵, 𝐶} = {𝐵, 𝐶, 𝐴} | |
3 | uncom 4181 | . 2 ⊢ ({𝐴} ∪ {𝐵, 𝐶}) = ({𝐵, 𝐶} ∪ {𝐴}) | |
4 | 1, 2, 3 | 3eqtr4i 2778 | 1 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴} ∪ {𝐵, 𝐶}) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∪ cun 3974 {csn 4648 {cpr 4650 {ctp 4652 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-tru 1540 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-v 3490 df-un 3981 df-sn 4649 df-pr 4651 df-tp 4653 |
This theorem is referenced by: qdassr 4779 en3 9344 wuntp 10780 symgvalstruct 19438 symgvalstructOLD 19439 ex-pw 30461 |
Copyright terms: Public domain | W3C validator |