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 5757 | . . 3 ⊢ dom {∅} = ran ◡{∅} | |
2 | dmsn0 6059 | . . 3 ⊢ dom {∅} = ∅ | |
3 | 1, 2 | eqtr3i 2844 | . 2 ⊢ ran ◡{∅} = ∅ |
4 | relcnv 5960 | . . 3 ⊢ Rel ◡{∅} | |
5 | relrn0 5833 | . . 3 ⊢ (Rel ◡{∅} → (◡{∅} = ∅ ↔ ran ◡{∅} = ∅)) | |
6 | 4, 5 | ax-mp 5 | . 2 ⊢ (◡{∅} = ∅ ↔ ran ◡{∅} = ∅) |
7 | 3, 6 | mpbir 233 | 1 ⊢ ◡{∅} = ∅ |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 = wceq 1531 ∅c0 4289 {csn 4559 ◡ccnv 5547 dom cdm 5548 ran crn 5549 Rel wrel 5553 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1905 ax-6 1964 ax-7 2009 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2154 ax-12 2170 ax-ext 2791 ax-sep 5194 ax-nul 5201 ax-pr 5320 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1084 df-tru 1534 df-ex 1775 df-nf 1779 df-sb 2064 df-mo 2616 df-eu 2648 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-ne 3015 df-rab 3145 df-v 3495 df-dif 3937 df-un 3939 df-in 3941 df-ss 3950 df-nul 4290 df-if 4466 df-sn 4560 df-pr 4562 df-op 4566 df-br 5058 df-opab 5120 df-xp 5554 df-rel 5555 df-cnv 5556 df-dm 5558 df-rn 5559 |
This theorem is referenced by: opswap 6079 brtpos0 7891 tpostpos 7904 |
Copyright terms: Public domain | W3C validator |