![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ssunieq | Structured version Visualization version GIF version |
Description: Relationship implying union. (Contributed by NM, 10-Nov-1999.) |
Ref | Expression |
---|---|
ssunieq | ⊢ ((𝐴 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 𝑥 ⊆ 𝐴) → 𝐴 = ∪ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elssuni 4942 | . . 3 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ⊆ ∪ 𝐵) | |
2 | unissb 4944 | . . . 4 ⊢ (∪ 𝐵 ⊆ 𝐴 ↔ ∀𝑥 ∈ 𝐵 𝑥 ⊆ 𝐴) | |
3 | 2 | biimpri 227 | . . 3 ⊢ (∀𝑥 ∈ 𝐵 𝑥 ⊆ 𝐴 → ∪ 𝐵 ⊆ 𝐴) |
4 | 1, 3 | anim12i 614 | . 2 ⊢ ((𝐴 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 𝑥 ⊆ 𝐴) → (𝐴 ⊆ ∪ 𝐵 ∧ ∪ 𝐵 ⊆ 𝐴)) |
5 | eqss 3998 | . 2 ⊢ (𝐴 = ∪ 𝐵 ↔ (𝐴 ⊆ ∪ 𝐵 ∧ ∪ 𝐵 ⊆ 𝐴)) | |
6 | 4, 5 | sylibr 233 | 1 ⊢ ((𝐴 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 𝑥 ⊆ 𝐴) → 𝐴 = ∪ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∀wral 3062 ⊆ wss 3949 ∪ cuni 4909 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 |
This theorem depends on definitions: df-bi 206 df-an 398 df-tru 1545 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-ral 3063 df-v 3477 df-in 3956 df-ss 3966 df-uni 4910 |
This theorem is referenced by: unimax 4949 shsspwh 30499 |
Copyright terms: Public domain | W3C validator |