Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cnveq0 | Structured version Visualization version GIF version |
Description: A relation empty iff its converse is empty. (Contributed by FL, 19-Sep-2011.) |
Ref | Expression |
---|---|
cnveq0 | ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ ◡𝐴 = ∅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cnv0 5454 | . 2 ⊢ ◡∅ = ∅ | |
2 | rel0 5166 | . . . . 5 ⊢ Rel ∅ | |
3 | cnveqb 5508 | . . . . 5 ⊢ ((Rel 𝐴 ∧ Rel ∅) → (𝐴 = ∅ ↔ ◡𝐴 = ◡∅)) | |
4 | 2, 3 | mpan2 703 | . . . 4 ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ ◡𝐴 = ◡∅)) |
5 | eqeq2 2621 | . . . . 5 ⊢ (∅ = ◡∅ → (◡𝐴 = ∅ ↔ ◡𝐴 = ◡∅)) | |
6 | 5 | bibi2d 331 | . . . 4 ⊢ (∅ = ◡∅ → ((𝐴 = ∅ ↔ ◡𝐴 = ∅) ↔ (𝐴 = ∅ ↔ ◡𝐴 = ◡∅))) |
7 | 4, 6 | syl5ibr 235 | . . 3 ⊢ (∅ = ◡∅ → (Rel 𝐴 → (𝐴 = ∅ ↔ ◡𝐴 = ∅))) |
8 | 7 | eqcoms 2618 | . 2 ⊢ (◡∅ = ∅ → (Rel 𝐴 → (𝐴 = ∅ ↔ ◡𝐴 = ∅))) |
9 | 1, 8 | ax-mp 5 | 1 ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ ◡𝐴 = ∅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 = wceq 1475 ∅c0 3874 ◡ccnv 5037 Rel wrel 5043 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-br 4584 df-opab 4644 df-xp 5044 df-rel 5045 df-cnv 5046 |
This theorem is referenced by: elrn3 30906 |
Copyright terms: Public domain | W3C validator |