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

Theorem brdifun 6133
Description: Evaluate the incomparability relation. (Contributed by Mario Carneiro, 9-Jul-2014.)
Hypothesis
Ref Expression
swoer.1 𝑅 = ((𝑋 × 𝑋) ∖ ( < < ))
Assertion
Ref Expression
brdifun ((𝐴𝑋𝐵𝑋) → (𝐴𝑅𝐵 ↔ ¬ (𝐴 < 𝐵𝐵 < 𝐴)))

Proof of Theorem brdifun
StepHypRef Expression
1 opelxpi 4376 . . . 4 ((𝐴𝑋𝐵𝑋) → ⟨𝐴, 𝐵⟩ ∈ (𝑋 × 𝑋))
2 df-br 3765 . . . 4 (𝐴(𝑋 × 𝑋)𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑋 × 𝑋))
31, 2sylibr 137 . . 3 ((𝐴𝑋𝐵𝑋) → 𝐴(𝑋 × 𝑋)𝐵)
4 swoer.1 . . . . . 6 𝑅 = ((𝑋 × 𝑋) ∖ ( < < ))
54breqi 3770 . . . . 5 (𝐴𝑅𝐵𝐴((𝑋 × 𝑋) ∖ ( < < ))𝐵)
6 brdif 3812 . . . . 5 (𝐴((𝑋 × 𝑋) ∖ ( < < ))𝐵 ↔ (𝐴(𝑋 × 𝑋)𝐵 ∧ ¬ 𝐴( < < )𝐵))
75, 6bitri 173 . . . 4 (𝐴𝑅𝐵 ↔ (𝐴(𝑋 × 𝑋)𝐵 ∧ ¬ 𝐴( < < )𝐵))
87baib 828 . . 3 (𝐴(𝑋 × 𝑋)𝐵 → (𝐴𝑅𝐵 ↔ ¬ 𝐴( < < )𝐵))
93, 8syl 14 . 2 ((𝐴𝑋𝐵𝑋) → (𝐴𝑅𝐵 ↔ ¬ 𝐴( < < )𝐵))
10 brun 3810 . . . 4 (𝐴( < < )𝐵 ↔ (𝐴 < 𝐵𝐴 < 𝐵))
11 brcnvg 4516 . . . . 5 ((𝐴𝑋𝐵𝑋) → (𝐴 < 𝐵𝐵 < 𝐴))
1211orbi2d 704 . . . 4 ((𝐴𝑋𝐵𝑋) → ((𝐴 < 𝐵𝐴 < 𝐵) ↔ (𝐴 < 𝐵𝐵 < 𝐴)))
1310, 12syl5bb 181 . . 3 ((𝐴𝑋𝐵𝑋) → (𝐴( < < )𝐵 ↔ (𝐴 < 𝐵𝐵 < 𝐴)))
1413notbid 592 . 2 ((𝐴𝑋𝐵𝑋) → (¬ 𝐴( < < )𝐵 ↔ ¬ (𝐴 < 𝐵𝐵 < 𝐴)))
159, 14bitrd 177 1 ((𝐴𝑋𝐵𝑋) → (𝐴𝑅𝐵 ↔ ¬ (𝐴 < 𝐵𝐵 < 𝐴)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 97  wb 98  wo 629   = wceq 1243  wcel 1393  cdif 2914  cun 2915  cop 3378   class class class wbr 3764   × cxp 4343  ccnv 4344
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-br 3765  df-opab 3819  df-xp 4351  df-cnv 4353
This theorem is referenced by:  swoer  6134  swoord1  6135  swoord2  6136
  Copyright terms: Public domain W3C validator