| 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 4691 | . 2 ⊢ {𝐴, 𝐵} = {𝐵, 𝐴} | |
| 2 | prprc1 4724 | . 2 ⊢ (¬ 𝐵 ∈ V → {𝐵, 𝐴} = {𝐴}) | |
| 3 | 1, 2 | eqtrid 2809 | 1 ⊢ (¬ 𝐵 ∈ V → {𝐴, 𝐵} = {𝐴}) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1560 ∈ wcel 2142 Vcvv 3454 {csn 4582 {cpr 4584 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1563 df-fal 1573 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-v 3456 df-dif 3907 df-un 3909 df-nul 4286 df-sn 4583 df-pr 4585 |
| This theorem is referenced by: tpprceq3 4764 elpreqprlem 4824 prexOLD 5400 prfi 9268 indislem 23057 1to2vfriswmgr 30478 prssad 32725 indispconn 35581 bj-prmoore 37602 elsprel 48078 |
| Copyright terms: Public domain | W3C validator |