| 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 4703 | . 2 ⊢ {𝐴, 𝐵} = {𝐵, 𝐴} | |
| 2 | prprc1 4736 | . 2 ⊢ (¬ 𝐵 ∈ V → {𝐵, 𝐴} = {𝐴}) | |
| 3 | 1, 2 | eqtrid 2816 | 1 ⊢ (¬ 𝐵 ∈ V → {𝐴, 𝐵} = {𝐴}) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1567 ∈ wcel 2149 Vcvv 3463 {csn 4594 {cpr 4596 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-v 3465 df-dif 3916 df-un 3918 df-nul 4295 df-sn 4595 df-pr 4597 |
| This theorem is referenced by: tpprceq3 4776 elpreqprlem 4835 prexOLD 5415 prfi 9282 indislem 23125 1to2vfriswmgr 30570 prssad 32815 indispconn 35624 bj-prmoore 37644 elsprel 48112 |
| Copyright terms: Public domain | W3C validator |