| 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 5787 | . 2 ⊢ Rel ∅ | |
| 2 | df-br 5111 | . . 3 ⊢ (𝑥∅𝑦 ↔ 〈𝑥, 𝑦〉 ∈ ∅) | |
| 3 | noel 4292 | . . . 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 485 | . 2 ⊢ ((𝑥∅𝑦 ∧ 𝑦∅𝑧) → 𝑥∅𝑧) |
| 9 | noel 4292 | . . . 4 ⊢ ¬ 𝑥 ∈ ∅ | |
| 10 | noel 4292 | . . . 4 ⊢ ¬ 〈𝑥, 𝑥〉 ∈ ∅ | |
| 11 | 9, 10 | 2false 378 | . . 3 ⊢ (𝑥 ∈ ∅ ↔ 〈𝑥, 𝑥〉 ∈ ∅) |
| 12 | df-br 5111 | . . 3 ⊢ (𝑥∅𝑥 ↔ 〈𝑥, 𝑥〉 ∈ ∅) | |
| 13 | 11, 12 | bitr4i 281 | . 2 ⊢ (𝑥 ∈ ∅ ↔ 𝑥∅𝑥) |
| 14 | 1, 5, 8, 13 | iseri 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 |