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

Theorem brdifun 6660
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 4715 . . . 4 ((𝐴𝑋𝐵𝑋) → ⟨𝐴, 𝐵⟩ ∈ (𝑋 × 𝑋))
2 df-br 4052 . . . 4 (𝐴(𝑋 × 𝑋)𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑋 × 𝑋))
31, 2sylibr 134 . . 3 ((𝐴𝑋𝐵𝑋) → 𝐴(𝑋 × 𝑋)𝐵)
4 swoer.1 . . . . . 6 𝑅 = ((𝑋 × 𝑋) ∖ ( < < ))
54breqi 4057 . . . . 5 (𝐴𝑅𝐵𝐴((𝑋 × 𝑋) ∖ ( < < ))𝐵)
6 brdif 4105 . . . . 5 (𝐴((𝑋 × 𝑋) ∖ ( < < ))𝐵 ↔ (𝐴(𝑋 × 𝑋)𝐵 ∧ ¬ 𝐴( < < )𝐵))
75, 6bitri 184 . . . 4 (𝐴𝑅𝐵 ↔ (𝐴(𝑋 × 𝑋)𝐵 ∧ ¬ 𝐴( < < )𝐵))
87baib 921 . . 3 (𝐴(𝑋 × 𝑋)𝐵 → (𝐴𝑅𝐵 ↔ ¬ 𝐴( < < )𝐵))
93, 8syl 14 . 2 ((𝐴𝑋𝐵𝑋) → (𝐴𝑅𝐵 ↔ ¬ 𝐴( < < )𝐵))
10 brun 4103 . . . 4 (𝐴( < < )𝐵 ↔ (𝐴 < 𝐵𝐴 < 𝐵))
11 brcnvg 4867 . . . . 5 ((𝐴𝑋𝐵𝑋) → (𝐴 < 𝐵𝐵 < 𝐴))
1211orbi2d 792 . . . 4 ((𝐴𝑋𝐵𝑋) → ((𝐴 < 𝐵𝐴 < 𝐵) ↔ (𝐴 < 𝐵𝐵 < 𝐴)))
1310, 12bitrid 192 . . 3 ((𝐴𝑋𝐵𝑋) → (𝐴( < < )𝐵 ↔ (𝐴 < 𝐵𝐵 < 𝐴)))
1413notbid 669 . 2 ((𝐴𝑋𝐵𝑋) → (¬ 𝐴( < < )𝐵 ↔ ¬ (𝐴 < 𝐵𝐵 < 𝐴)))
159, 14bitrd 188 1 ((𝐴𝑋𝐵𝑋) → (𝐴𝑅𝐵 ↔ ¬ (𝐴 < 𝐵𝐵 < 𝐴)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 710   = wceq 1373  wcel 2177  cdif 3167  cun 3168  cop 3641   class class class wbr 4051   × cxp 4681  ccnv 4682
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 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2180  ax-ext 2188  ax-sep 4170  ax-pow 4226  ax-pr 4261
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-v 2775  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-br 4052  df-opab 4114  df-xp 4689  df-cnv 4691
This theorem is referenced by:  swoer  6661  swoord1  6662  swoord2  6663
  Copyright terms: Public domain W3C validator