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

Theorem brdifun 6728
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 4757 . . . 4  |-  ( ( A  e.  X  /\  B  e.  X )  -> 
<. A ,  B >.  e.  ( X  X.  X
) )
2 df-br 4089 . . . 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 4094 . . . . 5  |-  ( A R B  <->  A (
( X  X.  X
)  \  (  .<  u.  `'  .<  ) ) B )
6 brdif 4142 . . . . 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 926 . . 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 4140 . . . 4  |-  ( A (  .<  u.  `'  .<  ) B  <->  ( A  .<  B  \/  A `'  .<  B ) )
11 brcnvg 4911 . . . . 5  |-  ( ( A  e.  X  /\  B  e.  X )  ->  ( A `'  .<  B  <-> 
B  .<  A ) )
1211orbi2d 797 . . . 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 673 . 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 715    = wceq 1397    e. wcel 2202    \ cdif 3197    u. cun 3198   <.cop 3672   class class class wbr 4088    X. cxp 4723   `'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-rex 2516  df-v 2804  df-dif 3202  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-xp 4731  df-cnv 4733
This theorem is referenced by:  swoer  6729  swoord1  6730  swoord2  6731
  Copyright terms: Public domain W3C validator