Theorem 0nelxp 4567

Description: The empty set is not a member of a cross product. (Contributed by NM, 2-May-1996.) (Revised by Mario Carneiro, 26-Apr-2015.)

Assertion

Ref	Expression
0nelxp	⊢ ¬ ∅ ∈ (𝐴 × 𝐵)

Proof of Theorem 0nelxp

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 2689	. . . . . 6 ⊢ 𝑥 ∈ V
2		vex 2689	. . . . . 6 ⊢ 𝑦 ∈ V
3	1, 2	opnzi 4157	. . . . 5 ⊢ ⟨𝑥, 𝑦⟩ ≠ ∅
4		simpl 108	. . . . . . 7 ⊢ ((∅ = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ∅ = ⟨𝑥, 𝑦⟩)
5	4	eqcomd 2145	. . . . . 6 ⊢ ((∅ = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ⟨𝑥, 𝑦⟩ = ∅)
6	5	necon3ai 2357	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ≠ ∅ → ¬ (∅ = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
7	3, 6	ax-mp 5	. . . 4 ⊢ ¬ (∅ = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
8	7	nex 1476	. . 3 ⊢ ¬ ∃𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
9	8	nex 1476	. 2 ⊢ ¬ ∃𝑥∃𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
10		elxp 4556	. 2 ⊢ (∅ ∈ (𝐴 × 𝐵) ↔ ∃𝑥∃𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
11	9, 10	mtbir 660	1 ⊢ ¬ ∅ ∈ (𝐴 × 𝐵)

Syntax hints:  ¬ wn 3   ∧ wa 103   = wceq 1331  ∃wex 1468   ∈ wcel 1480   ≠ wne 2308  ∅c0 3363  ⟨cop 3530   × cxp 4537

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-v 2688  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-opab 3990  df-xp 4545

This theorem is referenced by:  0nelrel  4585  dmsn0  5006  nfunv  5156  reldmtpos  6150  dmtpos  6153  0ncn  7646  structcnvcnv  11985