Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > uneq12 | Structured version Visualization version GIF version |
Description: Equality theorem for the union of two classes. (Contributed by NM, 29-Mar-1998.) |
Ref | Expression |
---|---|
uneq12 | ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ∪ 𝐶) = (𝐵 ∪ 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uneq1 4134 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ∪ 𝐶) = (𝐵 ∪ 𝐶)) | |
2 | uneq2 4135 | . 2 ⊢ (𝐶 = 𝐷 → (𝐵 ∪ 𝐶) = (𝐵 ∪ 𝐷)) | |
3 | 1, 2 | sylan9eq 2878 | 1 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ∪ 𝐶) = (𝐵 ∪ 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∪ cun 3936 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-v 3498 df-un 3943 |
This theorem is referenced by: uneq12i 4139 uneq12d 4142 un00 4396 opthprc 5618 dmpropg 6074 unixp 6135 fntpg 6416 fnun 6465 resasplit 6550 fvun 6755 rankprb 9282 pm54.43 9431 pwmndgplus 18102 evlseu 20298 ptuncnv 22417 sshjval 29129 bj-2upleq 34326 poimirlem4 34898 poimirlem9 34903 diophun 39377 pwssplit4 39696 clsk1indlem3 40400 |
Copyright terms: Public domain | W3C validator |