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

Theorem brdifun 6199
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 4402 . . . 4 ((𝐴𝑋𝐵𝑋) → ⟨𝐴, 𝐵⟩ ∈ (𝑋 × 𝑋))
2 df-br 3794 . . . 4 (𝐴(𝑋 × 𝑋)𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑋 × 𝑋))
31, 2sylibr 132 . . 3 ((𝐴𝑋𝐵𝑋) → 𝐴(𝑋 × 𝑋)𝐵)
4 swoer.1 . . . . . 6 𝑅 = ((𝑋 × 𝑋) ∖ ( < < ))
54breqi 3799 . . . . 5 (𝐴𝑅𝐵𝐴((𝑋 × 𝑋) ∖ ( < < ))𝐵)
6 brdif 3841 . . . . 5 (𝐴((𝑋 × 𝑋) ∖ ( < < ))𝐵 ↔ (𝐴(𝑋 × 𝑋)𝐵 ∧ ¬ 𝐴( < < )𝐵))
75, 6bitri 182 . . . 4 (𝐴𝑅𝐵 ↔ (𝐴(𝑋 × 𝑋)𝐵 ∧ ¬ 𝐴( < < )𝐵))
87baib 862 . . 3 (𝐴(𝑋 × 𝑋)𝐵 → (𝐴𝑅𝐵 ↔ ¬ 𝐴( < < )𝐵))
93, 8syl 14 . 2 ((𝐴𝑋𝐵𝑋) → (𝐴𝑅𝐵 ↔ ¬ 𝐴( < < )𝐵))
10 brun 3839 . . . 4 (𝐴( < < )𝐵 ↔ (𝐴 < 𝐵𝐴 < 𝐵))
11 brcnvg 4544 . . . . 5 ((𝐴𝑋𝐵𝑋) → (𝐴 < 𝐵𝐵 < 𝐴))
1211orbi2d 737 . . . 4 ((𝐴𝑋𝐵𝑋) → ((𝐴 < 𝐵𝐴 < 𝐵) ↔ (𝐴 < 𝐵𝐵 < 𝐴)))
1310, 12syl5bb 190 . . 3 ((𝐴𝑋𝐵𝑋) → (𝐴( < < )𝐵 ↔ (𝐴 < 𝐵𝐵 < 𝐴)))
1413notbid 625 . 2 ((𝐴𝑋𝐵𝑋) → (¬ 𝐴( < < )𝐵 ↔ ¬ (𝐴 < 𝐵𝐵 < 𝐴)))
159, 14bitrd 186 1 ((𝐴𝑋𝐵𝑋) → (𝐴𝑅𝐵 ↔ ¬ (𝐴 < 𝐵𝐵 < 𝐴)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 102  wb 103  wo 662   = wceq 1285  wcel 1434  cdif 2971  cun 2972  cop 3409   class class class wbr 3793   × cxp 4369  ccnv 4370
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2064  ax-sep 3904  ax-pow 3956  ax-pr 3972
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-nf 1391  df-sb 1687  df-eu 1945  df-mo 1946  df-clab 2069  df-cleq 2075  df-clel 2078  df-nfc 2209  df-ral 2354  df-rex 2355  df-v 2604  df-dif 2976  df-un 2978  df-in 2980  df-ss 2987  df-pw 3392  df-sn 3412  df-pr 3413  df-op 3415  df-br 3794  df-opab 3848  df-xp 4377  df-cnv 4379
This theorem is referenced by:  swoer  6200  swoord1  6201  swoord2  6202
  Copyright terms: Public domain W3C validator