| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prprc2 | Structured version Visualization version GIF version | ||
| Description: A proper class vanishes in an unordered pair. (Contributed by NM, 22-Mar-2006.) |
| Ref | Expression |
|---|---|
| prprc2 | ⊢ (¬ 𝐵 ∈ V → {𝐴, 𝐵} = {𝐴}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prcom 4687 | . 2 ⊢ {𝐴, 𝐵} = {𝐵, 𝐴} | |
| 2 | prprc1 4720 | . 2 ⊢ (¬ 𝐵 ∈ V → {𝐵, 𝐴} = {𝐴}) | |
| 3 | 1, 2 | eqtrid 2781 | 1 ⊢ (¬ 𝐵 ∈ V → {𝐴, 𝐵} = {𝐴}) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1541 ∈ wcel 2113 Vcvv 3438 {csn 4578 {cpr 4580 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-v 3440 df-dif 3902 df-un 3904 df-nul 4284 df-sn 4579 df-pr 4581 |
| This theorem is referenced by: tpprceq3 4758 elpreqprlem 4820 prex 5380 prfi 9222 indislem 22942 1to2vfriswmgr 30303 prssad 32553 indispconn 35377 bj-prmoore 37259 elsprel 47663 |
| Copyright terms: Public domain | W3C validator |