| 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 4138 | . 2 ⊢ (({𝐴, 𝐵} ∪ {𝐶}) ∪ {𝐷}) = ({𝐴, 𝐵} ∪ ({𝐶} ∪ {𝐷})) | |
| 2 | df-tp 4597 | . . 3 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶}) | |
| 3 | 2 | uneq1i 4130 | . 2 ⊢ ({𝐴, 𝐵, 𝐶} ∪ {𝐷}) = (({𝐴, 𝐵} ∪ {𝐶}) ∪ {𝐷}) |
| 4 | df-pr 4595 | . . 3 ⊢ {𝐶, 𝐷} = ({𝐶} ∪ {𝐷}) | |
| 5 | 4 | uneq2i 4131 | . 2 ⊢ ({𝐴, 𝐵} ∪ {𝐶, 𝐷}) = ({𝐴, 𝐵} ∪ ({𝐶} ∪ {𝐷})) |
| 6 | 1, 3, 5 | 3eqtr4ri 2764 | 1 ⊢ ({𝐴, 𝐵} ∪ {𝐶, 𝐷}) = ({𝐴, 𝐵, 𝐶} ∪ {𝐷}) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1540 ∪ cun 3915 {csn 4592 {cpr 4594 {ctp 4596 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2702 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1543 df-ex 1780 df-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-v 3452 df-un 3922 df-pr 4595 df-tp 4597 |
| This theorem is referenced by: cnlmodlem1 25043 cnlmodlem2 25044 cnlmodlem3 25045 cnlmod4 25046 cnstrcvs 25048 ex-pw 30365 |
| Copyright terms: Public domain | W3C validator |