| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > qdassr | Structured version Visualization version GIF version | ||
| Description: Two ways to write an unordered quadruple. (Contributed by Mario Carneiro, 5-Jan-2016.) |
| Ref | Expression |
|---|---|
| qdassr | ⊢ ({𝐴, 𝐵} ∪ {𝐶, 𝐷}) = ({𝐴} ∪ {𝐵, 𝐶, 𝐷}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | unass 4101 | . 2 ⊢ (({𝐴} ∪ {𝐵}) ∪ {𝐶, 𝐷}) = ({𝐴} ∪ ({𝐵} ∪ {𝐶, 𝐷})) | |
| 2 | df-pr 4558 | . . 3 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
| 3 | 2 | uneq1i 4094 | . 2 ⊢ ({𝐴, 𝐵} ∪ {𝐶, 𝐷}) = (({𝐴} ∪ {𝐵}) ∪ {𝐶, 𝐷}) |
| 4 | tpass 4684 | . . 3 ⊢ {𝐵, 𝐶, 𝐷} = ({𝐵} ∪ {𝐶, 𝐷}) | |
| 5 | 4 | uneq2i 4095 | . 2 ⊢ ({𝐴} ∪ {𝐵, 𝐶, 𝐷}) = ({𝐴} ∪ ({𝐵} ∪ {𝐶, 𝐷})) |
| 6 | 1, 3, 5 | 3eqtr4i 2772 | 1 ⊢ ({𝐴, 𝐵} ∪ {𝐶, 𝐷}) = ({𝐴} ∪ {𝐵, 𝐶, 𝐷}) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1547 ∪ cun 3881 {csn 4555 {cpr 4557 {ctp 4559 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-tru 1550 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-v 3433 df-un 3888 df-sn 4556 df-pr 4558 df-tp 4560 |
| This theorem is referenced by: en4 9182 ex-pw 30517 |
| Copyright terms: Public domain | W3C validator |