Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > prelpw | Structured version Visualization version GIF version |
Description: A pair of two sets belongs to the power class of a class containing those two sets and vice versa. (Contributed by AV, 8-Jan-2020.) |
Ref | Expression |
---|---|
prelpw | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ↔ {𝐴, 𝐵} ∈ 𝒫 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prssg 4749 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ↔ {𝐴, 𝐵} ⊆ 𝐶)) | |
2 | prex 5350 | . . 3 ⊢ {𝐴, 𝐵} ∈ V | |
3 | 2 | elpw 4534 | . 2 ⊢ ({𝐴, 𝐵} ∈ 𝒫 𝐶 ↔ {𝐴, 𝐵} ⊆ 𝐶) |
4 | 1, 3 | bitr4di 288 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ↔ {𝐴, 𝐵} ∈ 𝒫 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∈ wcel 2108 ⊆ wss 3883 𝒫 cpw 4530 {cpr 4560 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-pw 4532 df-sn 4559 df-pr 4561 |
This theorem is referenced by: prelpwi 5357 hashle2prv 14120 umgrpredgv 27413 prprelb 44856 |
Copyright terms: Public domain | W3C validator |