| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cnv0 | GIF version | ||
| Description: The converse of the empty set. (Contributed by NM, 6-Apr-1998.) |
| Ref | Expression |
|---|---|
| cnv0 | ⊢ ◡∅ = ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relcnv 5114 | . 2 ⊢ Rel ◡∅ | |
| 2 | rel0 4852 | . 2 ⊢ Rel ∅ | |
| 3 | vex 2805 | . . . 4 ⊢ 𝑥 ∈ V | |
| 4 | vex 2805 | . . . 4 ⊢ 𝑦 ∈ V | |
| 5 | 3, 4 | opelcnv 4912 | . . 3 ⊢ (〈𝑥, 𝑦〉 ∈ ◡∅ ↔ 〈𝑦, 𝑥〉 ∈ ∅) |
| 6 | noel 3498 | . . . 4 ⊢ ¬ 〈𝑥, 𝑦〉 ∈ ∅ | |
| 7 | noel 3498 | . . . 4 ⊢ ¬ 〈𝑦, 𝑥〉 ∈ ∅ | |
| 8 | 6, 7 | 2false 708 | . . 3 ⊢ (〈𝑥, 𝑦〉 ∈ ∅ ↔ 〈𝑦, 𝑥〉 ∈ ∅) |
| 9 | 5, 8 | bitr4i 187 | . 2 ⊢ (〈𝑥, 𝑦〉 ∈ ◡∅ ↔ 〈𝑥, 𝑦〉 ∈ ∅) |
| 10 | 1, 2, 9 | eqrelriiv 4820 | 1 ⊢ ◡∅ = ∅ |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1397 ∈ wcel 2202 ∅c0 3494 〈cop 3672 ◡ccnv 4724 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-v 2804 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-br 4089 df-opab 4151 df-xp 4731 df-rel 4732 df-cnv 4733 |
| This theorem is referenced by: xp0 5156 cnveq0 5193 co01 5251 f10 5618 f1o00 5620 tpos0 6439 |
| Copyright terms: Public domain | W3C validator |