Theorem prprc 3776

Description: An unordered pair containing two proper classes is the empty set. (Contributed by NM, 22-Mar-2006.)

Assertion

Ref	Expression
prprc	⊢ ((¬ 𝐴 ∈ V ∧ ¬ 𝐵 ∈ V) → {𝐴, 𝐵} = ∅)

Proof of Theorem prprc

Step	Hyp	Ref	Expression
1		prprc1 3774	. 2 ⊢ (¬ 𝐴 ∈ V → {𝐴, 𝐵} = {𝐵})
2		snprc 3731	. . 3 ⊢ (¬ 𝐵 ∈ V ↔ {𝐵} = ∅)
3	2	biimpi 120	. 2 ⊢ (¬ 𝐵 ∈ V → {𝐵} = ∅)
4	1, 3	sylan9eq 2282	1 ⊢ ((¬ 𝐴 ∈ V ∧ ¬ 𝐵 ∈ V) → {𝐴, 𝐵} = ∅)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   = wceq 1395   ∈ wcel 2200  Vcvv 2799  ∅c0 3491  {csn 3666  {cpr 3667

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-v 2801  df-dif 3199  df-un 3201  df-nul 3492  df-sn 3672  df-pr 3673

This theorem is referenced by: (None)