| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rabswap | Structured version Visualization version GIF version | ||
| Description: Swap with a membership relation in a restricted class abstraction. (Contributed by NM, 4-Jul-2005.) |
| Ref | Expression |
|---|---|
| rabswap | ⊢ {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} = {𝑥 ∈ 𝐵 ∣ 𝑥 ∈ 𝐴} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ancom 464 | . 2 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴)) | |
| 2 | 1 | rabbia2 3419 | 1 ⊢ {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝐵} = {𝑥 ∈ 𝐵 ∣ 𝑥 ∈ 𝐴} |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1562 ∈ wcel 2144 {crab 3416 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-9 2154 ax-ext 2736 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1565 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-rab 3417 |
| This theorem is referenced by: incom 4163 |
| Copyright terms: Public domain | W3C validator |