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

Theorem oplecon1b 29317
Description: Contraposition law for strict ordering in orthoposets. (chsscon1 22852 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 29310 . . . 4  |-  ( ( K  e.  OP  /\  X  e.  B )  ->  (  ._|_  `  X )  e.  B )
433adant3 977 . . 3  |-  ( ( K  e.  OP  /\  X  e.  B  /\  Y  e.  B )  ->  (  ._|_  `  X )  e.  B )
5 opcon3.l . . . 4  |-  .<_  =  ( le `  K )
61, 5, 2oplecon3b 29316 . . 3  |-  ( ( K  e.  OP  /\  (  ._|_  `  X )  e.  B  /\  Y  e.  B )  ->  (
(  ._|_  `  X )  .<_  Y  <->  (  ._|_  `  Y
)  .<_  (  ._|_  `  (  ._|_  `  X ) ) ) )
74, 6syld3an2 1231 . 2  |-  ( ( K  e.  OP  /\  X  e.  B  /\  Y  e.  B )  ->  ( (  ._|_  `  X
)  .<_  Y  <->  (  ._|_  `  Y )  .<_  (  ._|_  `  (  ._|_  `  X ) ) ) )
81, 2opococ 29311 . . . 4  |-  ( ( K  e.  OP  /\  X  e.  B )  ->  (  ._|_  `  (  ._|_  `  X ) )  =  X )
983adant3 977 . . 3  |-  ( ( K  e.  OP  /\  X  e.  B  /\  Y  e.  B )  ->  (  ._|_  `  (  ._|_  `  X ) )  =  X )
109breq2d 4166 . 2  |-  ( ( K  e.  OP  /\  X  e.  B  /\  Y  e.  B )  ->  ( (  ._|_  `  Y
)  .<_  (  ._|_  `  (  ._|_  `  X ) )  <-> 
(  ._|_  `  Y )  .<_  X ) )
117, 10bitrd 245 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 177    /\ w3a 936    = wceq 1649    e. wcel 1717   class class class wbr 4154   ` cfv 5395   Basecbs 13397   lecple 13464   occoc 13465   OPcops 29288
This theorem is referenced by:  opoc1  29318  oldmm1  29333
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2369  ax-nul 4280
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2243  df-clab 2375  df-cleq 2381  df-clel 2384  df-nfc 2513  df-ne 2553  df-ral 2655  df-rex 2656  df-rab 2659  df-v 2902  df-sbc 3106  df-dif 3267  df-un 3269  df-in 3271  df-ss 3278  df-nul 3573  df-if 3684  df-sn 3764  df-pr 3765  df-op 3767  df-uni 3959  df-br 4155  df-iota 5359  df-fv 5403  df-ov 6024  df-oposet 29292
  Copyright terms: Public domain W3C validator