| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnvsn0 | Structured version Visualization version GIF version | ||
| Description: The converse of the singleton of the empty set is empty. (Contributed by Mario Carneiro, 30-Aug-2015.) |
| Ref | Expression |
|---|---|
| cnvsn0 | ⊢ ◡{∅} = ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfdm4 5889 | . . 3 ⊢ dom {∅} = ran ◡{∅} | |
| 2 | dmsn0 6229 | . . 3 ⊢ dom {∅} = ∅ | |
| 3 | 1, 2 | eqtr3i 2788 | . 2 ⊢ ran ◡{∅} = ∅ |
| 4 | relcnv 6118 | . . 3 ⊢ Rel ◡{∅} | |
| 5 | relrn0 5967 | . . 3 ⊢ (Rel ◡{∅} → (◡{∅} = ∅ ↔ ran ◡{∅} = ∅)) | |
| 6 | 4, 5 | ax-mp 5 | . 2 ⊢ (◡{∅} = ∅ ↔ ran ◡{∅} = ∅) |
| 7 | 3, 6 | mpbir 234 | 1 ⊢ ◡{∅} = ∅ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 ∅c0 4281 {csn 4588 ◡ccnv 5657 dom cdm 5658 ran crn 5659 Rel wrel 5663 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5255 ax-pr 5398 |
| 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 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-br 5109 df-opab 5174 df-xp 5664 df-rel 5665 df-cnv 5666 df-dm 5668 df-rn 5669 |
| This theorem is used by: opswap 6249 brtpos0 8288 tpostpos 8301 dftpos5 50379 |
| Copyright terms: Public domain | W3C validator |