![]() |
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 474 | . 2 ⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → ∪ 𝐴 ⊆ 𝐵) | |
2 | elssuni 4575 | . . 3 ⊢ (𝐵 ∈ 𝐴 → 𝐵 ⊆ ∪ 𝐴) | |
3 | 2 | adantl 473 | . 2 ⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → 𝐵 ⊆ ∪ 𝐴) |
4 | 1, 3 | eqssd 3726 | 1 ⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → ∪ 𝐴 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1596 ∈ wcel 2103 ⊆ wss 3680 ∪ cuni 4544 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1835 ax-4 1850 ax-5 1952 ax-6 2018 ax-7 2054 ax-9 2112 ax-10 2132 ax-11 2147 ax-12 2160 ax-13 2355 ax-ext 2704 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-tru 1599 df-ex 1818 df-nf 1823 df-sb 2011 df-clab 2711 df-cleq 2717 df-clel 2720 df-nfc 2855 df-v 3306 df-in 3687 df-ss 3694 df-uni 4545 |
This theorem is referenced by: elpwuni 4724 mretopd 21019 toponmre 21020 neiptopuni 21057 filunibas 21807 unidmvol 23430 unicls 30179 carsguni 30600 |
Copyright terms: Public domain | W3C validator |