| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > unissel | Structured version Visualization version GIF version | ||
| Description: Condition turning a subclass relationship for union into an equality. (Contributed by NM, 18-Jul-2006.) |
| Ref | Expression |
|---|---|
| unissel | ⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → ∪ 𝐴 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 483 | . 2 ⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → ∪ 𝐴 ⊆ 𝐵) | |
| 2 | elssuni 4869 | . . 3 ⊢ (𝐵 ∈ 𝐴 → 𝐵 ⊆ ∪ 𝐴) | |
| 3 | 2 | adantl 482 | . 2 ⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → 𝐵 ⊆ ∪ 𝐴) |
| 4 | 1, 3 | eqssd 3932 | 1 ⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → ∪ 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ⊆ wss 3883 ∪ cuni 4838 |
| 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-tru 1550 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-v 3433 df-ss 3900 df-uni 4839 |
| This theorem is referenced by: elpwuni 5034 mretopd 23075 toponmre 23076 neiptopuni 23113 filunibas 23864 unidmvol 25526 unicls 34087 carsguni 34492 onintunirab 43672 |
| Copyright terms: Public domain | W3C validator |