| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prprc1 | Structured version Visualization version GIF version | ||
| Description: A proper class vanishes in an unordered pair. (Contributed by NM, 15-Jul-1993.) |
| Ref | Expression |
|---|---|
| prprc1 | ⊢ (¬ 𝐴 ∈ V → {𝐴, 𝐵} = {𝐵}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | snprc 4676 | . 2 ⊢ (¬ 𝐴 ∈ V ↔ {𝐴} = ∅) | |
| 2 | uneq1 4114 | . . 3 ⊢ ({𝐴} = ∅ → ({𝐴} ∪ {𝐵}) = (∅ ∪ {𝐵})) | |
| 3 | df-pr 4585 | . . 3 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
| 4 | uncom 4111 | . . . 4 ⊢ (∅ ∪ {𝐵}) = ({𝐵} ∪ ∅) | |
| 5 | un0 4348 | . . . 4 ⊢ ({𝐵} ∪ ∅) = {𝐵} | |
| 6 | 4, 5 | eqtr2i 2786 | . . 3 ⊢ {𝐵} = (∅ ∪ {𝐵}) |
| 7 | 2, 3, 6 | 3eqtr4g 2822 | . 2 ⊢ ({𝐴} = ∅ → {𝐴, 𝐵} = {𝐵}) |
| 8 | 1, 7 | sylbi 219 | 1 ⊢ (¬ 𝐴 ∈ V → {𝐴, 𝐵} = {𝐵}) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1560 ∈ wcel 2142 Vcvv 3454 ∪ cun 3902 ∅c0 4285 {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: prprc2 4725 prprc 4726 prneprprc 4819 prexOLD 5400 prfi 9268 elprchashprn2 14409 prssbd 32726 elsprel 48078 |
| Copyright terms: Public domain | W3C validator |