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

Theorem opexmid 29323
Description: Law of excluded middle for orthoposets. (chjo 22866 analog.) (Contributed by NM, 13-Sep-2011.)
Hypotheses
Ref Expression
opexmid.b  |-  B  =  ( Base `  K
)
opexmid.o  |-  ._|_  =  ( oc `  K )
opexmid.j  |-  .\/  =  ( join `  K )
opexmid.u  |-  .1.  =  ( 1. `  K )
Assertion
Ref Expression
opexmid  |-  ( ( K  e.  OP  /\  X  e.  B )  ->  ( X  .\/  (  ._|_  `  X ) )  =  .1.  )

Proof of Theorem opexmid
StepHypRef Expression
1 opexmid.b . . . 4  |-  B  =  ( Base `  K
)
2 eqid 2388 . . . 4  |-  ( le
`  K )  =  ( le `  K
)
3 opexmid.o . . . 4  |-  ._|_  =  ( oc `  K )
4 opexmid.j . . . 4  |-  .\/  =  ( join `  K )
5 eqid 2388 . . . 4  |-  ( meet `  K )  =  (
meet `  K )
6 eqid 2388 . . . 4  |-  ( 0.
`  K )  =  ( 0. `  K
)
7 opexmid.u . . . 4  |-  .1.  =  ( 1. `  K )
81, 2, 3, 4, 5, 6, 7oposlem 29299 . . 3  |-  ( ( K  e.  OP  /\  X  e.  B  /\  X  e.  B )  ->  ( ( (  ._|_  `  X )  e.  B  /\  (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  ( X ( le `  K ) X  -> 
(  ._|_  `  X )
( le `  K
) (  ._|_  `  X
) ) )  /\  ( X  .\/  (  ._|_  `  X ) )  =  .1.  /\  ( X ( meet `  K
) (  ._|_  `  X
) )  =  ( 0. `  K ) ) )
983anidm23 1243 . 2  |-  ( ( K  e.  OP  /\  X  e.  B )  ->  ( ( (  ._|_  `  X )  e.  B  /\  (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  ( X ( le `  K ) X  -> 
(  ._|_  `  X )
( le `  K
) (  ._|_  `  X
) ) )  /\  ( X  .\/  (  ._|_  `  X ) )  =  .1.  /\  ( X ( meet `  K
) (  ._|_  `  X
) )  =  ( 0. `  K ) ) )
109simp2d 970 1  |-  ( ( K  e.  OP  /\  X  e.  B )  ->  ( X  .\/  (  ._|_  `  X ) )  =  .1.  )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    /\ w3a 936    = wceq 1649    e. wcel 1717   class class class wbr 4154   ` cfv 5395  (class class class)co 6021   Basecbs 13397   lecple 13464   occoc 13465   joincjn 14329   meetcmee 14330   0.cp0 14394   1.cp1 14395   OPcops 29288
This theorem is referenced by:  dih1  31402
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