Theorem 0er 8660

Description: The empty set is an equivalence relation on the empty set. (Contributed by Mario Carneiro, 5-Sep-2015.) (Proof shortened by AV, 1-May-2021.)

Assertion

Ref	Expression
0er	⊢ ∅ Er ∅

Proof of Theorem 0er

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

Step	Hyp	Ref	Expression
1		rel0 5739	. 2 ⊢ Rel ∅
2		df-br 5092	. . 3 ⊢ (𝑥∅𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ ∅)
3		noel 4288	. . . 4 ⊢ ¬ ⟨𝑥, 𝑦⟩ ∈ ∅
4	3	pm2.21i 119	. . 3 ⊢ (⟨𝑥, 𝑦⟩ ∈ ∅ → 𝑦∅𝑥)
5	2, 4	sylbi 217	. 2 ⊢ (𝑥∅𝑦 → 𝑦∅𝑥)
6	3	pm2.21i 119	. . . 4 ⊢ (⟨𝑥, 𝑦⟩ ∈ ∅ → 𝑥∅𝑧)
7	2, 6	sylbi 217	. . 3 ⊢ (𝑥∅𝑦 → 𝑥∅𝑧)
8	7	adantr 480	. 2 ⊢ ((𝑥∅𝑦 ∧ 𝑦∅𝑧) → 𝑥∅𝑧)
9		noel 4288	. . . 4 ⊢ ¬ 𝑥 ∈ ∅
10		noel 4288	. . . 4 ⊢ ¬ ⟨𝑥, 𝑥⟩ ∈ ∅
11	9, 10	2false 375	. . 3 ⊢ (𝑥 ∈ ∅ ↔ ⟨𝑥, 𝑥⟩ ∈ ∅)
12		df-br 5092	. . 3 ⊢ (𝑥∅𝑥 ↔ ⟨𝑥, 𝑥⟩ ∈ ∅)
13	11, 12	bitr4i 278	. 2 ⊢ (𝑥 ∈ ∅ ↔ 𝑥∅𝑥)
14	1, 5, 8, 13	iseri 8649	1 ⊢ ∅ Er ∅

Syntax hints:   ∈ wcel 2111  ∅c0 4283  ⟨cop 4582   class class class wbr 5091   Er wer 8619

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703  ax-sep 5234  ax-nul 5244  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4284  df-if 4476  df-sn 4577  df-pr 4579  df-op 4583  df-br 5092  df-opab 5154  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-er 8622

This theorem is referenced by: (None)