| 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 487 | . 2 ⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → ∪ 𝐴 ⊆ 𝐵) | |
| 2 | elssuni 4908 | . . 3 ⊢ (𝐵 ∈ 𝐴 → 𝐵 ⊆ ∪ 𝐴) | |
| 3 | 2 | adantl 486 | . 2 ⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → 𝐵 ⊆ ∪ 𝐴) |
| 4 | 1, 3 | eqssd 3962 | 1 ⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → ∪ 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ⊆ wss 3913 ∪ cuni 4876 |
| 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-tru 1570 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-v 3465 df-ss 3930 df-uni 4877 |
| This theorem is referenced by: elpwuni 5075 mretopd 23218 toponmre 23219 neiptopuni 23256 filunibas 24007 unidmvol 25669 unicls 34238 carsguni 34643 onintunirab 43846 |
| Copyright terms: Public domain | W3C validator |