![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > brdifun | Structured version Visualization version GIF version |
Description: Evaluate the incomparability relation. (Contributed by Mario Carneiro, 9-Jul-2014.) |
Ref | Expression |
---|---|
swoer.1 | ⊢ 𝑅 = ((𝑋 × 𝑋) ∖ ( < ∪ ◡ < )) |
Ref | Expression |
---|---|
brdifun | ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑅𝐵 ↔ ¬ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opelxpi 5347 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 〈𝐴, 𝐵〉 ∈ (𝑋 × 𝑋)) | |
2 | df-br 4842 | . . . 4 ⊢ (𝐴(𝑋 × 𝑋)𝐵 ↔ 〈𝐴, 𝐵〉 ∈ (𝑋 × 𝑋)) | |
3 | 1, 2 | sylibr 226 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐴(𝑋 × 𝑋)𝐵) |
4 | swoer.1 | . . . . . 6 ⊢ 𝑅 = ((𝑋 × 𝑋) ∖ ( < ∪ ◡ < )) | |
5 | 4 | breqi 4847 | . . . . 5 ⊢ (𝐴𝑅𝐵 ↔ 𝐴((𝑋 × 𝑋) ∖ ( < ∪ ◡ < ))𝐵) |
6 | brdif 4894 | . . . . 5 ⊢ (𝐴((𝑋 × 𝑋) ∖ ( < ∪ ◡ < ))𝐵 ↔ (𝐴(𝑋 × 𝑋)𝐵 ∧ ¬ 𝐴( < ∪ ◡ < )𝐵)) | |
7 | 5, 6 | bitri 267 | . . . 4 ⊢ (𝐴𝑅𝐵 ↔ (𝐴(𝑋 × 𝑋)𝐵 ∧ ¬ 𝐴( < ∪ ◡ < )𝐵)) |
8 | 7 | baib 532 | . . 3 ⊢ (𝐴(𝑋 × 𝑋)𝐵 → (𝐴𝑅𝐵 ↔ ¬ 𝐴( < ∪ ◡ < )𝐵)) |
9 | 3, 8 | syl 17 | . 2 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑅𝐵 ↔ ¬ 𝐴( < ∪ ◡ < )𝐵)) |
10 | brun 4892 | . . . 4 ⊢ (𝐴( < ∪ ◡ < )𝐵 ↔ (𝐴 < 𝐵 ∨ 𝐴◡ < 𝐵)) | |
11 | brcnvg 5503 | . . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴◡ < 𝐵 ↔ 𝐵 < 𝐴)) | |
12 | 11 | orbi2d 940 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴 < 𝐵 ∨ 𝐴◡ < 𝐵) ↔ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))) |
13 | 10, 12 | syl5bb 275 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴( < ∪ ◡ < )𝐵 ↔ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))) |
14 | 13 | notbid 310 | . 2 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (¬ 𝐴( < ∪ ◡ < )𝐵 ↔ ¬ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))) |
15 | 9, 14 | bitrd 271 | 1 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑅𝐵 ↔ ¬ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 198 ∧ wa 385 ∨ wo 874 = wceq 1653 ∈ wcel 2157 ∖ cdif 3764 ∪ cun 3765 〈cop 4372 class class class wbr 4841 × cxp 5308 ◡ccnv 5309 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-13 2354 ax-ext 2775 ax-sep 4973 ax-nul 4981 ax-pr 5095 |
This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-3an 1110 df-tru 1657 df-ex 1876 df-nf 1880 df-sb 2065 df-mo 2590 df-eu 2607 df-clab 2784 df-cleq 2790 df-clel 2793 df-nfc 2928 df-ral 3092 df-rex 3093 df-rab 3096 df-v 3385 df-dif 3770 df-un 3772 df-in 3774 df-ss 3781 df-nul 4114 df-if 4276 df-sn 4367 df-pr 4369 df-op 4373 df-br 4842 df-opab 4904 df-xp 5316 df-cnv 5318 |
This theorem is referenced by: swoer 8010 swoord1 8011 swoord2 8012 swoso 8013 |
Copyright terms: Public domain | W3C validator |