MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  brdifun Structured version   Visualization version   GIF version

Theorem brdifun 8732
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 5714 . . . 4 ((𝐴𝑋𝐵𝑋) → ⟨𝐴, 𝐵⟩ ∈ (𝑋 × 𝑋))
2 df-br 5150 . . . 4 (𝐴(𝑋 × 𝑋)𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑋 × 𝑋))
31, 2sylibr 233 . . 3 ((𝐴𝑋𝐵𝑋) → 𝐴(𝑋 × 𝑋)𝐵)
4 swoer.1 . . . . . 6 𝑅 = ((𝑋 × 𝑋) ∖ ( < < ))
54breqi 5155 . . . . 5 (𝐴𝑅𝐵𝐴((𝑋 × 𝑋) ∖ ( < < ))𝐵)
6 brdif 5202 . . . . 5 (𝐴((𝑋 × 𝑋) ∖ ( < < ))𝐵 ↔ (𝐴(𝑋 × 𝑋)𝐵 ∧ ¬ 𝐴( < < )𝐵))
75, 6bitri 275 . . . 4 (𝐴𝑅𝐵 ↔ (𝐴(𝑋 × 𝑋)𝐵 ∧ ¬ 𝐴( < < )𝐵))
87baib 537 . . 3 (𝐴(𝑋 × 𝑋)𝐵 → (𝐴𝑅𝐵 ↔ ¬ 𝐴( < < )𝐵))
93, 8syl 17 . 2 ((𝐴𝑋𝐵𝑋) → (𝐴𝑅𝐵 ↔ ¬ 𝐴( < < )𝐵))
10 brun 5200 . . . 4 (𝐴( < < )𝐵 ↔ (𝐴 < 𝐵𝐴 < 𝐵))
11 brcnvg 5880 . . . . 5 ((𝐴𝑋𝐵𝑋) → (𝐴 < 𝐵𝐵 < 𝐴))
1211orbi2d 915 . . . 4 ((𝐴𝑋𝐵𝑋) → ((𝐴 < 𝐵𝐴 < 𝐵) ↔ (𝐴 < 𝐵𝐵 < 𝐴)))
1310, 12bitrid 283 . . 3 ((𝐴𝑋𝐵𝑋) → (𝐴( < < )𝐵 ↔ (𝐴 < 𝐵𝐵 < 𝐴)))
1413notbid 318 . 2 ((𝐴𝑋𝐵𝑋) → (¬ 𝐴( < < )𝐵 ↔ ¬ (𝐴 < 𝐵𝐵 < 𝐴)))
159, 14bitrd 279 1 ((𝐴𝑋𝐵𝑋) → (𝐴𝑅𝐵 ↔ ¬ (𝐴 < 𝐵𝐵 < 𝐴)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 397  wo 846   = wceq 1542  wcel 2107  cdif 3946  cun 3947  cop 4635   class class class wbr 5149   × cxp 5675  ccnv 5676
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-br 5150  df-opab 5212  df-xp 5683  df-cnv 5685
This theorem is referenced by:  swoer  8733  swoord1  8734  swoord2  8735  swoso  8736
  Copyright terms: Public domain W3C validator