Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > socnv | Structured version Visualization version GIF version |
Description: The converse of a strict ordering is still a strict ordering. (Contributed by Scott Fenton, 13-Jun-2018.) |
Ref | Expression |
---|---|
socnv | ⊢ (𝑅 Or 𝐴 → ◡𝑅 Or 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cnvso 6139 | . 2 ⊢ (𝑅 Or 𝐴 ↔ ◡𝑅 Or 𝐴) | |
2 | 1 | biimpi 218 | 1 ⊢ (𝑅 Or 𝐴 → ◡𝑅 Or 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 Or wor 5473 ◡ccnv 5554 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rab 3147 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-br 5067 df-opab 5129 df-po 5474 df-so 5475 df-cnv 5563 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |