Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  oplecon1b Unicode version

Theorem oplecon1b 29464
Description: Contraposition law for strict ordering in orthoposets. (chsscon1 22082 analog.) (Contributed by NM, 6-Nov-2011.)
Hypotheses
Ref Expression
opcon3.b  |-  B  =  ( Base `  K
)
opcon3.l  |-  .<_  =  ( le `  K )
opcon3.o  |-  ._|_  =  ( oc `  K )
Assertion
Ref Expression
oplecon1b  |-  ( ( K  e.  OP  /\  X  e.  B  /\  Y  e.  B )  ->  ( (  ._|_  `  X
)  .<_  Y  <->  (  ._|_  `  Y )  .<_  X ) )

Proof of Theorem oplecon1b
StepHypRef Expression
1 opcon3.b . . . . 5  |-  B  =  ( Base `  K
)
2 opcon3.o . . . . 5  |-  ._|_  =  ( oc `  K )
31, 2opoccl 29457 . . . 4  |-  ( ( K  e.  OP  /\  X  e.  B )  ->  (  ._|_  `  X )  e.  B )
433adant3 975 . . 3  |-  ( ( K  e.  OP  /\  X  e.  B  /\  Y  e.  B )  ->  (  ._|_  `  X )  e.  B )
5 opcon3.l . . . 4  |-  .<_  =  ( le `  K )
61, 5, 2oplecon3b 29463 . . 3  |-  ( ( K  e.  OP  /\  (  ._|_  `  X )  e.  B  /\  Y  e.  B )  ->  (
(  ._|_  `  X )  .<_  Y  <->  (  ._|_  `  Y
)  .<_  (  ._|_  `  (  ._|_  `  X ) ) ) )
74, 6syld3an2 1229 . 2  |-  ( ( K  e.  OP  /\  X  e.  B  /\  Y  e.  B )  ->  ( (  ._|_  `  X
)  .<_  Y  <->  (  ._|_  `  Y )  .<_  (  ._|_  `  (  ._|_  `  X ) ) ) )
81, 2opococ 29458 . . . 4  |-  ( ( K  e.  OP  /\  X  e.  B )  ->  (  ._|_  `  (  ._|_  `  X ) )  =  X )
983adant3 975 . . 3  |-  ( ( K  e.  OP  /\  X  e.  B  /\  Y  e.  B )  ->  (  ._|_  `  (  ._|_  `  X ) )  =  X )
109breq2d 4037 . 2  |-  ( ( K  e.  OP  /\  X  e.  B  /\  Y  e.  B )  ->  ( (  ._|_  `  Y
)  .<_  (  ._|_  `  (  ._|_  `  X ) )  <-> 
(  ._|_  `  Y )  .<_  X ) )
117, 10bitrd 244 1  |-  ( ( K  e.  OP  /\  X  e.  B  /\  Y  e.  B )  ->  ( (  ._|_  `  X
)  .<_  Y  <->  (  ._|_  `  Y )  .<_  X ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ w3a 934    = wceq 1625    e. wcel 1686   class class class wbr 4025   ` cfv 5257   Basecbs 13150   lecple 13217   occoc 13218   OPcops 29435
This theorem is referenced by:  opoc1  29465  oldmm1  29480
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1535  ax-5 1546  ax-17 1605  ax-9 1637  ax-8 1645  ax-6 1705  ax-7 1710  ax-11 1717  ax-12 1868  ax-ext 2266  ax-nul 4151
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1531  df-nf 1534  df-sb 1632  df-eu 2149  df-clab 2272  df-cleq 2278  df-clel 2281  df-nfc 2410  df-ne 2450  df-ral 2550  df-rex 2551  df-rab 2554  df-v 2792  df-sbc 2994  df-dif 3157  df-un 3159  df-in 3161  df-ss 3168  df-nul 3458  df-if 3568  df-sn 3648  df-pr 3649  df-op 3651  df-uni 3830  df-br 4026  df-iota 5221  df-fv 5265  df-ov 5863  df-oposet 29439
  Copyright terms: Public domain W3C validator