Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > uneqri | Structured version Visualization version GIF version |
Description: Inference from membership to union. (Contributed by NM, 21-Jun-1993.) |
Ref | Expression |
---|---|
uneqri.1 | ⊢ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ↔ 𝑥 ∈ 𝐶) |
Ref | Expression |
---|---|
uneqri | ⊢ (𝐴 ∪ 𝐵) = 𝐶 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elun 3715 | . . 3 ⊢ (𝑥 ∈ (𝐴 ∪ 𝐵) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵)) | |
2 | uneqri.1 | . . 3 ⊢ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ↔ 𝑥 ∈ 𝐶) | |
3 | 1, 2 | bitri 263 | . 2 ⊢ (𝑥 ∈ (𝐴 ∪ 𝐵) ↔ 𝑥 ∈ 𝐶) |
4 | 3 | eqriv 2607 | 1 ⊢ (𝐴 ∪ 𝐵) = 𝐶 |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 195 ∨ wo 382 = wceq 1475 ∈ wcel 1977 ∪ cun 3538 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-v 3175 df-un 3545 |
This theorem is referenced by: unidm 3718 uncom 3719 unass 3732 dfun2 3821 undi 3833 unab 3853 un0 3919 inundif 3998 |
Copyright terms: Public domain | W3C validator |