| 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 4123 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ∪ 𝐶) = (𝐵 ∪ 𝐶)) | |
| 2 | uneq2 4124 | . 2 ⊢ (𝐶 = 𝐷 → (𝐵 ∪ 𝐶) = (𝐵 ∪ 𝐷)) | |
| 3 | 1, 2 | sylan9eq 2824 | 1 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ∪ 𝐶) = (𝐵 ∪ 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∪ cun 3911 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1570 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-v 3465 df-un 3918 |
| This theorem is referenced by: uneq12i 4128 uneq12d 4131 un00 4408 opthprc 5723 dmpropg 6213 unixp 6280 fntpg 6593 fnun 6647 resasplit 6746 fvun 6969 rankprb 9819 pm54.43 9983 pwmndgplus 18993 evlseu 22199 ptuncnv 23929 sshjval 31639 bj-2upleq 37532 bj-unexg 37558 poimirlem4 38158 poimirlem9 38163 evlselvlem 43205 diophun 43389 pwssplit4 43701 clsk1indlem3 44654 |
| Copyright terms: Public domain | W3C validator |