![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > qdass | Structured version Visualization version GIF version |
Description: Two ways to write an unordered quadruple. (Contributed by Mario Carneiro, 5-Jan-2016.) |
Ref | Expression |
---|---|
qdass | ⊢ ({𝐴, 𝐵} ∪ {𝐶, 𝐷}) = ({𝐴, 𝐵, 𝐶} ∪ {𝐷}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | unass 4093 | . 2 ⊢ (({𝐴, 𝐵} ∪ {𝐶}) ∪ {𝐷}) = ({𝐴, 𝐵} ∪ ({𝐶} ∪ {𝐷})) | |
2 | df-tp 4530 | . . 3 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶}) | |
3 | 2 | uneq1i 4086 | . 2 ⊢ ({𝐴, 𝐵, 𝐶} ∪ {𝐷}) = (({𝐴, 𝐵} ∪ {𝐶}) ∪ {𝐷}) |
4 | df-pr 4528 | . . 3 ⊢ {𝐶, 𝐷} = ({𝐶} ∪ {𝐷}) | |
5 | 4 | uneq2i 4087 | . 2 ⊢ ({𝐴, 𝐵} ∪ {𝐶, 𝐷}) = ({𝐴, 𝐵} ∪ ({𝐶} ∪ {𝐷})) |
6 | 1, 3, 5 | 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: cnlmodlem1 23741 cnlmodlem2 23742 cnlmodlem3 23743 cnlmod4 23744 cnstrcvs 23746 ex-pw 28214 |
Copyright terms: Public domain | W3C validator |