Theorem 0er 8759

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 5775	. 2 ⊢ Rel ∅
2		df-br 5103	. . 3 ⊢ (𝑥∅𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ ∅)
3		noel 4283	. . . 4 ⊢ ¬ ⟨𝑥, 𝑦⟩ ∈ ∅
4	3	pm2.21i 120	. . 3 ⊢ (⟨𝑥, 𝑦⟩ ∈ ∅ → 𝑦∅𝑥)
5	2, 4	sylbi 220	. 2 ⊢ (𝑥∅𝑦 → 𝑦∅𝑥)
6	3	pm2.21i 120	. . . 4 ⊢ (⟨𝑥, 𝑦⟩ ∈ ∅ → 𝑥∅𝑧)
7	2, 6	sylbi 220	. . 3 ⊢ (𝑥∅𝑦 → 𝑥∅𝑧)
8	7	adantr 486	. 2 ⊢ ((𝑥∅𝑦 ∧ 𝑦∅𝑧) → 𝑥∅𝑧)
9		noel 4283	. . . 4 ⊢ ¬ 𝑥 ∈ ∅
10		noel 4283	. . . 4 ⊢ ¬ ⟨𝑥, 𝑥⟩ ∈ ∅
11	9, 10	2false 378	. . 3 ⊢ (𝑥 ∈ ∅ ↔ ⟨𝑥, 𝑥⟩ ∈ ∅)
12		df-br 5103	. . 3 ⊢ (𝑥∅𝑥 ↔ ⟨𝑥, 𝑥⟩ ∈ ∅)
13	11, 12	bitr4i 281	. 2 ⊢ (𝑥 ∈ ∅ ↔ 𝑥∅𝑥)
14	1, 5, 8, 13	iseri 8748	1 ⊢ ∅ Er ∅

This proof depends on syntax axioms:   ∈ wcel 2144  ∅c0 4278  ⟨cop 4834   class class class wbr 5102   Er wer 8717

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-er 8720

This theorem is used by: (None)