MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  0er Structured version   Visualization version   GIF version

Theorem 0er 8721
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.
StepHypRef Expression
1 rel0 5776 . 2 Rel ∅
2 df-br 5106 . . 3 (𝑥𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ ∅)
3 noel 4293 . . . 4 ¬ ⟨𝑥, 𝑦⟩ ∈ ∅
43pm2.21i 120 . . 3 (⟨𝑥, 𝑦⟩ ∈ ∅ → 𝑦𝑥)
52, 4sylbi 220 . 2 (𝑥𝑦𝑦𝑥)
63pm2.21i 120 . . . 4 (⟨𝑥, 𝑦⟩ ∈ ∅ → 𝑥𝑧)
72, 6sylbi 220 . . 3 (𝑥𝑦𝑥𝑧)
87adantr 485 . 2 ((𝑥𝑦𝑦𝑧) → 𝑥𝑧)
9 noel 4293 . . . 4 ¬ 𝑥 ∈ ∅
10 noel 4293 . . . 4 ¬ ⟨𝑥, 𝑥⟩ ∈ ∅
119, 102false 378 . . 3 (𝑥 ∈ ∅ ↔ ⟨𝑥, 𝑥⟩ ∈ ∅)
12 df-br 5106 . . 3 (𝑥𝑥 ↔ ⟨𝑥, 𝑥⟩ ∈ ∅)
1311, 12bitr4i 281 . 2 (𝑥 ∈ ∅ ↔ 𝑥𝑥)
141, 5, 8, 13iseri 8710 1 ∅ Er ∅
Colors of variables: wff setvar class
Syntax hints:  wcel 2145  c0 4288  cop 4591   class class class wbr 5105   Er wer 8679
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737  ax-sep 5251  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-br 5106  df-opab 5168  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-er 8682
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator