Theorem pwssb 5060

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

This proof depends on syntax axioms:   ↔ wb 209  ∀wral 3076   ⊆ wss 3895  𝒫 cpw 4556  ∪ cuni 4866

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-v 3452  df-ss 3896  df-pw 4558  df-uni 4867

This theorem is used by:  ustuni  24545  metustfbas  24876  intlidl  33970  dmvlsiga  34761  1stmbfm  34892  2ndmbfm  34893  dya2iocucvr  34916  gneispace  45134  preimafvsspwdm  48471  usgrexmpl1lem  49119  usgrexmpl2lem  49124