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

Theorem 0er 8734
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 5787 . 2 Rel ∅
2 df-br 5111 . . 3 (𝑥𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ ∅)
3 noel 4292 . . . 4 ¬ ⟨𝑥, 𝑦⟩ ∈ ∅
43pm2.21i 120 . . 3 (⟨𝑥, 𝑦⟩ ∈ ∅ → 𝑦𝑥)
52, 4sylbi 220 . 2 (𝑥𝑦𝑦𝑥)
63pm2.21i 120 . . . 4 (⟨𝑥, 𝑦⟩ ∈ ∅ → 𝑥𝑧)
72, 6sylbi 220 . . 3 (𝑥𝑦𝑥𝑧)
87adantr 485 . 2 ((𝑥𝑦𝑦𝑧) → 𝑥𝑧)
9 noel 4292 . . . 4 ¬ 𝑥 ∈ ∅
10 noel 4292 . . . 4 ¬ ⟨𝑥, 𝑥⟩ ∈ ∅
119, 102false 378 . . 3 (𝑥 ∈ ∅ ↔ ⟨𝑥, 𝑥⟩ ∈ ∅)
12 df-br 5111 . . 3 (𝑥𝑥 ↔ ⟨𝑥, 𝑥⟩ ∈ ∅)
1311, 12bitr4i 281 . 2 (𝑥 ∈ ∅ ↔ 𝑥𝑥)
141, 5, 8, 13iseri 8723 1 ∅ Er ∅
Colors of variables: wff setvar class
Syntax hints:  wcel 2143  c0 4287  cop 4596   class class class wbr 5110   Er wer 8692
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5258  ax-pr 5406
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-br 5111  df-opab 5175  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-er 8695
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator