Theorem cnv0 5868

Description: The converse of the empty set. (Contributed by NM, 6-Apr-1998.) Remove dependency on ax-sep 5256, ax-nul 5268, ax-pr 5403. (Revised by KP, 25-Oct-2021.) Avoid ax-12 2212. (Revised by TM, 31-Jan-2026.)

Assertion

Ref	Expression
cnv0	⊢ ◡∅ = ∅

Proof of Theorem cnv0

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

Step	Hyp	Ref	Expression
1		br0 5159	. . . . . 6 ⊢ ¬ 𝑦∅𝑧
2	1	intnan 491	. . . . 5 ⊢ ¬ (𝑥 = ⟨𝑧, 𝑦⟩ ∧ 𝑦∅𝑧)
3	2	nex 1829	. . . 4 ⊢ ¬ ∃𝑦(𝑥 = ⟨𝑧, 𝑦⟩ ∧ 𝑦∅𝑧)
4	3	nex 1829	. . 3 ⊢ ¬ ∃𝑧∃𝑦(𝑥 = ⟨𝑧, 𝑦⟩ ∧ 𝑦∅𝑧)
5		df-cnv 5668	. . . . 5 ⊢ ◡∅ = {⟨𝑧, 𝑦⟩ ∣ 𝑦∅𝑧}
6	5	eleq2i 2854	. . . 4 ⊢ (𝑥 ∈ ◡∅ ↔ 𝑥 ∈ {⟨𝑧, 𝑦⟩ ∣ 𝑦∅𝑧})
7		elopabw 5509	. . . . 5 ⊢ (𝑥 ∈ V → (𝑥 ∈ {⟨𝑧, 𝑦⟩ ∣ 𝑦∅𝑧} ↔ ∃𝑧∃𝑦(𝑥 = ⟨𝑧, 𝑦⟩ ∧ 𝑦∅𝑧)))
8	7	elv 3459	. . . 4 ⊢ (𝑥 ∈ {⟨𝑧, 𝑦⟩ ∣ 𝑦∅𝑧} ↔ ∃𝑧∃𝑦(𝑥 = ⟨𝑧, 𝑦⟩ ∧ 𝑦∅𝑧))
9	6, 8	bitri 278	. . 3 ⊢ (𝑥 ∈ ◡∅ ↔ ∃𝑧∃𝑦(𝑥 = ⟨𝑧, 𝑦⟩ ∧ 𝑦∅𝑧))
10	4, 9	mtbir 326	. 2 ⊢ ¬ 𝑥 ∈ ◡∅
11	10	nel0 4308	1 ⊢ ◡∅ = ∅

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 400   = wceq 1569  ∃wex 1808   ∈ wcel 2142  Vcvv 3454  ∅c0 4285  ⟨cop 4594   class class class wbr 5108  {copab 5172  ^◡ccnv 5659

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3456  df-dif 3907  df-nul 4286  df-br 5109  df-opab 5173  df-cnv 5668

This theorem is used by:  csbcnv  5871  xp0OLD  6154  cnveq0  6195  co01  6262  funcnv0  6602  f1o00  6856  tpos0  8250  cnvfi  9158  oduleval  18351  ust0  24388  nghmfval  24890  isnghm  24891  1pthdlem1  30497  mptiffisupp  33049  tocycf  33446  tocyc01  33447  vieta  33979  mthmval  36075  resnonrel  44346  cononrel1  44348  cononrel2  44349  cnvrcl0  44379  0cnf  46619