Theorem prelpw 5457

Description: An unordered pair of two sets is a member of the powerclass of a class if and only if the two sets are members of that class. (Contributed by AV, 8-Jan-2020.)

Assertion

Ref	Expression
prelpw	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ↔ {𝐴, 𝐵} ∈ 𝒫 𝐶))

Proof of Theorem prelpw

Step	Hyp	Ref	Expression
1		prssg 4824	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ↔ {𝐴, 𝐵} ⊆ 𝐶))
2		prex 5443	. . 3 ⊢ {𝐴, 𝐵} ∈ V
3	2	elpw 4609	. 2 ⊢ ({𝐴, 𝐵} ∈ 𝒫 𝐶 ↔ {𝐴, 𝐵} ⊆ 𝐶)
4	1, 3	bitr4di 289	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ↔ {𝐴, 𝐵} ∈ 𝒫 𝐶))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∈ wcel 2106   ⊆ wss 3963  𝒫 cpw 4605  {cpr 4633

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-v 3480  df-dif 3966  df-un 3968  df-ss 3980  df-nul 4340  df-pw 4607  df-sn 4632  df-pr 4634

This theorem is referenced by:  prelpwi  5458  hashle2prv  14514  umgrpredgv  29172  prprelb  47441