![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > pwssb | 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 3986 | . 2 ⊢ (𝐴 ⊆ 𝒫 𝐵 ↔ ∪ 𝐴 ⊆ 𝐵) | |
2 | unissb 3854 | . 2 ⊢ (∪ 𝐴 ⊆ 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐵) | |
3 | 1, 2 | bitri 184 | 1 ⊢ (𝐴 ⊆ 𝒫 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐵) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 105 ∀wral 2468 ⊆ wss 3144 𝒫 cpw 3590 ∪ cuni 3824 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-ext 2171 |
This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1472 df-sb 1774 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ral 2473 df-v 2754 df-in 3150 df-ss 3157 df-pw 3592 df-uni 3825 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |