Theorem pwssb 5067

Description: Two ways to express a collection of subclasses. (Contributed by NM, 19-Jul-2006.)

Assertion

Ref	Expression
pwssb	⊢ (𝐴 ⊆ 𝒫 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐵)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem pwssb

Step	Hyp	Ref	Expression
1		sspwuni 5066	. 2 ⊢ (𝐴 ⊆ 𝒫 𝐵 ↔ ∪ 𝐴 ⊆ 𝐵)
2		unissb 4906	. 2 ⊢ (∪ 𝐴 ⊆ 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐵)
3	1, 2	bitri 278	1 ⊢ (𝐴 ⊆ 𝒫 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐵)

This proof depends on syntax axioms:   ↔ wb 209  ∀wral 3079   ⊆ wss 3905  𝒫 cpw 4562  ∪ cuni 4872

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-v 3457  df-ss 3922  df-pw 4564  df-uni 4873

This theorem is used by:  ustuni  24392  metustfbas  24723  intlidl  33737  dmvlsiga  34528  1stmbfm  34659  2ndmbfm  34660  dya2iocucvr  34683  gneispace  44888  preimafvsspwdm  48166  usgrexmpl1lem  48814  usgrexmpl2lem  48819