| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pwssb | Structured version Visualization version GIF version | ||
| Description: Two ways to express a collection of subclasses. (Contributed by NM, 19-Jul-2006.) |
| Ref | Expression |
|---|---|
| pwssb | ⊢ (𝐴 ⊆ 𝒫 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sspwuni 5058 | . 2 ⊢ (𝐴 ⊆ 𝒫 𝐵 ↔ ∪ 𝐴 ⊆ 𝐵) | |
| 2 | unissb 4900 | . 2 ⊢ (∪ 𝐴 ⊆ 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐵) | |
| 3 | 1, 2 | bitri 277 | 1 ⊢ (𝐴 ⊆ 𝒫 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∀wral 3077 ⊆ wss 3905 𝒫 cpw 4556 ∪ cuni 4866 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1564 df-ex 1801 df-sb 2092 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3078 df-v 3457 df-ss 3922 df-pw 4558 df-uni 4867 |
| This theorem is referenced by: ustuni 24287 metustfbas 24618 intlidl 33607 dmvlsiga 34427 1stmbfm 34558 2ndmbfm 34559 dya2iocucvr 34582 gneispace 44711 preimafvsspwdm 47996 usgrexmpl1lem 48644 usgrexmpl2lem 48649 |
| Copyright terms: Public domain | W3C validator |