| 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 5070 | . 2 ⊢ (𝐴 ⊆ 𝒫 𝐵 ↔ ∪ 𝐴 ⊆ 𝐵) | |
| 2 | unissb 4910 | . 2 ⊢ (∪ 𝐴 ⊆ 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐵) | |
| 3 | 1, 2 | bitri 278 | 1 ⊢ (𝐴 ⊆ 𝒫 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∀wral 3085 ⊆ wss 3913 𝒫 cpw 4567 ∪ 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-ral 3086 df-v 3465 df-ss 3930 df-pw 4569 df-uni 4877 |
| This theorem is referenced by: ustuni 24352 metustfbas 24683 intlidl 33672 dmvlsiga 34464 1stmbfm 34595 2ndmbfm 34596 dya2iocucvr 34619 gneispace 44786 preimafvsspwdm 48061 usgrexmpl1lem 48709 usgrexmpl2lem 48714 |
| Copyright terms: Public domain | W3C validator |