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

Theorem brdifun 6647
Description: Evaluate the incomparability relation. (Contributed by Mario Carneiro, 9-Jul-2014.)
Hypothesis
Ref Expression
swoer.1  |-  R  =  ( ( X  X.  X )  \  (  .<  u.  `'  .<  )
)
Assertion
Ref Expression
brdifun  |-  ( ( A  e.  X  /\  B  e.  X )  ->  ( A R B  <->  -.  ( A  .<  B  \/  B  .<  A ) ) )

Proof of Theorem brdifun
StepHypRef Expression
1 opelxpi 4707 . . . 4  |-  ( ( A  e.  X  /\  B  e.  X )  -> 
<. A ,  B >.  e.  ( X  X.  X
) )
2 df-br 4045 . . . 4  |-  ( A ( X  X.  X
) B  <->  <. A ,  B >.  e.  ( X  X.  X ) )
31, 2sylibr 134 . . 3  |-  ( ( A  e.  X  /\  B  e.  X )  ->  A ( X  X.  X ) B )
4 swoer.1 . . . . . 6  |-  R  =  ( ( X  X.  X )  \  (  .<  u.  `'  .<  )
)
54breqi 4050 . . . . 5  |-  ( A R B  <->  A (
( X  X.  X
)  \  (  .<  u.  `'  .<  ) ) B )
6 brdif 4097 . . . . 5  |-  ( A ( ( X  X.  X )  \  (  .<  u.  `'  .<  )
) B  <->  ( A
( X  X.  X
) B  /\  -.  A (  .<  u.  `'  .<  ) B ) )
75, 6bitri 184 . . . 4  |-  ( A R B  <->  ( A
( X  X.  X
) B  /\  -.  A (  .<  u.  `'  .<  ) B ) )
87baib 921 . . 3  |-  ( A ( X  X.  X
) B  ->  ( A R B  <->  -.  A
(  .<  u.  `'  .<  ) B ) )
93, 8syl 14 . 2  |-  ( ( A  e.  X  /\  B  e.  X )  ->  ( A R B  <->  -.  A (  .<  u.  `'  .<  ) B ) )
10 brun 4095 . . . 4  |-  ( A (  .<  u.  `'  .<  ) B  <->  ( A  .<  B  \/  A `'  .<  B ) )
11 brcnvg 4859 . . . . 5  |-  ( ( A  e.  X  /\  B  e.  X )  ->  ( A `'  .<  B  <-> 
B  .<  A ) )
1211orbi2d 792 . . . 4  |-  ( ( A  e.  X  /\  B  e.  X )  ->  ( ( A  .<  B  \/  A `'  .<  B )  <->  ( A  .<  B  \/  B  .<  A ) ) )
1310, 12bitrid 192 . . 3  |-  ( ( A  e.  X  /\  B  e.  X )  ->  ( A (  .<  u.  `'  .<  ) B  <->  ( A  .<  B  \/  B  .<  A ) ) )
1413notbid 669 . 2  |-  ( ( A  e.  X  /\  B  e.  X )  ->  ( -.  A ( 
.<  u.  `'  .<  ) B 
<->  -.  ( A  .<  B  \/  B  .<  A ) ) )
159, 14bitrd 188 1  |-  ( ( A  e.  X  /\  B  e.  X )  ->  ( A R B  <->  -.  ( A  .<  B  \/  B  .<  A ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 710    = wceq 1373    e. wcel 2176    \ cdif 3163    u. cun 3164   <.cop 3636   class class class wbr 4044    X. cxp 4673   `'ccnv 4674
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-br 4045  df-opab 4106  df-xp 4681  df-cnv 4683
This theorem is referenced by:  swoer  6648  swoord1  6649  swoord2  6650
  Copyright terms: Public domain W3C validator