| 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 4124 | . 2 ⊢ (({𝐴, 𝐵} ∪ {𝐶}) ∪ {𝐷}) = ({𝐴, 𝐵} ∪ ({𝐶} ∪ {𝐷})) | |
| 2 | df-tp 4586 | . . 3 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶}) | |
| 3 | 2 | uneq1i 4117 | . 2 ⊢ ({𝐴, 𝐵, 𝐶} ∪ {𝐷}) = (({𝐴, 𝐵} ∪ {𝐶}) ∪ {𝐷}) |
| 4 | df-pr 4584 | . . 3 ⊢ {𝐶, 𝐷} = ({𝐶} ∪ {𝐷}) | |
| 5 | 4 | uneq2i 4118 | . 2 ⊢ ({𝐴, 𝐵} ∪ {𝐶, 𝐷}) = ({𝐴, 𝐵} ∪ ({𝐶} ∪ {𝐷})) |
| 6 | 1, 3, 5 | 3eqtr4ri 2795 | 1 ⊢ ({𝐴, 𝐵} ∪ {𝐶, 𝐷}) = ({𝐴, 𝐵, 𝐶} ∪ {𝐷}) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1559 ∪ cun 3902 {csn 4581 {cpr 4583 {ctp 4585 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1562 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-v 3455 df-un 3909 df-pr 4584 df-tp 4586 |
| This theorem is referenced by: cnlmodlem1 25176 cnlmodlem2 25177 cnlmodlem3 25178 cnlmod4 25179 cnstrcvs 25181 ex-pw 30575 |
| Copyright terms: Public domain | W3C validator |