ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cnvsom Unicode version

Theorem cnvsom 5280
Description: The converse of a strict order relation is a strict order relation. (Contributed by Jim Kingdon, 19-Dec-2018.)
Assertion
Ref Expression
cnvsom  |-  ( E. x  x  e.  A  ->  ( R  Or  A  <->  `' R  Or  A ) )
Distinct variable groups:    x, A    x, R

Proof of Theorem cnvsom
Dummy variables  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnvpom 5279 . . 3  |-  ( E. x  x  e.  A  ->  ( R  Po  A  <->  `' R  Po  A ) )
2 vex 2805 . . . . . . . . 9  |-  y  e. 
_V
3 vex 2805 . . . . . . . . 9  |-  x  e. 
_V
42, 3brcnv 4913 . . . . . . . 8  |-  ( y `' R x  <->  x R
y )
5 vex 2805 . . . . . . . . . . 11  |-  z  e. 
_V
62, 5brcnv 4913 . . . . . . . . . 10  |-  ( y `' R z  <->  z R
y )
75, 3brcnv 4913 . . . . . . . . . 10  |-  ( z `' R x  <->  x R
z )
86, 7orbi12i 771 . . . . . . . . 9  |-  ( ( y `' R z  \/  z `' R x )  <->  ( z R y  \/  x R z ) )
9 orcom 735 . . . . . . . . 9  |-  ( ( z R y  \/  x R z )  <-> 
( x R z  \/  z R y ) )
108, 9bitri 184 . . . . . . . 8  |-  ( ( y `' R z  \/  z `' R x )  <->  ( x R z  \/  z R y ) )
114, 10imbi12i 239 . . . . . . 7  |-  ( ( y `' R x  ->  ( y `' R z  \/  z `' R x ) )  <-> 
( x R y  ->  ( x R z  \/  z R y ) ) )
1211ralbii 2538 . . . . . 6  |-  ( A. z  e.  A  (
y `' R x  ->  ( y `' R z  \/  z `' R x ) )  <->  A. z  e.  A  ( x R y  ->  ( x R z  \/  z R y ) ) )
13122ralbii 2540 . . . . 5  |-  ( A. x  e.  A  A. y  e.  A  A. z  e.  A  (
y `' R x  ->  ( y `' R z  \/  z `' R x ) )  <->  A. x  e.  A  A. y  e.  A  A. z  e.  A  ( x R y  ->  ( x R z  \/  z R y ) ) )
14 ralcom 2696 . . . . 5  |-  ( A. x  e.  A  A. y  e.  A  A. z  e.  A  (
y `' R x  ->  ( y `' R z  \/  z `' R x ) )  <->  A. y  e.  A  A. x  e.  A  A. z  e.  A  ( y `' R x  ->  ( y `' R z  \/  z `' R x ) ) )
1513, 14bitr3i 186 . . . 4  |-  ( A. x  e.  A  A. y  e.  A  A. z  e.  A  (
x R y  -> 
( x R z  \/  z R y ) )  <->  A. y  e.  A  A. x  e.  A  A. z  e.  A  ( y `' R x  ->  (
y `' R z  \/  z `' R x ) ) )
1615a1i 9 . . 3  |-  ( E. x  x  e.  A  ->  ( A. x  e.  A  A. y  e.  A  A. z  e.  A  ( x R y  ->  ( x R z  \/  z R y ) )  <->  A. y  e.  A  A. x  e.  A  A. z  e.  A  ( y `' R x  ->  ( y `' R z  \/  z `' R x ) ) ) )
171, 16anbi12d 473 . 2  |-  ( E. x  x  e.  A  ->  ( ( R  Po  A  /\  A. x  e.  A  A. y  e.  A  A. z  e.  A  ( x R y  ->  ( x R z  \/  z R y ) ) )  <->  ( `' R  Po  A  /\  A. y  e.  A  A. x  e.  A  A. z  e.  A  ( y `' R x  ->  (
y `' R z  \/  z `' R x ) ) ) ) )
18 df-iso 4394 . 2  |-  ( R  Or  A  <->  ( R  Po  A  /\  A. x  e.  A  A. y  e.  A  A. z  e.  A  ( x R y  ->  (
x R z  \/  z R y ) ) ) )
19 df-iso 4394 . 2  |-  ( `' R  Or  A  <->  ( `' R  Po  A  /\  A. y  e.  A  A. x  e.  A  A. z  e.  A  (
y `' R x  ->  ( y `' R z  \/  z `' R x ) ) ) )
2017, 18, 193bitr4g 223 1  |-  ( E. x  x  e.  A  ->  ( R  Or  A  <->  `' R  Or  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 715   E.wex 1540    e. wcel 2202   A.wral 2510   class class class wbr 4088    Po wpo 4391    Or wor 4392   `'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-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-po 4393  df-iso 4394  df-cnv 4733
This theorem is referenced by:  gtso  8257
  Copyright terms: Public domain W3C validator