Theorem pwssb 5061

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 5060	. 2 ⊢ (𝐴 ⊆ 𝒫 𝐵 ↔ ∪ 𝐴 ⊆ 𝐵)
2		unissb 4901	. 2 ⊢ (∪ 𝐴 ⊆ 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐵)
3	1, 2	bitri 278	1 ⊢ (𝐴 ⊆ 𝒫 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐵)

This proof depends on syntax axioms:   ↔ wb 209  ∀wral 3076   ⊆ wss 3899  𝒫 cpw 4557  ∪ cuni 4867

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-v 3452  df-ss 3916  df-pw 4559  df-uni 4868

This theorem is used by:  ustuni  24484  metustfbas  24815  intlidl  33881  dmvlsiga  34672  1stmbfm  34804  2ndmbfm  34805  dya2iocucvr  34828  gneispace  45039  preimafvsspwdm  48354  usgrexmpl1lem  49002  usgrexmpl2lem  49007