Theorem 0er 8740

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 5776	. 2 ⊢ Rel ∅
2		df-br 5104	. . 3 ⊢ (𝑥∅𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ ∅)
3		noel 4284	. . . 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 4284	. . . 4 ⊢ ¬ 𝑥 ∈ ∅
10		noel 4284	. . . 4 ⊢ ¬ ⟨𝑥, 𝑥⟩ ∈ ∅
11	9, 10	2false 378	. . 3 ⊢ (𝑥 ∈ ∅ ↔ ⟨𝑥, 𝑥⟩ ∈ ∅)
12		df-br 5104	. . 3 ⊢ (𝑥∅𝑥 ↔ ⟨𝑥, 𝑥⟩ ∈ ∅)
13	11, 12	bitr4i 281	. 2 ⊢ (𝑥 ∈ ∅ ↔ 𝑥∅𝑥)
14	1, 5, 8, 13	iseri 8729	1 ⊢ ∅ Er ∅

This proof depends on syntax axioms:   ∈ wcel 2145  ∅c0 4279  ⟨cop 4590   class class class wbr 5103   Er wer 8698

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-er 8701

This theorem is used by: (None)