| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0er | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| 0er | ⊢ ∅ Er ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rel0 5756 | . 2 ⊢ Rel ∅ | |
| 2 | df-br 5101 | . . 3 ⊢ (𝑥∅𝑦 ↔ 〈𝑥, 𝑦〉 ∈ ∅) | |
| 3 | noel 4292 | . . . 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 4292 | . . . 4 ⊢ ¬ 𝑥 ∈ ∅ | |
| 10 | noel 4292 | . . . 4 ⊢ ¬ 〈𝑥, 𝑥〉 ∈ ∅ | |
| 11 | 9, 10 | 2false 375 | . . 3 ⊢ (𝑥 ∈ ∅ ↔ 〈𝑥, 𝑥〉 ∈ ∅) |
| 12 | df-br 5101 | . . 3 ⊢ (𝑥∅𝑥 ↔ 〈𝑥, 𝑥〉 ∈ ∅) | |
| 13 | 11, 12 | bitr4i 278 | . 2 ⊢ (𝑥 ∈ ∅ ↔ 𝑥∅𝑥) |
| 14 | 1, 5, 8, 13 | iseri 8673 | 1 ⊢ ∅ Er ∅ |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2114 ∅c0 4287 〈cop 4588 class class class wbr 5100 Er wer 8642 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-er 8645 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |