| 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 4699 | . 2 ⊢ {𝐴, 𝐵} = {𝐵, 𝐴} | |
| 2 | prprc1 4732 | . 2 ⊢ (¬ 𝐵 ∈ V → {𝐵, 𝐴} = {𝐴}) | |
| 3 | 1, 2 | eqtrid 2777 | 1 ⊢ (¬ 𝐵 ∈ V → {𝐴, 𝐵} = {𝐴}) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1540 ∈ wcel 2109 Vcvv 3450 {csn 4592 {cpr 4594 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2702 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-v 3452 df-dif 3920 df-un 3922 df-nul 4300 df-sn 4593 df-pr 4595 |
| This theorem is referenced by: tpprceq3 4771 elpreqprlem 4833 prex 5395 prfi 9281 indislem 22894 1to2vfriswmgr 30215 prssad 32465 indispconn 35228 bj-prmoore 37110 elsprel 47480 |
| Copyright terms: Public domain | W3C validator |