![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > prprc | Structured version Visualization version GIF version |
Description: An unordered pair containing two proper classes is the empty set. (Contributed by NM, 22-Mar-2006.) |
Ref | Expression |
---|---|
prprc | ⊢ ((¬ 𝐴 ∈ V ∧ ¬ 𝐵 ∈ V) → {𝐴, 𝐵} = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prprc1 4727 | . 2 ⊢ (¬ 𝐴 ∈ V → {𝐴, 𝐵} = {𝐵}) | |
2 | snprc 4679 | . . 3 ⊢ (¬ 𝐵 ∈ V ↔ {𝐵} = ∅) | |
3 | 2 | biimpi 215 | . 2 ⊢ (¬ 𝐵 ∈ V → {𝐵} = ∅) |
4 | 1, 3 | sylan9eq 2793 | 1 ⊢ ((¬ 𝐴 ∈ V ∧ ¬ 𝐵 ∈ V) → {𝐴, 𝐵} = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 Vcvv 3444 ∅c0 4283 {csn 4587 {cpr 4589 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-tru 1545 df-fal 1555 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-v 3446 df-dif 3914 df-un 3916 df-nul 4284 df-sn 4588 df-pr 4590 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |